{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:04:33Z","timestamp":1794366273949,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":11,"publisher":"Springer US","isbn-type":[{"value":"9780387355443","type":"print"},{"value":"9780387399409","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_743","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T04:28:32Z","timestamp":1253075312000},"page":"1222-1224","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Search Tree"],"prefix":"10.1007","author":[{"given":"Joseph M.","family":"Hellerstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"743_CR1_743","unstructured":"Aoki P.M. Generalizing \u2018search\u2019 in generalized search trees. In Proc. 14th Int. Conf. on Data Engineering, 1998."},{"key":"743_CR2_743","doi-asserted-by":"crossref","unstructured":"Aoki P.M. How to avoid building dataBlades that know the value of everything and the cost of nothing. In Proc. 11th Int. Conf. on Scientific and Statistical Database Management, 1999, pp. 122\u2013133.","DOI":"10.1109\/SSDM.1999.787627"},{"issue":"2\/3","key":"743_CR3_743","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1012809914301","volume":"17","author":"W.G. Aref","year":"2001","unstructured":"Aref W.G., Ilyas I.F. SP-GiST: an extensible database index for supporting space partitioning trees. J. Intell. Inf. Syst., 17(2\/3):215\u2013240, 2001.","journal-title":"J. Intell. Inf. Syst."},{"issue":"1","key":"743_CR4_743","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/505241.505244","volume":"49","author":"J.M. Hellerstein","year":"2002","unstructured":"Hellerstein J.M., Koutsoupias E., Miranker D., Papadimitriou C., and Samoladas V. On a model of indexability and its bounds for range queries. J. ACM, 49(1):35\u201355, 2002.","journal-title":"J. ACM"},{"key":"743_CR5_743","unstructured":"Hellerstein J.M., Naughton J.F., and Pfeffer A. Generalized search trees for database systems. In Proc. 21st Int. Conf. on Very Large Data Bases, 1995, pp. 562\u2013573."},{"key":"743_CR6_743","unstructured":"Hellerstein J.M. and Pfeffer A. The RD-Tree: An Index Structure for Sets. University of Wisconsin Technical Report #1252, October 1994."},{"key":"743_CR7_743","unstructured":"Kornacker M. High-performance generalized search trees. In Proc. 25th Int. Conf. on Very Large Data Bases, 1999."},{"key":"743_CR8_743","doi-asserted-by":"crossref","unstructured":"Kornacker M., Mohan C., and Hellerstein J.M. Concurrency and recovery in generalized search trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, pp. 62\u201372.","DOI":"10.1145\/253260.253272"},{"issue":"2","key":"743_CR9_743","first-page":"3","volume":"26","author":"M. Kornacker","year":"2003","unstructured":"Kornacker M., Shah M.A., and Hellerstein J.M. Amdb: a design tool for access methods. Data Eng. Bull., 26(2):3\u201311, 2003.June","journal-title":"Data Eng. Bull."},{"key":"743_CR10_743","doi-asserted-by":"crossref","unstructured":"Thomas M.C. and Hellerstein J.M. Boolean bounding predicates for spatial access methods. In Proc. Int. Conf. on Database and Expert Systems Applications, 2002, pp. 925\u2013934.","DOI":"10.1007\/3-540-46146-9_91"},{"key":"743_CR11_743","doi-asserted-by":"crossref","unstructured":"Stonebraker M. Inclusion of new types in relational data base systems. In Proc. 2nd Int. Conf. on Data Engineering, 1986.","DOI":"10.1109\/ICDE.1986.7266230"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T18:30:59Z","timestamp":1792002659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_743","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009]]}}}