Transforming range queries to equivalent box queries to optimize page access

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 409-416

  Pramanik, Sakti ^a   Watve, Alok ^a   Meiners, Chad R ^a   Liu, Alex ^a  

^a Michigan State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS;

FEATURE VECTORS; MULTIMEDIA DATABASE; QUERY RESULTS; REAL DATABASE; SPACE TRANSFORMATIONS; SYNTHETIC DATABASE; TRANSFORMATION SCHEME; TWO-DIMENSION;

METADATA;

EID: 84859261753     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920895     Document Type: Article

References (20)

1. C. C. Aggarwal. On the effects of dimensionality reduction on high dimensional similarity search. In PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 256-266, New York, NY, USA, 2001. ACM.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. Proceedings of ACM SIGMOD, pages 322-331, 1990.
3. S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: an index structure for high-dimensional data. Proceedings of the 22nd International Conference on VLDB, pages 28-39, 1996.
4. K. Chakrabarti, E. Keogh, S. Mehrotra, and M. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. ACM Trans. Database Syst., 27(2):188-228, 2002.
5. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases, pages 426-435, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc.
6. A. Guttman. R-trees: a dynamic index structure for spatial searching. Proceedings of ACM SIGMOD, pages 47-57, 1984.
7. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces (survey article). ACM Trans. Database Syst., 28(4):517-580, 2003.
8. I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4):1-58, 2008.
9. N. Katayama and S. Satoh. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 369-380, New York, NY, USA, 1997. ACM.
10. A. Kumar. G-tree: A new data structure for organizing multidimensional data. IEEE Trans. on Knowl. and Data Eng., 6(2):341-347, 1994.
11. S. Lang. Linear Algebra. New York: Springer-Verlag, 1987.
12. K. V. Ravi Kanth, D. Agrawal, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. SIGMOD Rec., 27(2):166-176, 1998.
13. J. Robinson. The K-D-B-tree: a search structure for large multidimensional dynamic indexes. Proceedings of ACM SIGMOD, pages 10 -18, 1981.
14. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett., 40(4):175-179, 1991.
15. http://download.oracle.com/docs/html/B10829/ _01/toc.htm. Oracle intermedia reference - 10g release 1(10.1).
16. http: //www.cse.msu.edu/~watvealo/mysoftware.html. Web url for source code.
17. V. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, 1995.
18. K. Vu, K. A. Hua, H. Cheng, and S.-D. Lang. A non-linear dimensionality-reduction technique for fast similarity search in large databases. In SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 527-538, New York, NY, USA, 2006. ACM.
19. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the 24rd International Conference on Very Large Data Bases, pages 194-205, San Francisco, CA, USA, 1998. Morgan Kaufmann Publishers Inc.
20. D. A. White and R. Jain. Similarity indexing with the ss-tree. In Proceedings of the 12th International Conference on Data Engineering, pages 516-523, Washington, DC, USA, 1996. IEEE Computer Society.