Optimal multi-step k-nearest neighbor search

SIGMOD Record

Volumn 27, Issue 2, 1998, Pages 154-165

  Seidl, Thomas ^a   Kriegel, Hans Peter ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA STRUCTURES; FUNCTIONS; MATHEMATICAL MODELS; QUERY LANGUAGES;

MEDIUM-DIMENSIONAL SIMILARITY DISTANCE FUNCTIONS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0032094249     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/276305.276319     Document Type: Article

References (34)

1. Agrawal R., Faloutsos C., Swami A.: 'Efficient Similarity Search in Sequence Databases', Proc. 4th. Int. Conf. on Foundations of Data Organization and Algorithms (FODO'93), Evanston, IL, in: Lecture Notes in Computer Science, Vol. 730, Springer, 1993, pp. 69-84.
2. Ankerst M., Kriegel H.-P., Seidl T.: 'Pixel-based Shape Similarity Search in Large Image Databases', submitted for publication.
3. Agrawal R., Lin K.-I., Sawhney H. S., Shim K.: 'Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases', Proc. 21th Int. Conf. on Very Large Databases (VLDB'95), Morgan Kaufmann, 1995, pp. 490-501.
4. Arya S., Mount D. M., Narayan O.: 'Accounting for Boundary Effects in Nearest Neighbor Searching', Proc. 11th Annual Symposium on Computational Geometry, Vancouver, Canada, 1995, pp. 336-344.
5. Berchtold S., Böhm C., Keim D. A., Kriegel H.-P.: 'A Cost Model for Nearest Neighbor Search in High-Dimensional Data Spaces', Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 78-86.
6. Berchtold S., Böhm C., Braunmüller B., Keim D. A., Kriegel H.-P.: 'Fast Parallel Similarity Search in Multimedia Databases', Proc. ACM SIGMOD Int. Conf. on Management of Data, Tucson, AZ, 1997, pp. 1-12, Best Paper Award.
7. Berchtold S., Ertl B., Keim D. A., Kriegel H.-P., Seidl T.: 'Fast Nearest Neighbor Search in High-dimensional Spaces', Proc. 14th Int. Conf. on Data Engineering (ICDE'98), Orlando, Florida, 1998.
8. Brinkhoff T., Horn H., Kriegel H.-P., Schneider R.: 'A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems', Proc. 3rd Int. Symp. on Large Spatial Databases (SSD'93), Singapore, 1993, in: Lecture Notes in Computer Science, Vol. 692, Springer, pp. 357-376.
9. Berchtold S., Keim D. A., Kriegel H.-P.: 'The X-tree: An Index Structure for High-Dimensional Data', Proc. 22nd Int. Conf. on Very Large Data Bases (VLDB'96), Mumbai, India, 1996, pp. 28-39.
10. Berchtold S., Kriegel H.-P.: 'S3: Similarity Search in CAD Database Systems', Proc. ACM SIGMOD Int. Conf. on Management of Data, Tucson, AZ, 1997, pp. 564-567.
11. Badel A., Mornon J. P., Hazout S.: 'Searching for Geometric Molecular Shape Complementarity Using Bidimensional Surface Profiles', Journal of Molecular Graphics, Vol. 10, 1992, pp. 205-211.
12. Ciacca P., Patella M., Zezula P.: 'M-tree: An Efficient Access Method for Similarity Search in Metric Spaces', Proc. 23rd Int. Conf. on Very Large Databases (VLDB'97), Athens, Greece, 1997, pp. 426-435.
13. Faloutsos C., Barber R., Flickner M., Hafner J., Niblack W., Petkovic D., Equitz W.: 'Efficient and Effective Querying by Image Content', Journal of Intelligent Information Systems, Vol. 3, 1994, pp. 231-262.
14. Friedman J. H., Bentley J. L., Finkel R. A.: 'An Algorithm for Finding the Best Matches in Logarithmic Expected Time', ACM Transactions on Math. Software, Vol. 3, 1977, pp. 209-226.
15. Faloutsos C., Lin K.-I.: 'FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Data', Proc. ACM SIGMOD Int. Conf. on Management of Data, San Jose, CA, 1995, pp. 163-174.
16. Faloutsos C., Ranganathan M., Manolopoulos Y.: 'Fast Subsequence Matching in Time-Series Databases', Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, MN, 1994, pp. 419-429.
17. Gaede V., Günther O.: 'Multidimensional Access Methods', ACM Computing Surveys.
18. Gary J. E., Mehrotra R.: 'Similar Shape Retrieval using a Structural Feature Index', Information Systems, Vol. 18, No. 7, 1993, pp. 525-537.
19. Hafner J., Sawhney H. S., Equitz W., Flickner M., Niblack W.: 'Efficient Color Histogram Indexing for Quadratic Form Distance Functions', IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 17, No. 7, 1995, pp. 729-736.
20. Henrich, A.: 'A Distance-Scan Algorithm for Spatial Access Structures', Proc. 2nd ACM Workshop on Advances in Geographic Information Systems, Gaithersburg, Maryland, 1994, pp. 136-143.
21. Hjaltason G. R., Samet H.: 'Ranking in Spatial Databases', Proc. 4th Int. Symposium on Large Spatial Databases (SSD'95), in: Lecture Notes in Computer Science, Vol. 951, Springer, 1995, pp. 83-95.
22. Jagadish H. V.: 'A Retrieval Technique for Similar Shapes', Proc. ACM SIGMOD Int. Conf. on Managementof Data, 1991, pp. 208-217.
23. Korn F., Sidiropoulos N., Faloutsos C., Siegel E., Protopapas Z.: 'Fast Nearest Neighbor Search in Medical Image Databases', Proc. 22nd VLDB Conference, Mumbai, India, 1996, pp. 215-226.
24. Kriegel H.-P., Seidl T.: 'Approximation-Based Similarity Search for 3-D Surface Segments', GeoInformatica, Kluwer Academic Publishers, 1998, to appear.
25. Kriegel H.-P., Schmidt T., Seidl T.: '3D Similarity Search by Shape Approximation', Proc. Fifth Int. Symposium on Large Spatial Databases (SSD'97), Berlin, Germany, Lecture Notes in Computer Science, Vol. 1262, 1997, pp.11-28.
26. Orenstein J. A., Manola F. A.: 'PROBE Spatial Data Modeling and Query Processing in an Image Database Application', IEEE Trans. on Software Engineering, Vol. 14, No. 5, 1988, pp. 611-629.
27. Papadopoulos A., Manolopoulos Y.: 'Performance of Nearest Neighbor Queries in R-Trees', Proc. of the 6th International Conference on Database Theory, Delphi, Greece, 1997, LNCS 1186, pp. 394-408.
28. Preparata F. P., Shamos M. I.: 'Computational Geometry. An Introduction', Texts and Monographs in Computer Science. 5th, corr. ed., Springer, 1993.
29. Roussopoulos N., Kelley S., Vincent F.: 'Nearest Neighbor Queries', Proc. ACM SIGMOD Int. Conf. on Management of Data, San Jose, CA, 1995, pp. 71-79.
30. Ramasubramanian V., Paliwal K. K.: 'Fast k-Dimensional Tree Algorithms for Nearest Neighbor Search with Application to Vector Quantization Encoding', IEEE Transactions on Signal Processing, Vol. 40, No. 3, March 1992, pp. 518-531.
31. Seidl T.: 'Adaptable Similarity Search in 3-D Spatial Database Systems', PhD thesis, Institute for Computer Science, University of Munich, 1997.
32. Seidl T., Kriegel H.-P.: 'Efficient User-Adaptable Similarity Search in Large Multimedia Databases', Proc. 23rd Int. Conf. on Very Large Databases (VLDB'97), Athens, Greece, 1997, pp. 506-515.
33. Sproull R.F.: 'Refinements to Nearest Neighbor Searching in k-Dimensional Trees', Algorithmica 1991, pp. 579-589.
34. White D. A., Jain R.: 'Similarity Indexing with the SS-tree', Proc. 12th Int. Conf. on Data Engineering (ICDE), 1996, pp. 516-523.