DBScholar

Back to papers

Data Series Progressive Similarity Search with Probabilistic Quality Guarantees

Summary: Proposes a probabilistic learning-based method for progressive NN search on data series with probabilistic quality guarantees. Delivers initial and progressive estimates with stopping criteria, showing practical accuracy/efficiency gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6028
Venue
SIGMOD
Year
2020
Pagerank
6.8283344e-05
Overall Rank
4,212 | 71.11%
DOI
10.1145/3318464.3389751

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gogolou_sigmod20,
        title = {{Data Series Progressive Similarity Search with Probabilistic Quality Guarantees}},
        author = {Gogolou, Anna and Tsandilas, Theophanis and Echihabi, Karima and Bezerianos, Anastasia and Palpanas, Themis},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3389751},
        url = {https://dl.acm.org/doi/10.1145/3318464.3389751},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 cited papers.

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

Rank Cited Paper Year Venue Pagerank
9 Online Aggregation 1997 SIGMOD 0.00077458002
41 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00046675394
190 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00026105472
784 Near Neighbor Search in Large Metric Spaces 1995 VLDB 0.00014069958
898 Querying and Mining of Time Series Data: Experimental Comparison of Representations and Distance Measures 2008 VLDB 0.00013339042
926 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013181732
986 Effortless Data Exploration with zenvisage: An Expressive and Interactive Visual Analytics System 2017 VLDB 0.0001281777
1,064 Scalable Approximate Query Processing With The DBO Engine 2007 SIGMOD 0.00012336248
1,084 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012256753
1,108 Approximate Query Processing: No Silver Bullet 2017 SIGMOD 0.00012145154
1,392 Northstar: An Interactive Data Science System 2018 VLDB 0.00010936065
1,512 On the Analysis of Indexing Schemes 1997 PODS 0.00010536001
1,962 Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee 2016 SIGMOD 9.3978414e-05
2,003 Indexing for Data Models with Constraints and Classes (Extended Abstract) 1993 PODS 9.3214272e-05
2,101 A Cost Model for Similarity Queries in Metric Spaces 1998 PODS 9.1657486e-05
2,346 Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series 2020 VLDB 8.7168932e-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,288 I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making 2017 VLDB 7.5578177e-05
3,322 RINSE: Interactive Data Series Exploration with ADS+ 2015 VLDB 7.5213802e-05
3,486 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.3696676e-05
4,506 Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series 2018 SIGMOD 6.6569729e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
5,244 Top-k Nearest Neighbor Search In Uncertain Data Series 2015 VLDB 6.3018164e-05
Previous Page 1 / 1 Next

Semantically Similar Papers