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
- 13451
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.2757088e-05
- Overall Rank
- 9,822 | 31.68%
- DOI
-
10.14778/3665844.3665851
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
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 |
| 65 |
Fast Subsequence Matching in Time-Series Databases |
1994 |
SIGMOD |
0.00062029383 |
| 79 |
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces |
1998 |
VLDB |
0.00056242144 |
| 212 |
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph |
2019 |
VLDB |
0.00033913475 |
| 243 |
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases |
2001 |
SIGMOD |
0.00031074984 |
| 539 |
Fast Time Sequence Indexing for Arbitrary L_p Norms |
2000 |
VLDB |
0.00020666392 |
| 605 |
Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting |
2012 |
SIGMOD |
0.000193396 |
| 693 |
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences |
1997 |
SIGMOD |
0.00018077335 |
| 867 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015792021 |
| 1,010 |
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces |
2018 |
VLDB |
0.00014652858 |
| 1,157 |
A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series |
2013 |
VLDB |
0.00013610658 |
| 2,725 |
HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search |
2022 |
VLDB |
8.2294908e-05 |
| 3,183 |
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search |
2020 |
VLDB |
7.4228241e-05 |
| 3,400 |
ELPIS: Graph-Based Similarity Search for Scalable Data Science |
2023 |
VLDB |
7.1405533e-05 |
| 3,629 |
The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art |
2019 |
VLDB |
6.902069e-05 |
| 4,243 |
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring |
2020 |
SIGMOD |
6.32976e-05 |
| 4,755 |
Indexing for Interactive Exploration of Big Data Series |
2014 |
SIGMOD |
5.946863e-05 |
| 5,158 |
Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes |
2018 |
VLDB |
5.6588553e-05 |
| 5,738 |
Hercules Against Data Series Similarity Search |
2022 |
VLDB |
5.3478528e-05 |
| 7,095 |
Dumpy: A Compact and Adaptive Index for Large Data Series Collections |
2023 |
SIGMOD |
4.8350023e-05 |
| 9,206 |
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search |
2023 |
VLDB |
4.373492e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,158 |
Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph |
2026 |
SIGMOD |
4.1945683e-05 |
| 7,109 |
Efficient Similarity Join and Search on Multi-Attribute Data |
2015 |
SIGMOD |
4.8292998e-05 |
| 3,183 |
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search |
2020 |
VLDB |
7.4228241e-05 |
| 34 |
Similarity Search in High Dimensions via Hashing |
1999 |
VLDB |
0.00076637636 |
| 6,577 |
On Efficiently Searching Trajectories and Archival Data for Historical Similarities |
2008 |
VLDB |
5.0042166e-05 |
| 1,157 |
A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series |
2013 |
VLDB |
0.00013610658 |
| 3,609 |
Similarity search in the blink of an eye with compressed indices |
2023 |
VLDB |
6.9215236e-05 |
| 5,738 |
Hercules Against Data Series Similarity Search |
2022 |
VLDB |
5.3478528e-05 |
| 8,647 |
A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases |
2006 |
SIGMOD |
4.4768766e-05 |
| 3,540 |
Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach |
2018 |
VLDB |
6.9943185e-05 |