Bulk construction of dynamic clustered metric trees

Knowledge and Information Systems

Volumn 22, Issue 2, 2010, Pages 211-244

  Aronovich, Lior ^a   Spiegler, Israel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bulk insertion; Bulk loading; Indexing methods; Metric access methods; Metric spaces; Similarity search

Indexed keywords

CLUSTERING ALGORITHMS; TREES (MATHEMATICS);

BULK INSERTION; BULK LOADING; INDEXING METHODS; METRIC ACCESS METHODS; METRIC SPACES; SIMILARITY SEARCH;

LOADING;

EID: 77950689840     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-009-0195-1     Document Type: Article

References (41)

1. Agarwal PK, Arge L, Procopiuc O, Vitter JS (2001) A framework for index bulk loading and dynamization. In: Proceedings of international colloquium on automata, languages, and programming (ICALP), pp 115-127
2. Arge L (1995) The buffer tree: a new technique for optimal I/O algorithms. WADS 1995, pp 334-345
3. Arge L (2003) The buffer tree: a technique for designing batched external data structures. Algorithmica 37(1):1-24
4. Arge L, Hinrichs K, Vahrenhold J, Vitter JS (2002) Efficient bulk operations on dynamic R-trees. Algorithmica 33(1):104-128
5. Aronovich L, Spiegler I (2007) CM-tree: a dynamic clustered index for similarity search in metric databases. Data Knowl Eng 63(3):919-946
6. Athitsos V, Alon J, Sclaroff S, Kollios G (2004) BoostMap: a method for efficient approximate similarity rankings. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 268-275
7. Bayer R, McCreight EM (1972) Organization and maintenance of large ordered indexes. Acta Inf. 1(3):173-189
8. *-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD international conference on management of data, pp 322-331
9. Berchtold S, Böhm C, Kriegel HP (1998) Improving the query performance of high-dimensional index structures by bulk load operations. In: Schek HJ, Saltor F, Ramos I, Alonso G (eds) Advances in database technology (EDBT'98). Sixth international conference on extending databases technology. Lecture notes in computer science, vol 1377. Springer, Berlin, pp 216-230
10. Bercken J, Seeger B, Widmayer P (1997) A generic approach to bulk loading multidimensional index structures. In: Jarke M, Carey MJ, Dittrich KR, Lochovsky FH, Loucopoulos P, Jeusfeld MA (eds) Proceedings of the 23rd international conference on very large databases (VLDB'97). Morgan Kaufmann, San Mateo, pp 406-415
11. th VLDB Conference, Rome, Italy, pp 461-470
12. Bustos B, Navarro G, Chávez E (2003) Pivot selection techniques for proximity searching in metric spaces. Pattern Recognit Lett 24(14):2357-2366
13. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL (2001) Searching in metric spaces. ACM Comput Surv 33(3):273-321
14. Chen L, Choubey R, Rundensteiner EA (1998) Bulk-insertions into R-trees using the small-tree-large-tree approach. In: Proceedings of ACM international symposium on advances in geographic information systems, pp 161-162
15. Chen L, Choubey R, Rundensteiner EA (2002) Merging R-trees: efficient strategies for local bulk insertion. GeoInformatica 6:7-34
16. Choubey R, Chen L, Rundensteiner EA (1999) GBI: a generalized R-tree bulk-insertion strategy. In: Symposium on large spatial databases, pp 91-108
17. Ciaccia P, Patella M (1998) Bulk loading the M-tree. In: Proceedings of the ninth Australasian database conference (ADC'98), Perth, Australia, pp 15-26
18. Ciaccia P, Patella M, Rabitti F, Zezula P (2002) The M-tree project. MultiMedia DataBase Group, Department of Electronics, Computer Science and Systems, University of Bologna. http://www-db.deis.unibo.it/Mtree/
19. Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd conference on very large databases (VLDB'97), pp 426-435
20. Comer D (1979) The ubiquitous B-tree. ACM Comput Surv 11(2):121-137
21. Faloutsos C, Kamel I (1995) Fastmap: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. ACM SIGMOD 24(2):163-174
22. Gaede V, Günther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170-231
23. Ghanem TM, Shah R, Mokbel MF, Aref WG, Vitter JS (2004) Bulk operations for space-partitioning trees. In: Proceedings of the 20th international conference on data engineering (ICDE 2004), pp 29-41
24. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 47-57
25. Hand D, Mannila H, Smyth P (2001) Principles of data mining. MIT Press, Cambridge
26. Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces. ACM Trans Database Syst 28(4):517-580
27. Hettich S, Bay SD (1999) The UCI knowledge discovery in databases archive. Department of Information and Computer Science, University of California, Irvine, CA. http://kdd.ics.uci.edu
28. Jain AK, Dubes RC (1988) Algorithms for Clustering Data. Prentice-Hall, New Jersey
29. Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264-323
30. Jin R, Goswami A, Agrawal G (2006) Fast and exact out-of-core and distributed k-means clustering. Knowl Inf Syst 10(1):17-40
31. Kailing K, Kriegel HP, Pfeifle M, Schönauer S (2006) Extending metric index structures for efficient range query processing. Knowl Inf Syst 10(2):211-227
32. Kamel I, Faloutsos C (1993) On packing R-trees. In: Proceedings of the second international Conference on Information and Knowledge Management (CIKM), pp 490-499
33. Kamel I, Khalil M, Kouramajian V (1996) Bulk insertion in dynamic R-trees. In: Kraak M, Molenaar M (eds) Proceedings of the fourth international symposium on spatial data handling (SDH'96), pp 3B.31-3B.42
34. Kaufman L, Rousueeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York
35. Koga H, Ishibashi T, Watanabe T (2007) Fast agglomerative hierarchical clustering algorithm using Local-ity-Sensitive Hashing. Knowl Inf Syst 12(1):25-53
36. Lee T, Moon B, Lee S (2006) Bulk insertion for R-trees by seeded clustering. Data Knowl Eng 59(1):86-106
37. Leutenegger ST, López MA, Edgington J (1997) STR: a simple and efficient algorithm for R-tree packing. In: Gray A, Larson PÅ (eds) Proceedings of the 13th international conference on data engineering. IEEE Computer Society Press, Los Alamitos, pp 497-506
38. Papadopoulos A, Manolopoulos Y (2003) Parallel bulk-loading of spatial data. Parallel Comput 29(10):1419-1444
39. Skopal T, Pokorny J, Snasel V (2004) PM-tree: pivoting metric tree for similarity search in multimedia databases. In: Proceedings of the annual international workshop on databases, texts, specifications and objects (DATESO 2004), pp 27-37
40. Traina C Jr, Traina A, Faloutsos C, Seeger B (2002) Fast indexing and visualization of metric data sets using slim-trees. IEEE Trans Knowl Data Eng (TKDE) 14(2):244-260
41. Wang X, Wang JTL, Lin KI, Shasha D, Shapiro BA, Zhang K (2000) An index structure for data mining and clustering. Knowl Inf Syst 2(2):161-184