{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:56:20Z","timestamp":1775638580688,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,11,8]],"date-time":"2005-11-08T00:00:00Z","timestamp":1131408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10707-005-4575-8","type":"journal-article","created":{"date-parts":[[2005,11,3]],"date-time":"2005-11-03T18:39:47Z","timestamp":1131043187000},"page":"321-341","source":"Crossref","is-referenced-by-count":61,"title":["Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases"],"prefix":"10.1007","volume":"9","author":[{"given":"Mohammad R.","family":"Kolahdouzan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyrus","family":"Shahabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,8]]},"reference":[{"key":"4575_CR1","unstructured":"J. Feng and T. Watanabe. A Fast Method for Continuous Nearest Target Objects Query on Road Network. VSMM'02, Korea, pp. 182\u2013191, Sept. 2002."},{"issue":"2","key":"4575_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"G.R. Hjaltason and H. Samet. \u201cDistance browsing in spatial databases,\u201d TODS, Vol. 24(2):265\u2013318, 1999.","journal-title":"TODS"},{"key":"4575_CR3","doi-asserted-by":"crossref","unstructured":"G.S. Iwerks, H. Samet, and K. Smith. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. VLDB, Berlin, Germany, pp. 512\u2013523, 2003.","DOI":"10.1016\/B978-012722442-8\/50052-5"},{"key":"4575_CR4","doi-asserted-by":"crossref","unstructured":"C.S. Jensen, J. Kolrvr, Torben Bach Pedersen, and Igor Timko. Nearest Neighbor Queries in Road Networks. ACM-GIS03, New Orleans, LA, USA, 2003.","DOI":"10.1145\/956676.956677"},{"key":"4575_CR5","doi-asserted-by":"crossref","unstructured":"M. Kolahdouzan and C. Shahabi. Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. VLDB, Toronto, Canada, 2004.","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"4575_CR6","unstructured":"F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast Nearest Neighbor Search in Medical Image Databases. VLDB, Mumbai (Bombay), India, 1996."},{"key":"4575_CR7","unstructured":"Y. Li, J. Yang, and J. Han. Continuous K-Nearest Neighbor Search for Moving Objects. SSDBM, Santorini Island, Greece, 2004."},{"key":"4575_CR8","volume-title":"Spatial Tessellations, Concepts and Applications of Voronoi Diagrams. 0-471-98635-6","author":"A. Okabe","year":"2000","unstructured":"A. Okabe, B. Boots, K. Sugihara, and S.N. Chiu. Spatial Tessellations, Concepts and Applications of Voronoi Diagrams. 0-471-98635-6, 2nd Edition, John Wiley and Sons Ltd: England, 2000.","edition":"2"},{"key":"4575_CR9","doi-asserted-by":"crossref","unstructured":"D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query Processing in Spatial Network Databases. VLDB, Berlin, Germany, 2003.","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"4575_CR10","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. SIGMOD, San Jose, CA, 1995.","DOI":"10.1145\/223784.223794"},{"key":"4575_CR11","doi-asserted-by":"crossref","unstructured":"T. Seidl and H.-P. Kriegel. Optimal Multi-Step k-Nearest Neighbor Search. SIGMOD, Seattle, WA, USA, 1998.","DOI":"10.1145\/276304.276319"},{"key":"4575_CR12","doi-asserted-by":"crossref","unstructured":"S. Shekhar and J.S. Yoo. Processing in-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches. ACM-GIS03, New Orleans, LA, USA, 2003.","DOI":"10.1145\/956676.956678"},{"key":"4575_CR13","unstructured":"P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and Querying Moving Objects. IEEE ICDE, 1997."},{"key":"4575_CR14","doi-asserted-by":"crossref","unstructured":"Z. Song and N. Roussopoulos. K-Nearest Neighbor Search for Moving Query Point. SSTD, Redondo Beach, CA, USA, 2001.","DOI":"10.1007\/3-540-47724-1_5"},{"key":"4575_CR15","doi-asserted-by":"crossref","unstructured":"Y. Tao and D. Papadias. Time Parameterized Queries in Spatio-Temporal Databases. SIGMOD, 2002.","DOI":"10.1145\/564691.564730"},{"key":"4575_CR16","doi-asserted-by":"crossref","unstructured":"Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. VLDB, Hong Kong, China, 2002.","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"4575_CR17","unstructured":"X. Xiong, M.F. Mokbel, and W.G. Aref. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. ICDE, Tokyo, Japan, 2005."}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-005-4575-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-005-4575-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-005-4575-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T17:12:23Z","timestamp":1586538743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-005-4575-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,8]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4575"],"URL":"https:\/\/doi.org\/10.1007\/s10707-005-4575-8","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,8]]}}}