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
13639
Venue
VLDB
Year
2024
Pagerank
5.18753e-05
Overall Rank
9,964 | 31.64%
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
6,615 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 5.8214312e-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
41 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00046675394
46 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044853085
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
190 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00026105472
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
468 Fast Time Sequence Indexing for Arbitrary Lp Norms 2000 VLDB 0.00017986163
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
610 Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences 1997 SIGMOD 0.00015783259
705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014829964
1,084 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012256753
1,802 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.7284341e-05
2,534 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.4561875e-05
2,734 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.190416e-05
3,037 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.8275859e-05
3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.5711218e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
4,883 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.4648124e-05
5,231 Hercules Against Data Series Similarity Search 2022 VLDB 6.3068064e-05
6,691 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.8011086e-05
9,278 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.2936898e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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