{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:12:47Z","timestamp":1762323167630,"version":"3.33.0"},"publisher-location":"Boston, MA","reference-count":26,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387308586"},{"type":"electronic","value":"9780387359731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-35973-1_1151","type":"book-chapter","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T23:27:52Z","timestamp":1199834872000},"page":"993-1002","source":"Crossref","is-referenced-by-count":15,"title":["R-Trees \u2013 A\u00a0Dynamic Index Structure for\u00a0Spatial 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","reference":[{"doi-asserted-by":"crossref","unstructured":"Ang, C.-H., Tan, T.C.: New linear node splitting algorithm for r-trees. In: Proc. of Symposium on Advances in Spatial Databases (SSD), Berlin, Germany, 15\u201318 July 1997, pp.\u00a0339\u2013349","key":"1151_CR1","DOI":"10.1007\/3-540-63238-7_38"},{"key":"1151_CR2","first-page":"322","volume-title":"Proc. ACM International Conference on Management of Data (SIGMOD'90)","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. of ACM Management of Data (SIGMOD), New Jersey, USA, 23\u201325 May 1990, pp.\u00a0220\u2013231"},{"doi-asserted-by":"crossref","unstructured":"Brakatsoulas, S., Pfoser, D., Theodoridis, Y: Revisiting r-tree construction principles. In: Proc. of the East European Conference on Advances in Databases and Information Systems, Bratislava, Slovakia, 8\u201311 Sept 2002, pp.\u00a0149\u2013162","key":"1151_CR3","DOI":"10.1007\/3-540-45710-0_13"},{"issue":"1","key":"1151_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comp. Syst. Sci. 38(1):86\u2013124 (1989)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Kamel, I.: Beyond uniformity and independence: analysis of r-trees using the concept of fractal dimension. In: Proc. of ACM Symposium on Principles of Database Systems (PODS), Minnesota, USA, 24\u201326 May 1994, pp.\u00a04\u201313","key":"1151_CR5","DOI":"10.1145\/182591.182593"},{"issue":"3","key":"1151_CR6","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1145\/38714.38758","volume":"16","author":"C. Faloutsos","year":"1987","unstructured":"Faloutsos, C., Sellis, T., Roussopoulos, N.: Analysis of object oriented spatial access methods. SIGMOD Record 16(3):426\u2013439 (1987)","journal-title":"SIGMOD Record"},{"unstructured":"Garcia, Y.J., Lopez, M.A., Leutenegger, S.T.: On optimal node splitting for r-trees. In: Proc. of Very Large Data Bases (VLDB), New York, USA, 24\u201327 Aug 1998, pp.\u00a0334\u2013344","key":"1151_CR7"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A\u00a0dynamic index structure for spatial searching. In: Proc. of ACM Management of Data (SIGMOD), Massachusetts, USA, 18\u201321 June 1984, pp.\u00a047\u201357","key":"1151_CR8","DOI":"10.1145\/971697.602266"},{"doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Hoel, E., Tsotras, V.J.: Sail: A\u00a0library for efficient application integration of spatial indices. In: Proc. of Scientific and Statistical Database Management (SSDBM), Santorini Island, Greece, 21\u201323 2004, pp.\u00a0135\u2013138","key":"1151_CR9","DOI":"10.1109\/SSDM.2004.1311205"},{"doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Efficient indexing of spatiotemporal objects. In: Proc. of Extending Database Technology (EDBT), Prague, 24\u201328 Mar 2002, pp.\u00a0251\u2013268","key":"1151_CR10","DOI":"10.1007\/3-540-45876-X_17"},{"issue":"3","key":"1151_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0164-1212(00)00078-9","volume":"55","author":"P.W. Huang","year":"2001","unstructured":"Huang, P.W., Lin, P.L., Lin, H.Y.: Optimizing storage utilization in r-tree dynamic index structure for spatial databases. J. Syst. Softw. 55(3):291\u2013299 (2001)","journal-title":"J. Syst. Softw."},{"doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: On packing r-trees. In: Proc. of Conference on Information and Knowledge Management (CIKM), Washington DC, USA, 1\u20135 Nov 1993, pp.\u00a0490\u2013499","key":"1151_CR12","DOI":"10.1145\/170088.170403"},{"unstructured":"Kamel, I., Faloutsos, C.: Hilbert r-tree: An improved r-tree using fractals. In: Proc. of Very Large Data Bases (VLDB), Santiago de Chile, Chile, 12\u201315 Sept 1994, pp.\u00a0500\u2013509","key":"1151_CR13"},{"issue":"5","key":"1151_CR14","first-page":"758","volume":"13","author":"G. Kollios","year":"2001","unstructured":"Kollios, G., Tsotras, V.J., Gunopulos, D., Delis, A., Hadjieleftheriou, M.: Indexing animated objects using spatiotemporal access methods. IEEE Transactions Knowl. Data Eng. (TKDE) 13(5):758\u2013777 (2001)","journal-title":"TKDE"},{"doi-asserted-by":"crossref","unstructured":"Kolovson, C., Stonebraker, M.: Segment Indexes: Dynamic indexing techniques for multi-dimensional interval data. In: Proc. of ACM Management of Data (SIGMOD),Colorado, USA, 29\u201331 May 1991, pp.\u00a0138\u2013147","key":"1151_CR15","DOI":"10.1145\/119995.115807"},{"issue":"1","key":"1151_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/69.667079","volume":"10","author":"A. Kumar","year":"1998","unstructured":"Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing access methods for bitemporal databases. IEEE Transactions Knowl. Data Eng. (TKDE) 10(1):1\u201320 (1998)","journal-title":"IEEE Transactions Knowl. Data Eng. (TKDE)"},{"unstructured":"Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: Str: A\u00a0simple and efficient algorithm for r-tree packing. In: Proc. of International Conference on Data Engineering (ICDE), Birmingham, UK, 7\u201311 Apr 1997, pp.\u00a0497\u2013506","key":"1151_CR17"},{"doi-asserted-by":"crossref","unstructured":"Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: Rtrees: Theory and Applications. Springer, Germany (2005)","key":"1151_CR18","DOI":"10.1007\/978-1-84628-293-5"},{"issue":"4","key":"1151_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1023\/A:1025521422319","volume":"7","author":"A. Nanopoulos","year":"2003","unstructured":"Nanopoulos, A., Vassilakopoulos, M., Manolopoulos, Y.: Performance evaluation of lazy deletion methods in r-trees. GeoInformatica 7(4):337\u2013354 (2003)","journal-title":"GeoInformatica"},{"issue":"4","key":"1151_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/971699.318900","volume":"14","author":"N. Roussopoulos","year":"1985","unstructured":"Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed r-trees. SIGMOD Record 14(4):17\u201331 (1985)","journal-title":"SIGMOD Record"},{"issue":"2","key":"1151_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/335191.335427","volume":"29","author":"S. Saltenis","year":"2000","unstructured":"Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. SIGMOD Record 29(2):331\u2013342 (2000)","journal-title":"SIGMOD Record"},{"issue":"1","key":"1151_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0164-1212(00)00057-1","volume":"53","author":"T. Schreck","year":"2000","unstructured":"Schreck, T., Chen, Z.: Branch grafting method for r-tree implementation. J. Syst. Softw. 53(1):83\u201393 (2000)","journal-title":"J. Syst. Softw."},{"unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C: The r+-tree: A\u00a0dynamic index for multi-dimensional objects. In: Proc. of Very Large Data Bases (VLDB), pp.\u00a0507\u2013518 (1987)","key":"1151_CR23"},{"unstructured":"Tao, Y., Papadias, D.: MV3R-Tree: A\u00a0spatio-temporal access method for timestamp and interval queries. In: Proc. of Very Large Data Bases (VLDB), pp.\u00a0431\u2013440 (2001)","key":"1151_CR24"},{"unstructured":"Theodoridis, Y.: The R-tree-Portal. (2003)","key":"1151_CR25"},{"doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.: A\u00a0model for the prediction of r-tree performance. In: Proc. of ACM Symposium on Principles of Database Systems (PODS), pp.\u00a0161\u2013171 (1996)","key":"1151_CR26","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-0-387-35973-1_1151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T13:01:28Z","timestamp":1737810088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35973-1_1151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387308586","9780387359731"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35973-1_1151","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}