{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:42:52Z","timestamp":1725550972593},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441267"},{"type":"electronic","value":"9783540461463"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46146-9_91","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:14:30Z","timestamp":1269897270000},"page":"925-934","source":"Crossref","is-referenced-by-count":3,"title":["Boolean Bounding Predicates for Spatial Access Methods"],"prefix":"10.1007","author":[{"given":"Megan","family":"Thomas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph M.","family":"Hellerstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"N. Beckmann, Kriegel H.-P., R. Schneider, and B. Seeger. The R-tree: An efficient and robust access method for points and rectangles. In Proc. of the ACM-SIGMOD Int\u2019l Conference on Management of Data, pages 322\u2013331, 1990.","DOI":"10.1145\/93605.98741"},{"key":"91_CR2","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications, 2nd Ed. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-662-04245-8"},{"key":"91_CR3","unstructured":"J. M. Hellerstein, J. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995."},{"key":"91_CR4","unstructured":"K. Hildrum and M. Thomas. Jagged bite problem NP-complete construction. Technical Report UCB\/\/CSD-99-1060, University of California at Berkeley, 1999."},{"key":"91_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0022-0000(93)90020-W","volume":"47","author":"T. Johnson","year":"1993","unstructured":"T. Johnson and D. Shasha. B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half. Journal of Computer and System Sciences, 47:45\u201376, August 1993.","journal-title":"Journal of Computer and System Sciences"},{"key":"91_CR6","doi-asserted-by":"crossref","unstructured":"N. Katayama and S. Satoh. The SR-tree: An index structure for high dimensional nearest neighbor queries. In Proc. of the ACM-SIGMOD Int\u2019l Conference on Management of Data, pages 369\u2013380, Tucson, AZ, May 1997.","DOI":"10.1145\/253262.253347"},{"key":"91_CR7","unstructured":"M. Kornacker, M. Shah, and J. M. Hellerstein. An analysis framework for access methods. Technical Report UCB\/\/CSD-99-1051, University of California at Berkeley, 1999."},{"key":"91_CR8","unstructured":"S. T. Leutenegger, M. A. Lopez, and J. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proc. of the 12th Int\u2019l Conference on Data Engineering, pages 497\u2013506, New Orleans, LA, April 1997."},{"issue":"4","key":"91_CR9","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, December 1990.","journal-title":"ACM Transactions on Database Systems"},{"key":"91_CR10","unstructured":"W. Press, S. Teukolsky, W. Vettering, and B. Flannery. Numerical Recipes in C: The Art of Scientific Computing, 2nd Ed. Cambridge University Press, 1992."},{"key":"91_CR11","doi-asserted-by":"crossref","unstructured":"M. Thomas and J. M. Hellerstein. Boolean boundingpre dicates for spatial access methods. Technical Report UCB\/\/CSD-01-1174, University of California at Berkeley, 2002.","DOI":"10.1007\/3-540-46146-9_91"},{"key":"91_CR12","doi-asserted-by":"crossref","unstructured":"C. Zou and B. Salzberg. On-line reorganization of sparsely-populated B+-trees. In Proc. of the ACM-SIGMOD Int\u2019l Conference on Management of Data, Montreal, Canada, June 1996.","DOI":"10.1145\/233269.233325"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46146-9_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T10:13:02Z","timestamp":1685527982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46146-9_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441267","9783540461463"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46146-9_91","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}