Joining massive high-dimensional datasets

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2003, Pages 265-276

  Kahveci, Tamer ^a   Lang, Christian A ^a   Singh, Ambuj K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN MATRIX; HIGH-DIMENSIONAL DATASETS; MINIMUM BOUNDING RECTANGLE; SIMILARITY JOIN;

BOOLEAN FUNCTIONS; DATABASE SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; MAGNETIC DISK STORAGE; MATRIX ALGEBRA; STORAGE ALLOCATION (COMPUTER);

DATA STRUCTURES;

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

References (42)

1. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In FODO, Evanston, Illinois, October 1993.
2. R. Agrawal, K. Lin, H.S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In VLDB, Zürich, Switzerland, September 1995.
3. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Scalable sweeping-based spatial join. In VLDB, New York, 1998.
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, pages 322-331, Atlantic City, NJ, 1990.
5. M.W. Blasgen and K.P. Eswaran. Storage and access in relational data bases. IBM Systems Journal, 16(4):362-377, 1977.
6. C. Böhm, B. Braunmüller, F. Krebs, and H.-P. Kriegel. Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data. In SIGMOD, Santa Barbara, CA, 2001.
7. C. Böhm and H.P. Kriegel. A cost model and index architecture for the similarity join. In ICDE, Heidelberg, Germany, 2001.
8. T. Bozkaya, N. Yazdani, and Z.M. Özsoyoglu. Matching and indexing sequences of different lengths. In CIKM, pages 128-135, 1997.
9. T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger. Multi-step processing of spatial joins. In SIGMOD, pages 197-208, Minneapolis, MN, June 1994.
10. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In SIGMOD, pages 237-246, 1993.
11. C.C. Chan and B.B. Ooi. Efficient scheduling of page access in index-based join processing. TKDE, 9(6):1005-1011, 1997.
12. K.-P. Chan and A.W.-C. Fu. Efficient time series matching by wavelets. In ICDE, Sydney, Australia, March 1999.
13. K.K.W. Chu and M.H. Wong. Fast time-series searching with scaling and shifting. In PODS, Philadelphia, PA, 1999.
14. J.P. Dittrich and B. Seeger. GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces. In KDD, San Francisco, CA, 2001.
15. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102-113, Santa Barbara, CA, May 2001.
16. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, pages 419-429, Minneapolis MN, May 1994.
17. M.R. Garey and D.S. Johnson. Computers and intractability A guide to the theory of NP-Completeness. Freeman, June 1979.
18. G. Graefe. Sort-merge-join: An idea whose time has(h) passed? In ICDE, Houston, Texas, February 1994.
19. C. Gurret and P. Rigaux. The sort/sweep algorithm: A new method for R-tree based spatial joins. In SSDBM, pages 153-165, 2000.
20. E.P. Harris and K. Ramamohanarao. Join algorithm costs revisited. VLDB Journal, 5(1):64-84, 1996.
21. J.G. Henikoff and S. Henikoff. BLOCKS database and its applications. Methods in Enzymology, 266:88-105, 1996.
22. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In SIGMOD, pages 237-248, Seattle, Washington, 1998.
23. Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial joins using R-trees: Breadth-first traversal with global optimizations. In VLDB, Athens, Greece, 1997.
24. T. Kahveci, C. A. Lang, and A. K. Singh. Joining massive high-dimensional datasets. Technical Report 30, UCSB, 2002.
25. T. Kahveci and A. Singh. An efficient index structure for string databases. In VLDB, pages 351-360, Roma, Italy, September 2001.
26. T. Kahveci and A. Singh. Variable length queries for time series data. In ICDE, Heidelberg, Germany, 2001.
27. T. Kahveci, A. K. Singh, and A. Gürel. Similarity searching for multi-attribute sequences. In SSDBM, 2002.
28. N. Koudas and K.C. Sevcik. Size separation spatial join. In SIGMOD, pages 324-335, Tucson, AZ, June 1997.
29. N. Koudas and K. C. Sevcik. High dimensional similarity joins: algorithms and performance evaluation. TKDE, 12(1), January/February 2000.
30. C. A. Lang and A. K. Singh. Accelerating high-dimensional nearest neighbor queries. In SSDBM, pages 109-118, Edinburgh, Scotland, July 2002.
31. M.-L. Lo and C. V. Ravishankar. Spatial joins using seeded trees. In SIGMOD, Minnesota, USA, 1994.
32. M.-L. Lo and C. V. Ravishankar. Spatial hash-joins. In SIGMOD, Montreal, Canada, 1996.
33. H. Lu and K.-L. Tan. On sort-merge algorithm for band joins. TKDE, 7(3):508-510, June 1995.
34. S. Manegold, P.A. Boncz, and M.L. Kersten. What happens during a join? Dissecting CPU and memory optimization effects. In VLDB, pages 339-350, Cairo, Egypt, September 2000.
35. S. Muthukrishnan and S. C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. In STOC, Portland, Or, 2000.
36. J.A. Orenstein. Spatial query processing in an object-oriented database system. In SIGMOD, pages 326-226, Washington, D.C., May 1986.
37. A. Papadopoulos, P. Rigaux, and M. Scholl. A performance evaluation of spatial join processing strategies. In SSD, pages 286-307, 1999.
38. J. M. Patel and D. J. DeWitt. Partition based spatial-merge join. In SIGMOD, pages 259-270, 1996.
39. R. Ramakrishnan and J. Gehrke. Database Management Systems. MC Graw Hill, 2000.
40. B. Seeger. An analysis of schedules for performing multi-page requests. Information Systems, 21(5):387-407, 1996.
41. K. Shim, R. Srikant, and R. Agrawal. High-dimensional similarity joins. TKDE, 14(1):156-171, January/February 2002.
42. J. Xiao, Y. Zhang, and X. Jia. Clustering non-uniform-sized spatial objects to reduce I/O cost for spatial-join processing. The Computer Journal, 44(5):384-397, 2001.