{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:40:27Z","timestamp":1738327227537,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694762"},{"type":"electronic","value":"9783540694977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69497-7_22","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"331-347","source":"Crossref","is-referenced-by-count":1,"title":["The hB-pi* Tree: An Optimized Comprehensive Access Method for Frequent-Update Multi-dimensional Point Data"],"prefix":"10.1007","author":[{"given":"Panfeng","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Betty","family":"Salzberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"An, N., Kanth, K., Ravada, S.: Improving Performance with Bulk-Inserts in Oracle R-Trees. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 948\u2013951 (2003)","DOI":"10.1016\/B978-012722442-8\/50088-4"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TSE.1979.234200","volume":"5","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Multidimensional Binary Search Trees in Database Applications. IEEE Transactions on Software Engineering\u00a05(4), 333\u2013340 (1979)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.: The X-tree: An Index Structure for High-Dimensional Data. In: VLDB, pp. 28\u201339 (1996)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Evangelidis, G., Lomet, D.B., Salzberg, B.: The hB-Pi-Tree: A Multi-Attribute Index Supporting Concurrency, Recovery and Node Consolidation. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 1\u201325 (1997)","DOI":"10.1007\/s007780050030"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional Access Methods. ACM Comput. Surv.\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Henrich, A.: The LSD h Tree: An Access Structure for Feature Vectors. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 362\u2013369 (1998)","DOI":"10.1109\/ICDE.1998.655799"},{"key":"22_CR9","unstructured":"Henrich, A., Six, H.-W., Widmayer, P.: The LSD tree: Spatial access to multidimensional point and non-point objects. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 45\u201353 (1989)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Lomet, D.B., Salzberg, B.: The hBtree: A robust multiattribute search structure. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 296\u2013304 (1989)","DOI":"10.1109\/ICDE.1989.47229"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Lomet, D.B., Salzberg, B.: Access Method Concurrency with Recovery. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 351\u2013360 (1992)","DOI":"10.1145\/130283.130336"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/978-3-540-45072-6_4","volume-title":"Advances in Spatial and Temporal Databases","author":"O. Procopiuc","year":"2003","unstructured":"Procopiuc, O., Agarwal, P.K., Arge, L., Vitter, J.S.: Bkd-Tree: A Dynamic Scalable kd-Tree. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J.F., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol.\u00a02750, pp. 46\u201365. Springer, Heidelberg (2003)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Xia, T., Zhang, D.: Improving the R*-tree with Outlier Handling Techniques. In: GIS, pp. 125\u2013134 (2005)","DOI":"10.1145\/1097064.1097083"},{"key":"22_CR15","unstructured":"Zhou, P.: Querying Multi-dimensional Data and Spatio-temporal Data with Non-overlapping Access Methods. Northeastern University PhD Thesis (2006)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69497-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:01:31Z","timestamp":1738324891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69497-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694762","9783540694977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69497-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}