Nearest neighbor search on vertically partitioned high-dimensional data

Lecture Notes in Computer Science

Volumn 3589, Issue , 2005, Pages 243-253

  Dellis, Evangelos ^a   Seeger, Bernhard ^a   Vlachou, Akrivi ^a  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INDEXING (OF INFORMATION); QUERY LANGUAGES;

DATA SPACES; HIGH-DIMENSIONAL DATA; MULTIDIMENSIONAL DATA; NEAREST NEIGHBOR QUERIES;

DATA REDUCTION;

EID: 26844457122     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546849_24     Document Type: Conference Paper

References (28)

1. Belussi A., Faloutsos C. Self-Spatial Join Selectivity Estimation Using Fractal Concepts. ACM Transactions on Information Systems (TOIS), Volume 16, Number 2, pp 161-201, 1998
2. Berchtold S., Böhm C., Keim D., Kriegel H-P., Xu X. Optimal multidimensional query processing using tree striping. Int. Conf. on Data Warehousing and Knowledge Discovery, 2000, pp 244-257.
3. Bingham E., Mannila H. Random projection in dimensionality reduction: applications to image and text data. Int. Conf. on Knowledge discovery and data mining, ACM SIGKDD, 2001, pp 245-250.
4. Böhm C. A cost model for query processing in high dimensional data spaces. ACM Transactions on Database Systems (TODS), Volume 25, Number 2, pp 129-178, 2000
5. Böhm C., Berchtold S., Keim D. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, Vol. 33, pp 322-373, 2001
6. Böhm K., Mlivoncic M., Schek H.-J., Weber R. Fast Evaluation Techniques for Complex Similarity Queries. Int. Conf. on Very Large Databases (VLDB), 2001, pp 211-220.
7. Chakrabarti K. and Mehrotra S. Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces. Int. Conf. on Very Large Databases (VLDB), 2000, pp 89-100
8. Chaudhuri S., Gravano L. Evaluating Top-k Selection Queries. Int. Conf. on Very Large Databases (VLDB), 1999, pp 397-410.
9. Ciaccia P., Patella M., Zezula P. Processing complex similarity queries with distance-based access methods. Int. Conf. Extending Database Technology (EDBT), 1998, pp 9-23.
10. Fagin R., Kumar R., Sivakumar D. Efficient similarity search and classification via rank aggregation. ACM Symp. on Principles of Database Systems, 2003, pp 301-312.
11. Fagin R., Lotem A., Naor M. Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, Volume 66, Number 4, pages 614-656, 2003
12. Gaede V., and Gunther O. Multidimensional Access Methods. ACM Computing Surveys, Volume 30, pp 170-231, 1998
13. Güntzer U., Balker W-T., Kiessling W. Optimizing multi-feature queries in image databases. Int. Conf. on Very Large Databases (VLDB), 2000, pp 419-428.
14. Henrich A. A Distance Scan Algorithm for Spatial Access Structures. ACM-GIS, pp 136-143, 1994
15. Hinneburg A., Aggarwal C., Keim D. What Is the Nearest Neighbor in High Dimensional Spaces? Int. Conf. on Very Large Databases (VLDB), 2000, pp 506-515.
16. Hjaltason G. R., Samet H. Ranking in Spatial Databases. Advances in Spatial Databases, Int. Symp. on Large Spatial Databases, (SSD), LNCS 951,1995, pp 83-95.
17. Korn F., Pagel B-U., Faloutsos C. On the "Dimensionality Curse" and the "Self-Similarity Blessing". IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No. 1, 2001.
18. Korn F., Sidiropoulos N., Faloutsos C., Siegel E., Protopapas Z. Fast nearest neighbor search in medical image databases. Int. Conf. on Very Large Databases (VLDB), 1996, pp 215-226.
19. Pagel B-U., Korn F., Faloutsos C. Deflating the Dimensionality Curse Using Multiple Fractal Dimensions. Int. Conf. on Data Engineering (ICDE), 2000, pp 589-598.
20. Roussopoulos N., Kelley S., Vincent F. Nearest neighbor queries. ACM SIGMOD, 1995, pp 71-79.
21. Seidl T., Kriegel H-P. Optimal Multi-Step k-Nearest Neighbor Search. ACM SIGMOD, 1998, pp 154-165.
22. Tao Y., Faloutsos C., Papadias D. The power-method: a comprehensive estimation technique for multi-dimensional queries. ACM CIKM, Information and Knowledge Management, 2003, pp 83-90.
23. Tao Y., Zhang J., Papadias D., Mamoulis N. An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. IEEE TKDE, Vol. 16, No. 10, 2004.
24. Theodoridis Y., Sellis T. A Model for the Prediction of R-tree Performance. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1996, pp 161-171.
25. Traina C. Jr., Traina A. J. M., Wu L., Faloutsos C. Fast Feature Selection Using Fractal Dimension. SBBD 2000, p.p. 158-171.
26. Weber R., Schek H-J., Blott S. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. Int. Conf. Very Large Databases (VLDB), 1998, pp 194-205.
27. Yu C., Bressan S., Ooi B. C., and Tan K-L. Quering high-dimensional data in single-dimensional space. The VLDB Journal, Vol. 13, pp 105-119, 2004.
28. Yu C., Ooi B. C., Tan K-L., and Jagadish H. V. Indexing the distance: an efficient method to KNN processing. Int. Conf. Very Large Databases (VLDB), 2001, pp 421-430.