{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T00:36:48Z","timestamp":1791074208787,"version":"4.1.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,1,18]],"date-time":"2007-01-18T00:00:00Z","timestamp":1169078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,1,18]],"date-time":"2007-01-18T00:00:00Z","timestamp":1169078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10707-006-0007-7","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T21:29:58Z","timestamp":1169069398000},"page":"159-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":76,"title":["Algorithms for Nearest Neighbor Search on Moving Object Trajectories"],"prefix":"10.1007","volume":"11","author":[{"given":"Elias","family":"Frentzos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kostas","family":"Gratsias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Pelekis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,1,18]]},"reference":[{"key":"7_CR1","unstructured":"R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis. \u201cNearest neighbor and reverse nearest neighbor queries for moving objects,\u201d in Proceedings of IDEAS, 2002."},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/603867.603884","volume":"30","author":"S. Babu","year":"2001","unstructured":"S. Babu and J. Widom. \u201cContinuous queries over data streams,\u201d SIGMOD Record, Vol. 30(3):109\u2013120, 2001 (September).","journal-title":"SIGMOD Record"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"K.L. Cheung and A.W. Fu. \u201cEnhanced nearest neighbour search on the R-tree,\u201d SIGMOD Record, Vol. 27(3):16\u201321, 1998 (September).","journal-title":"SIGMOD Record"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"A. Guttman. \u201cRtrees: A dynamic index structure for spatial searching,\u201d in Proceedings of ACM SIGMOD, 1984.","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","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":"7_CR6","doi-asserted-by":"crossref","unstructured":"H. Hu, J. Xu, and D.L. Lee. \u201cA generic framework for monitoring continuous spatial queries over moving objects,\u201d in Proceedings of ACM SIGMOD, 2005.","DOI":"10.1145\/1066157.1066212"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"G.S. Iwerks, H. Samet, and K. Smith, \u201cContinuous K-nearest neighbor queries for continuously moving points with updates,\u201d in Proceedings of VLDB, 2003.","DOI":"10.1016\/B978-012722442-8\/50052-5"},{"key":"7_CR8","volume-title":"R-trees: Theory and Applications","author":"Y. Manolopoulos","year":"2005","unstructured":"Y. Manolopoulos, A. Nanopoulos, A.N. Papadopoulos, and Y. Theodoridis. R-trees: Theory and Applications. Springer: Berlin Heidelberg New York, 2005."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"K. Mouratidis, M. Hadjieleftheriou, and D. Papadias. \u201cConceptual partitioning: An efficient method for continuous nearest neighbor monitoring,\u201d in Proceedings of ACM SIGMOD, 2005.","DOI":"10.1145\/1066157.1066230"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"M.F. Mokbel, X. Xiong, and W.G. Aref, \u201cSINA: Scalable incremental processing of continuous queries in spatio-temporal databases,\u201d in Proceedings of ACM SIGMOD, 2004.","DOI":"10.1145\/1007568.1007638"},{"key":"7_CR11","unstructured":"D. Pfoser, C.S. Jensen, and Y. Theodoridis, \u201cNovel approaches to the indexing of moving object trajectories,\u201d in Proceedings of VLDB, 2000."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley, and F. Vincent. \u201cNearest neighbor queries,\u201d in Proceedings of ACM SIGMOD, 1995.","DOI":"10.1145\/223784.223794"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C.S. Jensen, S. Leutenegger, and M. Lopez. \u201cIndexing the positions of continuously moving objects,\u201d in Proceedings of ACM SIGMOD, 2000.","DOI":"10.1145\/342009.335427"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C. Shahabi","year":"2003","unstructured":"C. Shahabi, M. Kolahdouzan, and M. Sharifzadeh. \u201cA road network embedding technique for K-nearest neighbor search in moving object databases,\u201d GeoInformatika, Vol. 7(3):255\u2013273, 2003.","journal-title":"GeoInformatika"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Z. Song and N. Roussopoulos. \u201cK-nearest neighbor search for moving query point,\u201d in Proceedings of SSTD, 2001.","DOI":"10.1007\/3-540-47724-1_5"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Y. Tao and D. Papadias, \u201cTime parameterized queries in spatio-temporal databases,\u201d in Proceedings of ACM SIGMOD, 2002.","DOI":"10.1145\/564691.564730"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Y. Tao, D. Papadias, and Q. Shen. \u201cContinuous nearest neighbor search,\u201d Proceedings of VLDB, 2002.","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"7_CR18","unstructured":"Y. Theodoridis. \u201cThe R-tree portal,\u201d URL: http:\/\/www.rtreeportal.org (accessed 13 December 2005)."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, J.R.O. Silva, and M.A. Nascimento. \u201cOn the generation of spatio-temporal datasets,\u201d in Proceedings of SSD, 1999.","DOI":"10.1007\/3-540-48482-5_11"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/958942.958943","volume":"28","author":"Y. Tao","year":"2003","unstructured":"Y. Tao, J. Sun, and D. Papadias. \u201cAnalysis of predictive spatio-temporal queries,\u201d ACM Transactions on Database Systems, Vol. 28(4):295\u2013336, 2003 December.","journal-title":"ACM Transactions on Database Systems"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, M. Vazirgiannis, and T. Sellis. \u201cSpatio-temporal indexing for large multimedia applications.\u201d in Proceedings of ICMCS, 1996.","DOI":"10.1109\/MMCS.1996.535011"},{"key":"7_CR22","unstructured":"X. Yu, K. Pu, and N. Koudas. \u201cMonitoring k-nearest neighbor queries over moving objects,\u201d in Proceedings of ICDE, 2005."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"X. Xiong, M. Mokbel, and W. Aref. \u201cSEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases,\u201d in Proceedings of ICDE, 2005.","DOI":"10.1145\/1007568.1007638"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-006-0007-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-006-0007-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-006-0007-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-006-0007-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T23:51:10Z","timestamp":1652831470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-006-0007-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,18]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s10707-006-0007-7","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,18]]},"assertion":[{"value":"2 August 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}