{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:20:15Z","timestamp":1726410015514},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540856535"},{"type":"electronic","value":"9783540856542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85654-2_37","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T07:30:03Z","timestamp":1219822203000},"page":"404-418","source":"Crossref","is-referenced-by-count":0,"title":["Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces"],"prefix":"10.1007","author":[{"given":"Gang","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun-Jeong","family":"Seok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","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":"37_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Kriegel, H.-P.: Improving the query performance of high-dimensional index structures by bulk-load operations. In: Proc. of EDBT, pp. 216\u2013230 (1998)","DOI":"10.1007\/BFb0100987"},{"key":"37_CR3","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":"37_CR4","unstructured":"Bercken, J., Seeger, B.: An evaluation of generic bulk loading techniques. In: Proc. of VLDB, pp. 461\u2013470 (2001)"},{"key":"37_CR5","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":"37_CR6","unstructured":"DeWitt, D., Kabra, N., Luo, J., Patel, J., Yu, J.: Client-server paradise. In: Proc. of VLDB, pp. 558\u2013569 (1994)"},{"key":"37_CR7","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. 2\u20137 (1998)","DOI":"10.1145\/288692.288723"},{"key":"37_CR8","unstructured":"http:\/\/www.ncbi.nlm.nih.gov\/Genbank\/"},{"key":"37_CR9","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":"37_CR10","unstructured":"Jermaine, C., Datta, A., Omiecinski, E.: A novel index supporting high volume data warehouse insertion. In: Proc. of VLDB, pp. 235\u2013246 (1999)"},{"key":"37_CR11","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":"37_CR12","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":"37_CR13","doi-asserted-by":"crossref","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces. In: Proc. of VLDB, pp. 620\u2013631 (2003)","DOI":"10.1016\/B978-012722442-8\/50061-6"},{"key":"37_CR14","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":"37_CR15","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":"37_CR16","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"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-78568-2_14","volume-title":"Database Systems for Advanced Applications","author":"H.-J. Seok","year":"2008","unstructured":"Seok, H.-J., Qian, G., Zhu, Q., Pramanik, S.: Bulk-loading the ND-tree in non-ordered discrete data spaces. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol.\u00a04947, pp. 156\u2013171. Springer, Heidelberg (2008)"},{"key":"37_CR18","volume-title":"Human behavior and the principle of least effort","author":"G.K. Zipf","year":"1949","unstructured":"Zipf, G.K.: Human behavior and the principle of least effort. Addison-Wesley, Reading (1949)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85654-2_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:33:31Z","timestamp":1606185211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85654-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540856535","9783540856542"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85654-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}