{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:36Z","timestamp":1759683756057,"version":"3.43.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["GeoInformatica"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1023403908170","type":"journal-article","created":{"date-parts":[[2003,6,6]],"date-time":"2003-06-06T13:42:07Z","timestamp":1054906927000},"page":"113-137","source":"Crossref","is-referenced-by-count":73,"title":["Fast Nearest-Neighbor Query Processing in Moving-Object Databases"],"prefix":"10.1007","volume":"7","author":[{"given":"K.","family":"Raptopoulou","sequence":"first","affiliation":[]},{"given":"A.N.","family":"Papadopoulos","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Manolopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5121975_CR1","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, L. Arge, and J. Erickson. \u201cIndexing moving points,\u201d Proceedings 19th ACM PODS Symposium, 175\u2013186, 2000.","DOI":"10.1145\/335168.335220"},{"key":"5121975_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, and B. Seeger. \u201cThe R*-tree: an efficient and robust method for points and rectangles,\u201d Proceedings ACM SIGMOD Conference, 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"5121975_CR3","doi-asserted-by":"crossref","unstructured":"R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis. \u201cNearest neighbor and reverse nearest neighbor queries for moving objects,\u201d Proceedings IDEAS Conference, 44\u201353, 2002.","DOI":"10.1109\/IDEAS.2002.1029655"},{"key":"5121975_CR4","doi-asserted-by":"crossref","unstructured":"A. Guttman. \u201cR-trees: A dynamic index structure for spatial searching,\u201d Proceedings ACM SIGMOD Conference, 47\u201357, 1984.","DOI":"10.1145\/971697.602266"},{"key":"5121975_CR5","doi-asserted-by":"crossref","unstructured":"M. Hadjieleftheriou, G. Kollios, V.J. Tsotras, and D. Gunopoulos. \u201cEfficient indexing of spatio-temporal objects,\u201d Proceedings 8th EDBT Conference, 251\u2013268, 2002.","DOI":"10.1007\/3-540-45876-X_17"},{"key":"5121975_CR6","doi-asserted-by":"crossref","unstructured":"G. Hjaltason and H. Samet. \u201cRanking in spatial databases,\u201d Proceedings 4th SSD Symposium, 83\u201395, 1995.","DOI":"10.1007\/3-540-60159-7_6"},{"issue":"2","key":"5121975_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G. Hjaltason","year":"1999","unstructured":"G. Hjaltason and H. Samet. \u201cDistance browsing in spatial databases,\u201d ACM Transactions on Database Systems, Vol. 24(2):265\u2013318, 1999.","journal-title":"ACM Transactions on Database Systems"},{"key":"5121975_CR8","doi-asserted-by":"crossref","unstructured":"Y. Ishikawa, H. Kitagawa, and T. Kawashima. \u201cContinual neighborhood tracking for moving objects using adaptive distances,\u201d Proceedings IDEAS Conference, 54\u201363, 2002.","DOI":"10.1109\/IDEAS.2002.1029656"},{"key":"5121975_CR9","doi-asserted-by":"crossref","unstructured":"D.V. Kalashnikov, S. Prabhakar, S.E. Hambrusch, and W.G. Aref. \u201cEfficient evaluation of continuous range queries on moving objects,\u201d Proceedings 13th DEXA Conference, 731\u2013740, 2002.","DOI":"10.1007\/3-540-46146-9_72"},{"key":"5121975_CR10","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gounopoulos, and V.J. Tsotras. \u201cNearest neighbor queries in a mobile environment,\u201d Proceedings Workshop on Spatio-temporal Database Management, 119\u2013134, 1999a.","DOI":"10.1007\/3-540-48344-6_7"},{"key":"5121975_CR11","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopoulos, and V. Tsotras. \u201cOn indexing mobile objects,\u201d Proceedings 18th ACM PODS Symposium, 261\u2013272, 1999b.","DOI":"10.1145\/303976.304002"},{"issue":"1","key":"5121975_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/69.667079","volume":"10","author":"A. Kumar","year":"1998","unstructured":"A. Kumar, V.J. Tsotras, and C. Faloutsos. \u201cDesigning access methods for bitemporal databases,\u201d IEEE Transactions on Knowledge and Data Engineering, Vol. 10(1):1\u201320, 1998.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5121975_CR13","doi-asserted-by":"crossref","unstructured":"I. Lazaridis, I. Porkaew, and S. Mehrotra. \u201cDynamic queries over mobile objects,\u201d Proceedings 8th EDBT Conference, 269\u2013286, 2002.","DOI":"10.1007\/3-540-45876-X_18"},{"key":"5121975_CR14","doi-asserted-by":"crossref","unstructured":"D. Lomet and B. Salsberg. \u201cAccess methods for multiversion data,\u201d Proceedings ACM SIGMOD Conference, 315\u2013324, 1989.","DOI":"10.1145\/66926.66956"},{"key":"5121975_CR15","doi-asserted-by":"crossref","unstructured":"J. Moreira, C. Ribeiro, and T. Abdessalem. \u201cQuery operations for moving objects database systems,\u201d Proceedings 8th ACM-GIS Workshop, 108\u2013114, 2000.","DOI":"10.1145\/355274.355290"},{"key":"5121975_CR16","doi-asserted-by":"crossref","unstructured":"M.A. Nascimento and J.R.O. Silva. \u201cTowards historical R-trees,\u201d Proceedings 13th ACM SAC Symposium, 235\u2013240, 1998.","DOI":"10.1145\/330560.330692"},{"key":"5121975_CR17","unstructured":"D. Pfoser, C.S. Jensen, and Y. Theodoridis. \u201cNovel approaches to the indexing of moving object trajectories,\u201d Proceedings 26th VLDB Conference, 395\u2013406, 2000."},{"key":"5121975_CR18","doi-asserted-by":"crossref","unstructured":"C.M. Procopiuc, P.K. Agarwal, and S. Har-Peled. \u201cSTAR-tree: An efficient self-adjusting index for moving objects,\u201d Proceedings ALENEX Conference, 178\u2013193, 2002.","DOI":"10.1007\/3-540-45643-0_14"},{"key":"5121975_CR19","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley, and F. Vincent. \u201cNearest neighbor queries,\u201d Proceedings ACM SIGMOD Conference, 71\u201379, 1995.","DOI":"10.1145\/568271.223794"},{"issue":"3","key":"5121975_CR20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.268881","volume":"27","author":"C. Ruemmler","year":"1994","unstructured":"C. Ruemmler and J. Wilkes. \u201cAn introduction to disk drive modeling,\u201d IEEE Computer, Vol. 27(3):17\u201329, 1994.","journal-title":"IEEE Computer"},{"key":"5121975_CR21","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C.S. Jensen, S. Leutenegger, and M. Lopez. \u201cIndexing the positions of continuously moving objects,\u201d Proceedings ACM SIGMOD Conference, 331\u2013342, 2000.","DOI":"10.1145\/342009.335427"},{"key":"5121975_CR22","unstructured":"A.P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. \u201cModeling and querying moving objects,\u201d Proceedings 13th IEEE ICDE Conference, 422\u2013432, 1997."},{"key":"5121975_CR23","doi-asserted-by":"crossref","unstructured":"Z. Song and N. Roussopoulos. \u201cK-NN search for moving query point,\u201d Proceedings 7th SSTD Symposium, 79\u201396, 2001a.","DOI":"10.1007\/3-540-47724-1_5"},{"key":"5121975_CR24","doi-asserted-by":"crossref","unstructured":"Z. Song and N. Roussopoulos. \u201cHashing moving objects,\u201d Proceedings 1st Workshop on Mobile Data Management, 161\u2013172, 2001b.","DOI":"10.1007\/3-540-44498-X_13"},{"key":"5121975_CR25","unstructured":"Y. Tao and D. Papadias. \u201cEfficient historical R-trees,\u201d Proceedings 13th SSDBM Conference, 2001a."},{"key":"5121975_CR26","unstructured":"Y. Tao and D. Papadias. \u201cMV3R-tree \u2014 a spatio-temporal access method for timestamp and interval queries,\u201d Proceedings 27th VLDB Conference, 431\u2013440, 2001b."},{"key":"5121975_CR27","doi-asserted-by":"crossref","unstructured":"Y. Tao, D. Papadias, and Q. Shen. \u201cContinuous nearest neighbor search,\u201d Proceedings 28th VLDB Conference, 287\u2013298, 2002a.","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"5121975_CR28","doi-asserted-by":"crossref","unstructured":"Y. Tao and D. Papadias. \u201cTime-parameterized queries in spatio-temporal databases,\u201d Proceedings ACM SIGMOD Conference, 334\u2013345, 2002b.","DOI":"10.1145\/564691.564730"},{"key":"5121975_CR29","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, M. Vazirgiannis, and T. Sellis. \u201cSpatio-temporal indexing for large multimedia applications,\u201d Proceedings 3rd IEEE Conference on Multimedia Computing and Systems, 441\u2013448, 1996.","DOI":"10.1109\/MMCS.1996.535011"},{"key":"5121975_CR30","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, T. Sellis, A.N. Papadopoulos, and Y. Manolopoulos. \u201cSpecifications for efficient indexing in spatio-temporal databases,\u201d Proceedings 10th SSDBM Conference, 123\u2013132, 1998.","DOI":"10.1109\/SSDM.1998.688117"},{"key":"5121975_CR31","doi-asserted-by":"crossref","unstructured":"O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. \u201cMoving objects databases: Issues and solutions,\u201d Proceedings 10th SSDBM Conference, 111\u2013122, 1998.","DOI":"10.1109\/SSDM.1998.688116"},{"key":"5121975_CR32","doi-asserted-by":"crossref","unstructured":"O. Wolfson, B. Xu, and S. Chamberlain. \u201cLocation prediction and queries for tracking moving objects,\u201d Proceedings 16th IEEE ICDE Conference, 687\u2013688, 2000.","DOI":"10.1109\/ICDE.2000.839495"},{"key":"5121975_CR33","unstructured":"X. Xu, J. Han, and W. Lu. \u201cRT-tree: An improved R-tree index structure for spatio-temporal databases,\u201d Proceedings SDH Conference, 1040\u20131049, 1990."},{"key":"5121975_CR34","doi-asserted-by":"crossref","unstructured":"B. Zheng and D. Lee. \u201cSemantic caching in location-dependent query processing,\u201d Proceedings 7th SSTD Symposium, 97\u2013116, 2001.","DOI":"10.1007\/3-540-47724-1_6"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1023403908170.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1023403908170\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1023403908170.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T19:55:46Z","timestamp":1754423746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1023403908170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5121975"],"URL":"https:\/\/doi.org\/10.1023\/a:1023403908170","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}