{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T15:28:33Z","timestamp":1794583713195,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"value":"9781461482666","type":"print"},{"value":"9781461482659","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_743","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T06:55:15Z","timestamp":1544079315000},"page":"1581-1583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Search Tree"],"prefix":"10.1007","author":[{"given":"Joseph M.","family":"Hellerstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"743_CR715","unstructured":"Aoki PM. Generalizing \u201csearch\u201d in generalized search trees. In: Proceedings of the 14th International Conference on Data Engineering; 1998."},{"key":"743_CR716","doi-asserted-by":"crossref","unstructured":"Aoki PM. How to avoid building dataBlades that know the value of everything and the cost of nothing. In: Proceedings of the 11th International Conference on Scientific and Statistical Database Management; 1999. p. 122\u201333.","DOI":"10.1109\/SSDM.1999.787627"},{"issue":"2\/3","key":"743_CR717","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1012809914301","volume":"17","author":"WG Aref","year":"2001","unstructured":"Aref WG, Ilyas IF. SP-GiST: an extensible database index for supporting space partitioning trees. J Intell Inf Syst. 2001;17(2\/3):215\u201340.","journal-title":"J Intell Inf Syst"},{"issue":"1","key":"743_CR718","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/505241.505244","volume":"49","author":"JM Hellerstein","year":"2002","unstructured":"Hellerstein JM, Koutsoupias E, Miranker D, Papadimitriou C, Samoladas V. On a model of indexability and its bounds for range queries. J ACM. 2002;49(1):35\u201355.","journal-title":"J ACM"},{"key":"743_CR719","unstructured":"Hellerstein JM, Naughton JF, Pfeffer A. Generalized search trees for database systems. In: Proceedings of the 21st International Conference on Very Large Data Bases; 1995. p. 562\u201373."},{"key":"743_CR720","volume-title":"The RD-tree: an index structure for sets","author":"JM Hellerstein","year":"1994","unstructured":"Hellerstein JM, Pfeffer A. The RD-tree: an index structure for sets. Madison: University of Wisconsin Technical Report #1252; 1994."},{"key":"743_CR721","unstructured":"Kornacker M. High-performance generalized search trees. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999."},{"issue":"2","key":"743_CR722","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/253262.253272","volume":"26","author":"Marcel Kornacker","year":"1997","unstructured":"Kornacker M, Mohan C, Hellerstein JM. Concurrency and recovery in generalized search trees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 62\u201372.","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"743_CR723","first-page":"3","volume":"26","author":"M Kornacker","year":"2003","unstructured":"Kornacker M, Shah MA, Hellerstein JM. Amdb: a design tool for access methods. Data Eng Bull. 2003;26(2):3\u201311.","journal-title":"Data Eng Bull"},{"key":"743_CR724","doi-asserted-by":"crossref","unstructured":"Thomas MC, Hellerstein JM. Boolean bounding predicates for spatial access methods. In: Proceedings of the International Conference on Database and Expert Systems Applications; 2002. p. 925\u201334.","DOI":"10.1007\/3-540-46146-9_91"},{"key":"743_CR725","doi-asserted-by":"crossref","unstructured":"Stonebraker M. Inclusion of new types in relational data base systems. In: Proceedings of the 2nd International Conference 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-1-4614-8265-9_743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:17:23Z","timestamp":1792131443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4614-8265-9_743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_743","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}