Fast similarity join for multi-dimensional data

Information Systems

Volumn 32, Issue 1, 2007, Pages 160-177

  Kalashnikov, Dmitri V ^a   Prabhakar, Sunil ^b  

^a Irvine   (United States)

^b Purdue University   (United States)

Author keywords

Grid based joins; Similarity join

Indexed keywords

FAST SIMILARITY JOINS; GRID BASED JOINS; SIMILARITY JOINS;

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; STORAGE ALLOCATION (COMPUTER);

DATABASE SYSTEMS;

EID: 33749542311     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2005.07.002     Document Type: Article

References (27)

1. Kalashnikov D.V., and Prabhakar S. Similarity join for low- and high-dimensional data. Proceedings of the Eighth International Conference on Database Systems for Advanced Applications (DASFAA 2003), IEEE Computer Society Press. Kyoto, Japan (2003)
2. Patel J.M., and DeWitt D.J. Partition based spatial-merge join. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. Montreal, Que., Canada, June 4-6, 1996 (1996), ACM Press, New York 259-270
3. Lo M.-L., and Ravishankar C.V. Spatial hash-joins. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. Montreal, Quebec, Canada, June 4-6, 1996 (1996), ACM Press, New York 247-258
4. Guha S., Rastogi R., and Shim K. CURE: an efficient clustering algorithm for large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data (1998)
5. Knorr E.M., and Ng R.T. Algorithms for mining distance-based outliers in large datasets. Proceedings of the International Conference on Very Large Data Bases (1998)
6. Koperski K., and Han J. Discovery of spatial association rules in geographic information databases. International Symposium on Large Spatial Databases (1995)
7. Böhm C., Braunmüller B., Krebs F., and Kriegel H.-P. Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data. Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data (2001), ACM Press, New York 379-388
8. Böhm C., Braunmüller B., Breunig M., and Kriegel H.-P. Fast clustering based on high-dimensional similarity joins. International Conference on Information and Knowledge Management (2000)
9. Brinkhoff T., Kriegel H.-P., and Seeger B. Efficient processing of spatial joins using R-trees. Proceedings of the ACM SIGMOD International Conference on Management of Data (1993)
10. Kalashnikov D.V., Prabhakar S., Hambrusch S., and Aref W. Efficient evaluation of continuous range queries on moving objects. Proceedings of the 13th International Conference on Database and Expert Systems Applications (DEXA 2002). Aix en Provence, France (2002)
11. Kim K., Cha S., and Kwon K. Optimizing mutidimensional index trees for main memory access. Proceedings of ACM SIGMOD Conference. Santa Barbara, CA (2001)
12. Prabhakar S., Xia Y., Kalashnikov D., Aref W., and Hambrusch S. Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects. IEEE Trans. Comput. 51 10 (2002) 1124-1140
13. Kalashnikov D.V., Prabhakar S., and Hambrusch S. Main memory evaluation of monitoring queries over moving objects, Distributed Parallel Databases. Int. J. (DAPD) 15 2 (2004) 117-135
14. Shim K., Srikant R., and Agrawal R. High-dimensional similarity joins. Proceedings of the 13th International Conference on Data Engineering. April 7-11, 1997, Birmingham, UK, IEEE Computer Society (1997), Silver Spring, MD 301-311
15. Huang Y.-W., Jing N., and Rundensteiner E.A. Spatial joins using r-trees: breadth-first traversal with global optimizations. In: Jarke M., Carey M.J., Dittrich K.R., Lochovsky F.H., Loucopoulos P., and Jeusfeld M.A. (Eds). VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece (1997), Morgan Kaufmann, Los Altos, CA 396-405
16. Böhm C., and Kriegel H.-P. A cost model and index architecture for the similarity join. Proceedings of the International Conference on Data Engineering (2001)
17. Shafer J.C., and Agrawal R. Parallel algorithms for high-dimensional similarity joins for data mining applications. VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece (1997), Morgan Kaufmann, Los Altos, CA 176-185
18. Koudas N., and Sevcik K.C. High-dimensional similarity joins: algorithms and performance evaluation. Proceedings of the 14th International Conference on Data Engineering, IEEE Computer Society (1998), Silver Spring, MD 466-475
19. J. Tayeb, Ö. Ulusoy, O. Wolfson, A quadtree-based dynamic attribute indexing method, Comput. J. 41(3).
20. +-trees cache conscious in main memory. Proceedings of ACM SIGMOD Conference. Dallas, TX (2000)
21. Niblack W., Barber R., Equitz W., Flickner M., Glasman E., Petkovic D., and Yanker P. The QBIC project: querying images by content using color, texture and shape. Proceedings of the SPIE Conference on 1908 on Storage and Retrieval for Image and Video Databases vol. 1908 (1993) 173-187
22. Korn F., Sidiropoulos N., Faloutsos C., Siegel E., and Protopapas Z. Fast nearest neighbor search in medical image databases. Proceedings of the International Conference on Very Large Data Bases. Mumbai, India (1996) 215-226
23. Mehrotra S., Rui Y., Ortega M., and Huang T.S. Supporting content-based queries over images in mars. Proceedings of the Fourth IEEE International Conference on Multimedia Computing and Systems. Ottawa, Ont., Canada (1997) 632-633
24. S. Mehrotra, et al., MARS project, UC Irvine, .
25. Gionis A., Indyk P., and Motwani R. Similarity search in high dimensions via hashing. Proceedings of the International Conference on Very Large Data Bases (VLDB) (1999)
26. Kriegel H.-P., Brecheisen S., Kroger P., Pfeifle M., and Schubert M. Using sets of feature vectors for similarity search on voxelized cad objects. Proceedings of ACM SIGMOD International Conference on Management of Data (2003) 587-598
27. Agrawal R., Faloutsos C., and Swami A. Efficient similarity search in sequence databases. Proceedings of the Fourth International Conference on Foundations of Data Organization and Algorithms (FODO) (1993)