Making the Pyramid technique robust to query types and workloads

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 313-324

  Zhang, Rui ^a   Ooi, Beng Chin ^a   Tan, Kian Lee ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CLUSTERING; DATA POINTS; WINDOW QUERIES; WORKLOADS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER AIDED DESIGN; DATA STRUCTURES; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; INDEXING (OF INFORMATION); TREES (MATHEMATICS); VECTORS;

QUERY LANGUAGES;

EID: 2442567706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1320007     Document Type: Conference Paper

References (21)

1. http://kdd.ics.uci.edu/databases/covertype/covertype.html.
2. http://kdd.ics.uci.edu/databases/CorelFeatures/CorelFeatures.data.html.
3. M. Arya, W. Cody, C. Faloutsos, J. Richardson, and A. Toga. Qbism: Extending a dbms to support 3d medical images. In ICDE, 1994.
4. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. In SIGMOD, 1990.
5. J. L. Bentley. Multidimensional binary search trees used for associative searching. CACM, 18(9):509-517, 1975.
6. S. Berchtold, C. Bohm, H. V. Jagadish, and J. S. Hans-Peter Kriegel. Independent quantization: An index compression technique for high-dimensional data spaces. In ICDE, 2000.
7. S. Berchtold, C. Bohm, and H.-P. Kriegel. The pyramid-technique: Towards breaking the curse of dimensionality. In SIGMOD, 1998.
8. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, 1997.
9. A. P. de Vries, N. Mamoulis, N. Nes, and M. Kersten. Efficient knn search on vertically decomposed data. In SIGMOD, 2002.
10. C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, and R. Barber. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 1994.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, 1984.
12. H. V. Jagadish. A retrieval technique for similar shapes. In SIGMOD, 1991.
13. I. Kamel and C. Faloutsos. Hilbert r-tree: An improved r-tree using fractals. In VLDB, 1994.
14. N. Katayama and S. Satoh. The sr-tree: an index structure for high-dimensional nearest neighbor queries. In SIGMOD, 1997.
15. B. C. Ooi, K. L. Tan, C. Yu, and S. Bressan. Indexing the edges - a simple and yet efficient approach to high dimensional indexing. In PODS, 2000.
16. H.-P. K. S. Berchtold, D. Keim. The x-tree: An index structure for high-dimensional data. In VLDB, 1996.
17. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The a-tree: an index structure for high-dimensional spaces using relative approximation. In VLDB, 2000.
18. Savaresi, S.M., Boley, D.L., Bittanti, S., and Gazzaniga. Cluster selection in divisive clustering algorithms. In Proc. SIAM Int. Conf. on Data Mining, 2002.
19. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, 1998.
20. D. A. White and R. Jain. Similarity indexing with the ss-tree. In ICDE, 1996.
21. C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In VLDB, 2001.