{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:12:42Z","timestamp":1725505962928},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_14","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"156-171","source":"Crossref","is-referenced-by-count":3,"title":["Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces"],"prefix":"10.1007","author":[{"given":"Hyun-Jeong","family":"Seok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander R.","family":"Oswald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-48518-X_20","volume-title":"Algorithm Engineering and Experimentation","author":"L. Arge","year":"1999","unstructured":"Arge, L., Hinrichs, K., Vahrenhold, J., Viter, J.S.: Efficient Bulk Operations on Dynamic R-trees. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, pp. 328\u2013348. Springer, Heidelberg (1999)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Arge, L., Berg, M., Haverkort, H., Yi, K.: The Priority R-tree: a practically efficient and worst-case optimal R-tree. In: Proc. of SIGMOD, pp. 347\u2013358 (2004)","DOI":"10.1145\/1007568.1007608"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Beckman, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. of SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"14_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: an index structure for high-dimensional data. In: Proc. of VLDB 1996, pp. 28\u201339 (1996)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0100987","volume-title":"Advances in Database Technology - EDBT \u201998","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., Bohm, C., Kriegel, H.-P.: Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol.\u00a01377, pp. 216\u2013230. Springer, Heidelberg (1998)"},{"key":"14_CR6","unstructured":"Bercken, J., Seeger, B., Widmayer, P.: A Generic Approach to Bulk Loading Multidimensional Index Structures. In: Proc. of VLDB, pp. 406\u2013415 (1997)"},{"key":"14_CR7","unstructured":"Bercken, J., Seeger, B.,, B.: An Evaluation of Generic Bulk Loading Techniques. In: Proc. of VLDB, pp. 461\u2013470 (2001)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M.: Bulk loading the M-tree. In: Proc. of the 9th Australian Database Conference, pp. 15\u201326 (1998)","DOI":"10.1007\/BFb0100974"},{"key":"14_CR9","unstructured":"De Witt, D., Kabra, N., Luo, J., Patel, J., Yu, J.: Client-Server Paradise. In: Proc. of VLDB, pp. 558\u2013569 (1994)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Garcia, Y., Lopez, M., Leutenegger, S.: A greedy algorithm for bulk loading R-trees. In: Proc. of ACM-GIS, pp. 02\u201307 (1998)","DOI":"10.1145\/288692.288723"},{"key":"14_CR11","unstructured":"http:\/\/www.ncbi.nlm.nih.gov\/Genbank\/"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. of SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"14_CR13","unstructured":"Jermaine, C., Datta, A., Omiecinski, E.: A novel index supporting high volumne data warehouse insertion. In: Proc. of VLDB, pp. 235\u2013246 (1999)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: On packing R-trees. In: Proc. of CIKM, pp. 490\u2013499 (1993)","DOI":"10.1145\/170088.170403"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Leutenegger, S., Edgington, J., Lopez, M.: STR: A Simple and Efficient Algorithm for R-Tree Packing. In: Proc. of ICDE, pp. 497\u2013506 (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","first-page":"620","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"G. Qian","year":"2004","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: The ND-Tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol.\u00a02944, pp. 620\u2013631. Springer, Heidelberg (2004)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1125857.1125860","volume":"23","author":"G. Qian","year":"2006","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: A Space-Partitioning-Based Indexing Method for Multidimensional Non-ordered Discrete Data Spaces. ACM TOIS\u00a023, 79\u2013110 (2006)","journal-title":"ACM TOIS"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/1138394.1138395","volume":"31","author":"G. Qian","year":"2006","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: Dynamic Indexing for Multidimensional Non-ordered Discrete Data Spaces Using a Data-Partitioning Approach. ACM TODS\u00a031, 439\u2013484 (2006)","journal-title":"ACM TODS"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proc. of SIGMOD, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed R-trees. In: Proc. of SIGMOD, pp. 17\u201331 (1985)","DOI":"10.1145\/318898.318900"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:13:13Z","timestamp":1619521993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_14","relation":{},"subject":[]}}