DBScholar

Back to papers

A Cost Model for Similarity Queries in Metric Spaces

Summary: Cost model for range and k-NN in metric spaces estimating CPU (distance computations) and I/O for M-tree by using global distance distributions under a probabilistic homogeneity assumption. Validated empirically; enables M-tree tuning and sketched extension to vp-tree. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1130
Venue
PODS
Year
1998
Pagerank
9.1657486e-05
Overall Rank
2,101 | 85.59%
DOI
10.1145/275487.275495

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ciaccia_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{A Cost Model for Similarity Queries in Metric Spaces}},
        url = {https://dl.acm.org/doi/10.1145/275487.275495},
        doi = {10.1145/275487.275495},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ciaccia, Paolo and Patella, Marco and Zezula, Pavel},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010407159
2,734 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.190416e-05
3,581 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 7.2873782e-05
4,212 Data Series Progressive Similarity Search with Probabilistic Quality Guarantees 2020 SIGMOD 6.8283344e-05
12,677 Peer-to-Peer Similarity Search in Metric Spaces 2007 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040719947
202 Generalized Search Trees for Database Systems (Extended Abstract) 1995 VLDB 0.00025454884
592 Distance-Based Indexing For High-Dimensional Metric Spaces 1997 SIGMOD 0.00016029789
784 Near Neighbor Search in Large Metric Spaces 1995 VLDB 0.00014069958
1,129 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00012061727
1,137 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS 0.00012027131
1,373 A Model for the Prediction of R-tree Performance 1996 PODS 0.0001098638
1,384 Content-Based Image Indexing 1994 VLDB 0.00010957733
2,774 Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension 1995 VLDB 8.1372328e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 12,463 Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures 2010 VLDB
2 1,605 Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases 2008 VLDB
3 9,417 Similarity Query Processing Using Disk Arrays 1998 SIGMOD
4 8,848 A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems 2021 SIGMOD
5 8,391 Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation 2001 VLDB
6 9,334 Adaptive Indexing in High-Dimensional Metric Spaces 2023 VLDB
7 1,373 A Model for the Prediction of R-tree Performance 1996 PODS
8 592 Distance-Based Indexing For High-Dimensional Metric Spaces 1997 SIGMOD
9 56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB
10 1,137 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS