Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
作者： Raghu Ramakrishnan , Jonathan Goldstein
DOI:
关键词:
摘要:
参考文章(38)
Raghu Ramakrishnan, Jonathan David Goldstein, Improved query processing and data representation techniques The University of Wisconsin - Madison. ,(1999)
Alberto Belussi, Christos Faloutsos, Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension very large data bases. pp. 299- 310 ,(1995)
Rakesh Agrawal, Christos Faloutsos, Arun Swami, None, Efficient Similarity Search In Sequence Databases FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms. pp. 69- 84 ,(1993) , 10.1007/3-540-57301-1_5
Piotr Indyk, Aristides Gionis, Rajeev Motwani, Similarity Search in High Dimensions via Hashing very large data bases. pp. 518- 529 ,(1999)
Hans-Jörg Schek, Stephen Blott, Roger Weber, A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces very large data bases. pp. 194- 205 ,(1998)
Sergey Brin, Near Neighbor Search in Large Metric Spaces very large data bases. pp. 574- 584 ,(1995)
Christos Faloutsos, Volker Gaede, Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension very large data bases. pp. 40- 50 ,(1996)
Sunil Arya, Nearest neighbor searching and applications University of Maryland at College Park. ,(1996)
Sidney Addelman, Statistics for experimenters ,(1978)
Kristin P. Bennett, Usama Fayyad, Dan Geiger, Density-based indexing for approximate nearest-neighbor queries knowledge discovery and data mining. pp. 233- 243 ,(1999) , 10.1145/312129.312236