{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T04:00:05Z","timestamp":1771992005122,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433248","type":"print"},{"value":"9783540458760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45876-x_17","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:28:28Z","timestamp":1181183308000},"page":"251-268","source":"Crossref","is-referenced-by-count":78,"title":["Efficient Indexing of Spatiotemporal Objects"],"prefix":"10.1007","author":[{"given":"Marios","family":"Hadjieleftheriou","sequence":"first","affiliation":[]},{"given":"George","family":"Kollios","sequence":"additional","affiliation":[]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. In Proc. of the 19th ACM Symp. on Principles of Database Systems (PODS), pages 175\u2013186, 2000.","DOI":"10.1145\/335168.335220"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"B. Becker, T. Ohler S. Gschwind, B. Seeger, and P. Widmayer. An Asymptotically Optimal Multiversion B-Tree. VLDB Journal 5(4), pages 264\u2013275, 1996.","journal-title":"VLDB Journal"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"N. Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of ACM SIGMOD, pages 220\u2013231, June 1990.","DOI":"10.1145\/93597.98741"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1093\/comjnl\/33.3.279","volume":"33","author":"F. Burton","year":"1990","unstructured":"F. Burton, J. Kollias, V. Kollias, and D. Matsakis. Implementation of overlapping btrees for time and space efficient representation of collection of similar files. The Computer Journal, Vol.33, No.3, pages 279\u2013280, 1990.","journal-title":"The Computer Journal"},{"key":"17_CR5","unstructured":"M. Cai and P. Revesz. Parametric r-tree: An index structure for moving objects. In Proc. of the COMAD, 2000."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. Driscoll","year":"1989","unstructured":"J. Driscoll, N. Sarnak, D. Sleator, and R.E. Tarjan. Making Data Structures Persistent. Journal of Computer and System Sciences, Vol. 38, No. 1, pages 86\u2013124, 1989.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/352958.352963","volume":"25","author":"R. Guting","year":"2000","unstructured":"R. Guting, M. Bohlen, M. Erwig, C. Jensen, N. Lorentzos, M. Schneider, and M. Vazirgiannis. A Foundation for Representing and Querying Moving Objects. In ACM TODS, Vol. 25, No 1, pages 1\u201342, 2000.","journal-title":"ACM TODS"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of ACM SIGMOD, pages 47\u201357, 1984.","DOI":"10.1145\/602259.602266"},{"key":"17_CR9","unstructured":"I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree Using Fractals. Proceedings of VLDB, pages 500\u2013510, September 1994."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, and V. Tsotras. Indexing Animated Objects. In Proc. 5th Int. MIS Workshop, Palm Springs Desert, CA, 1999.","DOI":"10.1145\/303976.304002"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, and V. Tsotras. On Indexing Mobile Objects. In Proc. of the 18th ACM Symp. on Principles of Database Systems (PODS), pages 261\u2013272, June 1999.","DOI":"10.1145\/303976.304002"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, V. Tsotras, A. Delis, and M. Hadjieleftheriou. Indexing Animated Objects Using Spatio-Temporal Access Methods. IEEE Trans. Knowledge and Data Engineering, pages 742\u2013777, September 2001.","DOI":"10.1109\/69.956099"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"C. Kolovson and M. Stonebraker. Segment Indexes: Dynamic indexing techniques for multidimensional interval data. In Proc. of ACM SIGMOD, pages 138\u2013147, 1991.","DOI":"10.1145\/119995.115807"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/69.667079","volume":"10","author":"A. Kumar","year":"1998","unstructured":"A. Kumar, V.J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE Trans. Knowledge and Data Engineering, 10(1):1\u201320, 1998.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"S.T. Leutenegger, M.A. Lopez, and J.M. Edgington. STR: A simple and efficient algorithm for r-tree packing. In Proc. of IEEE ICDE, 1997.","DOI":"10.1109\/ICDE.1997.582015"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"D. Lomet and B. Salzberg. Access Methods for Multiversion Data. In Proceedings of ACM SIGMOD Conf.,Portland, Oregon, pages 315\u2013324, 1989.","DOI":"10.1145\/67544.66956"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"M. Nascimento and J. Silva. Towards historical r-trees. Proc. of SAC, 1998.","DOI":"10.1145\/330560.330692"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"J. A. Orenstein. Redundancy in spatial databases. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, pages 294\u2013305, Portland, Oregon, 31 May\u20132 June 1989.","DOI":"10.1145\/67544.66954"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer. Towards an analysis of range query performance in spatial data structures. In Proc. of ACM PODS, pages 214\u2013221, 1993.","DOI":"10.1145\/153850.153878"},{"key":"17_CR20","unstructured":"D. Pfoser, C. Jensen, and Y. Theodoridis. Novel Approaches in Query Processing for Moving Objects. In Proceedings of VLDB, Cairo Egypt, September 2000."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"K. Porkaew, I. Lazaridis, and S. Mehrotra. Querying mobile objects in spatio-temporal databases. In Proc. of 7th SSTD, July 2001.","DOI":"10.1007\/3-540-47724-1_4"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"S. Saltenis and C. Jensen. Indexing of Moving Objects for Location-Based Services. To Appear in Proc. of IEEE ICDE, 2002.","DOI":"10.1109\/ICDE.2002.994759"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C. Jensen, S. Leutenegger, and Mario A. Lopez. Indexing the Positions of Continuously Moving Objects. In Proceedings of the ACMSIGMOD, pages 331\u2013342, May 2000.","DOI":"10.1145\/335191.335427"},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B. Salzberg","year":"1999","unstructured":"B. Salzberg and V. Tsotras. Comparison of access methods for time-evolving data. ACM Computing Surveys, 31(2):158\u2013221, 1999.","journal-title":"ACM Computing Surveys"},{"key":"17_CR25","unstructured":"Y. Tao and D. Papadias. Mv3r-tree: a spatio-temporal access method for timestamp and interval queries. In Proc. of the VLDB, 2001."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Y. Tao and D. Papadias. Cost models for overlapping and multi-version structures. In Proc. of IEEE ICDE, 2002.","DOI":"10.1145\/581751.581754"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis and T. Sellis. A model for the prediction of R-tree performance. In Proc. of ACM PODS, pages 161\u2013171, 1996.","DOI":"10.1145\/237661.237705"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, T. Sellis, A. Papadopoulos, and Y. Manolopoulos. Specifications for efficient indexing in spatiotemporal databases. In Proc. of 11th Int. Conf. on SSDBMs, pages 123\u2013132, 1998.","DOI":"10.1109\/SSDM.1998.688117"},{"issue":"3","key":"17_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/comjnl\/43.4.325","volume":"43","author":"T. Tzouramanis","year":"2000","unstructured":"T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Overlapping linear quadtrees and spatio-temporal query processing. The Computer Journal 43(3), pages 325\u2013343, 2000.","journal-title":"The Computer Journal"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/69.599929","volume":"9","author":"P.J. Varman","year":"1997","unstructured":"P.J. Varman and R.M. Verma. An Efficient Multiversion Access Structure. IEEE Transactions on Knowledge and Data Engineering, Vol. 9, No 3., pages 391\u2013409, 1997.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45876-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:18:45Z","timestamp":1737076725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45876-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433248","9783540458760"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45876-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}