Efficient query processing in arbitrary subspaces using vector approximations

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2006, Pages 184-187

  Kriegel, Hans Peter ^a   Kröger, Peer ^a   Schubert, Matthias ^a   Zhu, Ziyue ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; POLYNOMIAL APPROXIMATION; STATISTICAL METHODS; STATISTICS; VECTORS;

(2+1) DIMENSIONS; ARBITRARY SUBSPACES; DATABASE MANAGEMENT; INTERNATIONAL CONFERENCES; NOVEL ALGORITHMS; QUERY PERFORMANCES; RANGE QUERIES; VA-FILE; VECTOR APPROXIMATION (VA) FILE;

QUERY PROCESSING;

EID: 45149117036     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2006.23     Document Type: Conference Paper

References (9)

1. R. Agrawal and A. Swami. A one-pass space-efficient algorithm for finding quantiles. IBM Almaden Research Center 650 Harry Road, San Jose, CA 95120, 1995.
2. N. Beckmann, H.-P. Kriegel, B. Seeger, and R. Schneider. "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles". In Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'90), Atlantic City, NJ, 1990.
3. S. Berchtold, C. Böhm, D. A. Keim, H.-P. Kriegel, and X. Xu. "Optimal Multidimensional Query Processing Using Tree Striping". In Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK 2000), Greenwich, U.K., 2000.
4. S. Berchtold, D. A. Keim, and H.-P. Kriegel. "The X-Tree: An Index Structure for High-Dimensional Data". In Proc. 22nd Int. Conf. on Very Large Databases (VLDB'96), Mumbai (Bombay), India, 1996.
5. D. Comer. "The Ubiquitous B-Tree". ACM Computing Surveys, 11(2):121-137, 1979.
6. A. F. Cárdenas. "Analysis and Performance of Inverted Database Structures". Communications of the ACM, 18(5):253-263, 1975.
7. A. Guttman. "R-Trees: A Dynamic Index Structure for Spatial Searching". In Proc. ACM SIGMOD Int. Conf on Management of Data (SIGMOD'84), Boston, MA, 1984.
8. N. Katayama and S. Satoh. "The SR-tree: An Index Structure High Dimensional Nearest Neighbor Queries". In Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'97), Tucson, AZ, 1997.
9. R. Weber, H.-J. Schek, and S. Blott. "Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces". In Proc. 24th Int. Conf. on Very Large Databases (VLDB'98), New York, NY, 1998.