DBScholar

Back to papers

Optimal Multi-Step k-Nearest Neighbor Search

Summary: Two-stage kNN search for high-dimensional, adaptable similarity functions. Novel multi-step algorithm guarantees the minimum candidate set, outperforming Korn et al. 1996 with up to 120× fewer candidates and 48× faster runtime. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h751cabf5bc18a722
Venue
SIGMOD
Year
1998
Pagerank
0.00013588099
Overall Rank
828 | 94.46%
DOI
10.1145/276304.276319

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{seidl_sigmod98,
        title = {{Optimal Multi-Step k-Nearest Neighbor Search}},
        author = {Seidl, Thomas and Kriegel, Hans-Peter},
        series = {{SIGMOD} '98},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/276304.276319},
        url = {https://dl.acm.org/doi/10.1145/276304.276319},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 24 of 24 citing papers.

Rank Citing Paper Year Venue Pagerank
198 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00025558119
463 Query Processing in Spatial Network Databases 2003 VLDB 0.00017806376
616 Exact Indexing of Dynamic Time Warping 2002 VLDB 0.00015512487
647 Evaluating Top-k Selection Queries 1999 VLDB 0.00015165562
681 Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases 2004 VLDB 0.00014792999
1,075 Warping Indexes with Envelope Transforms for Query by Humming 2003 SIGMOD 0.00012129172
1,311 Continuous Nearest Neighbor Search 2002 VLDB 0.00011063629
2,416 S4: Top-k Spreadsheet-Style Search for Query Discovery 2015 SIGMOD 8.4837888e-05
3,118 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.6114853e-05
3,330 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 7.406702e-05
3,424 Efficient EMD-based Similarity Search in Multimedia Databases via Flexible Dimensionality Reduction 2008 SIGMOD 7.2974683e-05
3,666 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 7.0975312e-05
4,216 Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance 2010 VLDB 6.717297e-05
4,921 An Efficient Index Structure for String Databases 2001 VLDB 6.3441964e-05
5,737 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.9955855e-05
5,970 Improving Adaptable Similarity Query Processing by Using Approximations 1998 VLDB 5.9116326e-05
6,552 Adaptive Multi-Stage Distance Join Processing 2000 SIGMOD 5.7306642e-05
6,913 On Efficiently Searching Trajectories and Archival Data for Historical Similarities 2008 VLDB 5.6331177e-05
7,045 A New Method for Similarity Indexing of Market Basket Data 1999 SIGMOD 5.5975731e-05
8,308 Anticipatory DTW for Efficient Similarity Search in Time Series Databases 2009 VLDB 5.3417975e-05
8,844 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 5.2501688e-05
9,466 Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects 2003 SIGMOD 5.1590473e-05
12,762 K-Nearest Neighbor Search for Fuzzy Objects 2010 SIGMOD 4.9605343e-05
13,152 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers