{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T04:00:10Z","timestamp":1771992010424,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540423010","type":"print"},{"value":"9783540477242","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47724-1_4","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T23:51:52Z","timestamp":1185925912000},"page":"59-78","source":"Crossref","is-referenced-by-count":34,"title":["Querying Mobile Objects in Spatio-Temporal Databases"],"prefix":"10.1007","author":[{"given":"Kriengkrai","family":"Porkaew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iosif","family":"Lazaridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharad","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. VLDB Journal, 5(4):264\u2013275, 1996.","journal-title":"VLDB Journal"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 322\u2013331, May 1990.","DOI":"10.1145\/93605.98741"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-tree: a dynamic index structure for spatial searching. In ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 47\u201357, June 1984.","DOI":"10.1145\/971697.602266"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Int\u2019l Symposium on Large Spatial Databases, 1995.","DOI":"10.1007\/3-540-60159-7_6"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In Symposium on Principles of Database Systems, 1999.","DOI":"10.1145\/303976.304002"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"D. Lomet","year":"1990","unstructured":"D. Lomet and B. Salzberg. The hB-Tree: A multiattribute indexing method with good guaranteed performance. ACM Trans. on Database Systems, 15(4):625\u2013658, 1990.","journal-title":"ACM Trans. on Database Systems"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"D. Lomet and B. Salzberg. The performance of a multiversion access method. In ACM SIGMOD Int\u2019l Conf. on Management of Data, 1990.","DOI":"10.1145\/93597.98744"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"J. A. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces. In ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 343\u2013352, 1990.","DOI":"10.1145\/93597.98743"},{"key":"4_CR9","unstructured":"K. Porkaew. Database support for similarity retrieval and querying mobile objects. Technical report, PhD thesis, University of Illinois at Urbana-Champaign, 2000."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"J. T. Robinson. The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In ACM SIGMOD Int\u2019l Conf. on Management of Data, 1981.","DOI":"10.1145\/582318.582321"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In ACM SIGMOD Int\u2019l Conf. on Management of Data, 1995.","DOI":"10.1145\/223784.223794"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C. Jensen, S. Leutenegger, and M. Lopez. Indexing the positions of continuously moving objects. In ACM SIGMOD Int\u2019l Conf. on Management of Data, 2000.","DOI":"10.1145\/342009.335427"},{"issue":"2","key":"4_CR13","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"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"H. Samet. The quadtree and related hierarchial data structures. ACM Computing Surveys, 16(2):187\u2013260, 1984.","journal-title":"ACM Computing Surveys"},{"key":"4_CR15","unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+ tree: A dynamic index for multi-dimensional objects. In Int\u2019l Conf. on Very Large Data Bases, 1987."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/41.3.185","volume":"41","author":"J. Tayeb","year":"1998","unstructured":"J. Tayeb, O. Ulusoy, and O. Wolfson. A quadtree based dynamic attribute indexing method. Computer Journal, 41(3):185\u2013200, 1998.","journal-title":"Computer Journal"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, T. Sellis, A. N. Papadopoulos, and Y. Manolopoulos. Specifications for efficient indexing in spatiotemporal databases. In Int\u2019l Conf. on Scientific and Statistical Database Management, pages 123\u2013132, 1998.","DOI":"10.1109\/SSDM.1998.688117"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving objects databases: Issues and solutions. In Int\u2019l Conf. on Scientific and Statistical Database Management, pages 111\u2013122, 1998.","DOI":"10.1109\/SSDM.1998.688116"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47724-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:28:10Z","timestamp":1737336490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47724-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423010","9783540477242"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-47724-1_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}