DBScholar

Back to papers

DIDS: Double Indices and Double Summarizations for Fast Similarity Search

Summary: DIDS introduces Double Indices and Double Summarizations: combines traditional segment-based and novel reference-point-based summarizations with a sorted representation to tighten lower bounds and reduce invalid accesses. Uses reference-point clustering with a cost model and a graph-based inter-region index to improve approximate candidate quality and enable scalable, high-precision disk-based exact similarity search on large data-series collections. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
hed3afca6e78036ab
Venue
VLDB
Year
2024
Pagerank
5.0771316e-05
Overall Rank
10,121 | 31.96%
DOI
10.14778/3665844.3665851

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{hu_vldb24,
        title = {{DIDS: Double Indices and Double Summarizations for Fast Similarity Search}},
        author = {Hu, Han and Qiu, Jiye and Wang, Hongzhi and Liang, Bin and Zou, Songling},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {9},
        pages = {2198--2211},
        doi = {10.14778/3665844.3665851},
        url = {https://doi.org/10.14778/3665844.3665851},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
5,619 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 6.062554e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
42 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00045773967
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
193 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00025648171
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020585187
478 Fast Time Sequence Indexing for Arbitrary Lp Norms 2000 VLDB 0.00017631293
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
621 Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences 1997 SIGMOD 0.00015492309
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015149775
1,095 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012050625
1,684 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8801753e-05
2,265 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7238222e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0861221e-05
2,872 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.9228762e-05
2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8000797e-05
4,680 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4722037e-05
4,986 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.3264608e-05
5,313 Hercules Against Data Series Similarity Search 2022 VLDB 6.1846986e-05
6,609 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.7354155e-05
9,440 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.1771634e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 7,030 Efficient Similarity Join and Search on Multi-Attribute Data 2015 SIGMOD
2 2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB
3 20 Similarity Search in High Dimensions via Hashing 1999 VLDB
4 6,890 On Efficiently Searching Trajectories and Archival Data for Historical Similarities 2008 VLDB
5 1,095 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB
6 2,060 Similarity search in the blink of an eye with compressed indices 2023 VLDB
7 5,313 Hercules Against Data Series Similarity Search 2022 VLDB
8 8,818 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD
9 3,513 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB
10 10,443 Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search 2026 SIGMOD