{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T14:00:59Z","timestamp":1764079259444},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319178844"},{"type":"electronic","value":"9783319178851"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-17885-1_1151","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T16:12:40Z","timestamp":1494519160000},"page":"1805-1817","source":"Crossref","is-referenced-by-count":14,"title":["R-Trees: A Dynamic Index Structure for Spatial Searching"],"prefix":"10.1007","author":[{"given":"Marios","family":"Hadjieleftheriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"1148_CR19215","doi-asserted-by":"crossref","unstructured":"Ang C-H, Tan TC (1997) New linear node splitting algorithm for r-trees. In: Proceedings of symposium on advances in spatial databases (SSD), Berlin, 15\u201318 July 1997, pp\u00a0339\u2013349","DOI":"10.1007\/3-540-63238-7_38"},{"key":"1148_CR19216","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM management of data (SIGMOD), Atlantic\u00a0City, 23\u201325 May 1990, pp\u00a0220\u2013231","DOI":"10.1145\/93597.98741"},{"key":"1148_CR19217","doi-asserted-by":"crossref","unstructured":"Brakatsoulas S, Pfoser D, Theodoridis Y (2002) Revisiting r-tree construction principles. In: Proceedings of the East European conference on advances in databases and information systems, Bratislava, 8\u201311 Sept 2002, pp\u00a0149\u2013162","DOI":"10.1007\/3-540-45710-0_13"},{"issue":"1","key":"1148_CR19218","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"JR Driscoll","year":"1989","unstructured":"Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1989) Making data structures persistent. J Comput Syst Sci 38(1):86\u2013124","journal-title":"J Comput Syst Sci"},{"key":"1148_CR19219","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Kamel I (1994) Beyond uniformity and independence: analysis of r-trees using the concept of fractal dimension. In: Proceedings of ACM symposium on principles of database systems (PODS), Minneapolis, 24\u201326 May 1994, pp\u00a04\u201313","DOI":"10.1145\/182591.182593"},{"issue":"3","key":"1148_CR19220","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/38714.38758","volume":"16","author":"C Faloutsos","year":"1987","unstructured":"Faloutsos C, Sellis T, Roussopoulos N (1987) Analysis of object oriented spatial access methods. SIGMOD Rec 16(3):426\u2013439","journal-title":"SIGMOD Rec"},{"key":"1148_CR19221","unstructured":"Garcia YJ, Lopez MA, Leutenegger ST (1998) On optimal node splitting for r-trees. In: Proceedings of very large data bases (VLDB), New York, 24\u201327 Aug 1998, pp\u00a0334\u2013344"},{"key":"1148_CR19222","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM management of data (SIGMOD), Boston, 18\u201321 June 1984, pp\u00a047\u201357","DOI":"10.1145\/602259.602266"},{"key":"1148_CR19223","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou M, Hoel E, Tsotras VJ (2004) Sail: a library for efficient application integration of spatial indices. In: Proceedings of scientific and statistical database management (SSDBM), Santorini Island, 21\u201323 2004, pp\u00a0135\u2013138","DOI":"10.1109\/SSDM.2004.1311205"},{"key":"1148_CR19224","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou M, Kollios G, Tsotras VJ, Gunopulos D (2002) Efficient indexing of spatiotemporal objects. In: Proceedings of extending database technology (EDBT), Prague, 24\u201328 Mar 2002, pp\u00a0251\u2013268","DOI":"10.1007\/3-540-45876-X_17"},{"issue":"3","key":"1148_CR19225","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0164-1212(00)00078-9","volume":"55","author":"PW Huang","year":"2001","unstructured":"Huang PW, Lin PL, Lin HY (2001) Optimizing storage utilization in r-tree dynamic index structure for spatial databases. J Syst Softw 55(3):291\u2013299","journal-title":"J Syst Softw"},{"key":"1148_CR19226","doi-asserted-by":"crossref","unstructured":"Kamel I, Faloutsos C (1993) On packing r-trees. In: Proceedings of conference on information and knowledge management (CIKM), Washington, DC, 1\u20135 Nov 1993, pp\u00a0490\u2013499","DOI":"10.1145\/170088.170403"},{"key":"1148_CR19227","unstructured":"Kamel I, Faloutsos C (1994) Hilbert r-tree: an improved r-tree using fractals. In: Proceedings of very large data bases (VLDB), Santiago de Chile, 12\u201315 Sept 1994, pp\u00a0500\u2013509"},{"issue":"5","key":"1148_CR19228","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1109\/69.956099","volume":"13","author":"G Kollios","year":"2001","unstructured":"Kollios G, Tsotras VJ, Gunopulos D, Delis A, Hadjieleftheriou M (2001) Indexing animated objects using spatiotemporal access methods. IEEE Trans Knowl Data Eng (TKDE) 13(5):758\u2013777","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"1148_CR19229","doi-asserted-by":"crossref","unstructured":"Kolovson C, Stonebraker M (1991) Segment indexes: dynamic indexing techniques for multi-dimensional interval data. In: Proceedings of ACM management of data (SIGMOD), Denver, 29\u201331 May 1991, pp\u00a0138\u2013147","DOI":"10.1145\/115790.115807"},{"issue":"1","key":"1148_CR19230","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/69.667079","volume":"10","author":"A Kumar","year":"1998","unstructured":"Kumar A, Tsotras VJ, Faloutsos C (1998) Designing access methods for bitemporal databases. IEEE Trans Knowl Data Eng (TKDE) 10(1):1\u201320","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"1148_CR19231","doi-asserted-by":"crossref","unstructured":"Leutenegger ST, Edgington JM, Lopez MA (1997) Str: a simple and efficient algorithm for r-tree packing. In: Proceedings of international conference on data engineering (ICDE), Birmingham, 7\u201311 Apr 1997, pp\u00a0497\u2013506","DOI":"10.1109\/ICDE.1997.582015"},{"key":"1148_CR19232","doi-asserted-by":"crossref","unstructured":"Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) Rtrees: theory and applications. Springer","DOI":"10.1007\/978-1-84628-293-5"},{"issue":"4","key":"1148_CR19233","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1023\/A:1025521422319","volume":"7","author":"A Nanopoulos","year":"2003","unstructured":"Nanopoulos A, Vassilakopoulos M, Manolopoulos Y (2003) Performance evaluation of lazy deletion methods in r-trees. GeoInformatica 7(4):337\u2013354","journal-title":"GeoInformatica"},{"issue":"4","key":"1148_CR19234","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/971699.318900","volume":"14","author":"N Roussopoulos","year":"1985","unstructured":"Roussopoulos N, Leifker D (1985) Direct spatial search on pictorial databases using packed r-trees. SIGMOD Rec 14(4):17\u201331","journal-title":"SIGMOD Rec"},{"issue":"2","key":"1148_CR19235","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/335191.335427","volume":"29","author":"S Saltenis","year":"2000","unstructured":"Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. SIGMOD Rec 29(2):331\u2013342","journal-title":"SIGMOD Rec"},{"issue":"1","key":"1148_CR19236","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0164-1212(00)00057-1","volume":"53","author":"T Schreck","year":"2000","unstructured":"Schreck T, Chen Z (2000) Branch grafting method for r-tree implementation. J Syst Softw 53(1):83\u201393","journal-title":"J Syst Softw"},{"key":"1148_CR19237","unstructured":"Sellis T, Roussopoulos N, Faloutsos C (1987) The r+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of very large data bases (VLDB), Brighton, pp\u00a0507\u2013518"},{"key":"1148_CR19238","unstructured":"Tao Y, Papadias D (2001) MV3R-Tree: a spatio-temporal access method for timestamp and interval queries. In: Proceedings of very large data bases (VLDB), Roma, pp\u00a0431\u2013440"},{"key":"1148_CR19239","unstructured":"Theodoridis Y (2003) The R-tree-portal"},{"key":"1148_CR19240","doi-asserted-by":"crossref","unstructured":"Theodoridis Y, Sellis T (1996) A model for the prediction of r-tree performance. In: Proceedings of ACM symposium on principles of database systems (PODS), Montreal, pp\u00a0161\u2013171","DOI":"10.1145\/237661.237705"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17885-1_1151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T12:28:47Z","timestamp":1569328127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-17885-1_1151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319178844","9783319178851"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17885-1_1151","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}