{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:58Z","timestamp":1725493558591},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_10","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"115-127","source":"Crossref","is-referenced-by-count":10,"title":["A Framework for Index Bulk Loading and Dynamization"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Lars","family":"Arge","sequence":"additional","affiliation":[]},{"given":"Octavian","family":"Procopiuc","sequence":"additional","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter. The input\/output complexity of sorting and related problems. Commun. ACM, 31:1116\u20131127, 1988.","journal-title":"Commun. ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets. Kluwer Academic Publishers, 2001. (To appear).","DOI":"10.1007\/978-1-4615-0005-6_9"},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","first-page":"328","volume-title":"Proc. Workshop on Algorithm Engineering","author":"L. Arge","year":"1999","unstructured":"L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. In Proc. Workshop on Algorithm Engineering, LNCS 1619, pages 328\u2013347, 1999."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proc. ACM Symp. Principles of Database Systems, pages 346\u2013357, 1999.","DOI":"10.1145\/303976.304010"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"L. Arge and J. Vahrenhold. I\/O-efficient dynamic planar point location. In Proc. ACM Symp. on Computational Geometry, pages 191\u2013200, 2000.","DOI":"10.1145\/336154.336205"},{"key":"10_CR6","unstructured":"L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proc. IEEE Symp. on Foundations of Comp. Sci., pages 560\u2013569, 1996."},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM, 45(6):891\u2013923, Nov. 1998.","journal-title":"Journal of the ACM"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173\u2013189, 1972.","journal-title":"Acta Informatica"},{"issue":"9","key":"10_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509\u2013517, Sept. 1975.","journal-title":"Commun. ACM"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley. Decomposable searching problems. Inform. Process. Lett., 8:244\u2013251, 1979.","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121\u2013137, 1979.","journal-title":"ACM Computing Surveys"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"M. de Berg, J. Gudmundsson, M. Hammar, and M. Overmars. On R-trees with low stabbing number. In Proc. Annual European Symposium on Algorithms, pages 167\u2013178, 2000.","DOI":"10.1007\/3-540-45253-2_16"},{"key":"10_CR13","unstructured":"C. A. Duncan, M. T. Goodrich, and S. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 300\u2013309, N.Y., Jan. 17-19 1999. ACM-SIAM."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. G\u00fcnther. Multidimensional access methods. ACM Computing Surveys, 30(2):170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"R. Grossi and G. F. Italiano. Efficient cross-trees for external memory. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization. American Mathematical Society, 1999.","DOI":"10.1090\/dimacs\/050\/04"},{"key":"10_CR16","series-title":"Lect Notes Comput Sci","first-page":"260","volume-title":"Proc. Graph-Theoretic Concepts in Computer Science","author":"A. Henrich","year":"1989","unstructured":"A. Henrich, H.-W. Six, and P. Widmayer. Paging binary trees with external balancing. In Proc. Graph-Theoretic Concepts in Computer Science, LNCS 411, pages 260\u2013276, 1989."},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-49257-7_17","volume-title":"Proc. International Conference on Database Theory","author":"K. V. R. Kanth","year":"1999","unstructured":"K. V. R. Kanth and A. K. Singh. Optimal dynamic range searching in non-replicating index structures. In Proc. International Conference on Database Theory, LNCS 1540, pages 257\u2013276, 1999."},{"key":"10_CR18","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1998","unstructured":"D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading MA, second edition, 1998.","edition":"second edition"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"D. Lomet","year":"1990","unstructured":"D. Lomet and B. Salzberg. The hB-tree: A multiattribute indexing method with good guaranteed performance. ACM Transactions on Database Systems, 15(4):625\u2013658, 1990.","journal-title":"ACM Transactions on Database Systems"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K. Sevcik. The grid file: An adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 9(1):38\u201371, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"10_CR21","series-title":"Lecture Notes Comput. Sci.","volume-title":"The Design of Dynamic Data Structures","author":"M. H. Overmars","year":"1983","unstructured":"M. H. Overmars. The Design of Dynamic Data Structures, volume 156 of Lecture Notes Comput. Sci. Springer-Verlag, Heidelberg, West Germany, 1983."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"J. Robinson. The K-D-B tree: A search structure for large multidimensional dynamic indexes. In Proc. SIGMOD Intl. Conf. on Management of Data, pages 10\u201318, 1981.","DOI":"10.1145\/582319.582321"},{"key":"10_CR23","volume-title":"The Design and Analyses of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analyses of Spatial Data Structures. Addison Wesley, MA, 1990."},{"key":"10_CR24","unstructured":"B. Seeger and H.-P. Kriegel. The buddy-tree: An efficient and robust access method for spatial data base systems. In Proc. International Conf. on Very Large Databases, pages 590\u2013601, 1990."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(79)90110-8","volume":"8","author":"Y. V. Silva Filho","year":"1979","unstructured":"Y. V. Silva Filho. Average case analysis of region search in balanced k-d trees. Inform. Process. Lett., 8:219\u2013223, 1979.","journal-title":"Inform. Process. Lett."},{"key":"10_CR26","unstructured":"S. Subramanian and S. Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 378\u2013387, 1995."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"J. S. Vitter. External memory algorithms and data structures. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization, pages 1\u201338. American Mathematical Society, 1999.","DOI":"10.1090\/dimacs\/050\/01"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:38Z","timestamp":1556936918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}