{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T06:23:12Z","timestamp":1713507792876},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T00:00:00Z","timestamp":1238025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10115-009-0195-1","type":"journal-article","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T11:12:17Z","timestamp":1237979537000},"page":"211-244","source":"Crossref","is-referenced-by-count":12,"title":["Bulk construction of dynamic clustered metric trees"],"prefix":"10.1007","volume":"22","author":[{"given":"Lior","family":"Aronovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Israel","family":"Spiegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,3,26]]},"reference":[{"key":"195_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013127","DOI":"10.1007\/3-540-48224-5_10"},{"key":"195_CR2","doi-asserted-by":"crossref","unstructured":"Arge L (1995) The buffer tree: a new technique for optimal I\/O algorithms. WADS 1995, pp 334\u2013345","DOI":"10.1007\/3-540-60220-8_74"},{"issue":"1","key":"195_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-003-1021-x","volume":"37","author":"L Arge","year":"2003","unstructured":"Arge L (2003) The buffer tree: a technique for designing batched external data structures. Algorithmica 37(1): 1\u201324","journal-title":"Algorithmica"},{"issue":"1","key":"195_CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s00453-001-0107-6","volume":"33","author":"L Arge","year":"2002","unstructured":"Arge L, Hinrichs K, Vahrenhold J, Vitter JS (2002) Efficient bulk operations on dynamic R-trees. Algorithmica 33(1): 104\u2013128","journal-title":"Algorithmica"},{"issue":"3","key":"195_CR5","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.datak.2007.06.001","volume":"63","author":"L Aronovich","year":"2007","unstructured":"Aronovich L, Spiegler I (2007) CM-tree: a dynamic clustered index for similarity search in metric databases. Data Knowl Eng 63(3): 919\u2013946","journal-title":"Data Knowl Eng"},{"key":"195_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013275","DOI":"10.1109\/CVPR.2004.1315173"},{"issue":"3","key":"195_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer R, McCreight EM (1972) Organization and maintenance of large ordered indexes. Acta Inf. 1(3): 173\u2013189","journal-title":"Acta Inf."},{"key":"195_CR8","doi-asserted-by":"crossref","unstructured":"Beckman N, Kriegel HP, Schneider R, Seeger B (1990) The R *-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD international conference on management of data, pp 322\u2013331","DOI":"10.1145\/93605.98741"},{"key":"195_CR9","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm 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 \u201998). Sixth international conference on extending databases technology. Lecture notes in computer science, vol 1377. Springer, Berlin, pp 216\u2013230","DOI":"10.1007\/BFb0100987"},{"key":"195_CR10","first-page":"406","volume-title":"Proceedings of the 23rd international conference on very large databases (VLDB \u201997)","author":"J Bercken","year":"1997","unstructured":"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 \u201997). Morgan Kaufmann, San Mateo, pp 406\u2013415"},{"key":"195_CR11","unstructured":"Bercken J, Seeger B (2001) An evaluation of generic bulk loading techniques. In: Proceedings of the 27th VLDB Conference, Rome, Italy, pp 461\u2013470"},{"issue":"14","key":"195_CR12","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos B, Navarro G, Ch\u00e1vez E (2003) Pivot selection techniques for proximity searching in metric spaces. Pattern Recognit Lett 24(14): 2357\u20132366","journal-title":"Pattern Recognit Lett"},{"issue":"3","key":"195_CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E, Navarro G, Baeza-Yates R, Marroqu\u00edn JL (2001) Searching in metric spaces. ACM Comput Surv 33(3): 273\u2013321","journal-title":"ACM Comput Surv"},{"key":"195_CR14","doi-asserted-by":"crossref","unstructured":"Chen L, Choubey R, Rundensteiner EA (1998) Bulk-insertions into R-trees using the small-tree\u2013large-tree approach. In: Proceedings of ACM international symposium on advances in geographic information systems, pp 161\u2013162","DOI":"10.1145\/288692.288722"},{"key":"195_CR15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1013764014000","volume":"6","author":"L Chen","year":"2002","unstructured":"Chen L, Choubey R, Rundensteiner EA (2002) Merging R-trees: efficient strategies for local bulk insertion. GeoInformatica 6: 7\u201334","journal-title":"GeoInformatica"},{"key":"195_CR16","doi-asserted-by":"crossref","unstructured":"Choubey R, Chen L, Rundensteiner EA (1999) GBI: a generalized R-tree bulk-insertion strategy. In: Symposium on large spatial databases, pp 91\u2013108","DOI":"10.1007\/3-540-48482-5_8"},{"key":"195_CR17","unstructured":"Ciaccia P, Patella M (1998) Bulk loading the M-tree. In: Proceedings of the ninth Australasian database conference (ADC\u201998), Perth, Australia, pp 15\u201326"},{"key":"195_CR18","unstructured":"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\/"},{"key":"195_CR19","unstructured":"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\u201997), pp 426\u2013435"},{"issue":"2","key":"195_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer D (1979) The ubiquitous B-tree. ACM Comput Surv 11(2): 121\u2013137","journal-title":"ACM Comput Surv"},{"issue":"2","key":"195_CR21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/568271.223812","volume":"24","author":"C Faloutsos","year":"1995","unstructured":"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\u2013174","journal-title":"ACM SIGMOD"},{"issue":"2","key":"195_CR22","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv 30(2): 170\u2013231","journal-title":"ACM Comput Surv"},{"key":"195_CR23","doi-asserted-by":"crossref","unstructured":"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\u201341","DOI":"10.1109\/ICDE.2004.1319982"},{"key":"195_CR24","doi-asserted-by":"crossref","unstructured":"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\u201357","DOI":"10.1145\/602259.602266"},{"key":"195_CR25","volume-title":"Principles of data mining","author":"D Hand","year":"2001","unstructured":"Hand D, Mannila H, Smyth P (2001) Principles of data mining. MIT Press, Cambridge"},{"issue":"4","key":"195_CR26","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces. ACM Trans Database Syst 28(4): 517\u2013580","journal-title":"ACM Trans Database Syst"},{"key":"195_CR27","unstructured":"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"},{"key":"195_CR28","volume-title":"Algorithms for Clustering Data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for Clustering Data. Prentice-Hall, New Jersey"},{"issue":"3","key":"195_CR29","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3): 264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"1","key":"195_CR30","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10115-005-0210-0","volume":"10","author":"R Jin","year":"2006","unstructured":"Jin R, Goswami A, Agrawal G (2006) Fast and exact out-of-core and distributed k-means clustering. Knowl Inf Syst 10(1): 17\u201340","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"195_CR31","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10115-006-0018-6","volume":"10","author":"K Kailing","year":"2006","unstructured":"Kailing K, Kriegel HP, Pfeifle M, Sch\u00f6nauer S (2006) Extending metric index structures for efficient range query processing. Knowl Inf Syst 10(2): 211\u2013227","journal-title":"Knowl Inf Syst"},{"key":"195_CR32","doi-asserted-by":"crossref","unstructured":"Kamel I, Faloutsos C (1993) On packing R-trees. In: Proceedings of the second international Conference on Information and Knowledge Management (CIKM), pp 490\u2013499","DOI":"10.1145\/170088.170403"},{"key":"195_CR33","unstructured":"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\u201996), pp 3B.31\u20133B.42"},{"key":"195_CR34","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousueeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"issue":"1","key":"195_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga H, Ishibashi T, Watanabe T (2007) Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing. Knowl Inf Syst 12(1): 25\u201353","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"195_CR36","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.datak.2005.07.011","volume":"59","author":"T Lee","year":"2006","unstructured":"Lee T, Moon B, Lee S (2006) Bulk insertion for R-trees by seeded clustering. Data Knowl Eng 59(1): 86\u2013106","journal-title":"Data Knowl Eng"},{"key":"195_CR37","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/ICDE.1997.582015","volume-title":"Proceedings of the 13th international conference on data engineering","author":"ST Leutenegger","year":"1997","unstructured":"Leutenegger ST, L\u00f3pez MA, Edgington J (1997) STR: a simple and efficient algorithm for R-tree packing. In: Gray A, Larson P\u00c5(eds) Proceedings of the 13th international conference on data engineering. IEEE Computer Society Press, Los Alamitos, pp 497\u2013506"},{"issue":"10","key":"195_CR38","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/j.parco.2003.05.003","volume":"29","author":"A Papadopoulos","year":"2003","unstructured":"Papadopoulos A, Manolopoulos Y (2003) Parallel bulk-loading of spatial data. Parallel Comput 29(10): 1419\u20131444","journal-title":"Parallel Comput"},{"key":"195_CR39","unstructured":"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\u201337"},{"issue":"2","key":"195_CR40","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C Jr Traina","year":"2002","unstructured":"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\u2013260","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"2","key":"195_CR41","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s101150050009","volume":"2","author":"X Wang","year":"2000","unstructured":"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\u2013184","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0195-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0195-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0195-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:19Z","timestamp":1559110219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0195-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,26]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0195-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,26]]}}}