{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:39Z","timestamp":1725512079572},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540724834"},{"type":"electronic","value":"9783540725244"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72524-4_58","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T16:15:32Z","timestamp":1182788132000},"page":"566-573","source":"Crossref","is-referenced-by-count":1,"title":["Continuous k-Nearest Neighbor Search Under Mobile Environment"],"prefix":"10.1007","author":[{"given":"Jun","family":"Feng","sequence":"first","affiliation":[]},{"given":"Linyan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yuelong","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Naoto","family":"Mukai","sequence":"additional","affiliation":[]},{"given":"Toyohide","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the 30th Very Large DataBase, pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S., Snoeyink, J.: Queries with segments in voronoi diagrams. In: SODA (1999)","DOI":"10.1016\/S0925-7721(99)00055-3"},{"key":"58_CR3","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Continuous k nearest neighbor queries in spatial network databases. In: Proceedings of the Second Workshop on Spatio-Temporal Database Management, pp. 33\u201340 (2004)","DOI":"10.1016\/B978-012088469-8\/50074-7"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Tao, Y.F., Papadias, D., Shen, Q.M.: Continuous nearest neighbor search. In: Proc. of VLDB\u201902, pp. 287\u2013298 (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"58_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-47724-1_5","volume-title":"Advances in Spatial and Temporal Databases","author":"Z. Song","year":"2001","unstructured":"Song, Z., Roussopoulos, N.: K-Nearest Neighbor Search for Moving Query Point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 79\u201396. Springer, Heidelberg (2001)"},{"key":"58_CR6","unstructured":"Feng, J., Watanabe, T.: A fast method for continuous nearest target objects query on road network. In: Proc. of VSMM\u201902, pp. 182\u2013191 (2002)"},{"key":"58_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-540-30577-4_41","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"J. Feng","year":"2005","unstructured":"Feng, J., Mukai, N., Watanabe, T.: Stepwise Optimization Method for k-CNN Search for Location-Based Service. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 368\u2013371. Springer, Heidelberg (2005)"},{"key":"58_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/11504894_91","volume-title":"Innovations in Applied Artificial Intelligence","author":"J. Feng","year":"2005","unstructured":"Feng, J., Zhu, Y., Mukai, N., Watanabe, T.: Search on Transportation Network for Location-Based Service. In: Ali, M., Esposito, F. (eds.) IEA\/AIE 2005. LNCS (LNAI), vol.\u00a03533, pp. 657\u2013666. Springer, Heidelberg (2005)"},{"key":"58_CR9","unstructured":"Li, Y., Yang, J., Han, J.: Continuous k-nearest neighbor search for moving objects. In: SSDBM, pp. 123\u2013126 (2004)"},{"key":"58_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/956676.956677","volume-title":"GIS \u201903: Proceedings of the 11th ACM international symposium on Advances in geographic information systems","author":"C.S. Jensen","year":"2003","unstructured":"Jensen, C.S., Kolvr, J., Bach Pedersen, T., Timko, I.: Nearest neighbor queries in road networks. In. In: GIS \u201903: Proceedings of the 11th ACM international symposium on Advances in geographic information systems, pp. 1\u20138. ACM Press, New York (2003)"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Tao, Y.F., Papadias, D., Sun, J.M.: The tpr*-tree: An optimized spatio-temporal access method for predictive queries. In: Proc. of VLDB\u201903, pp. 790\u2013801 (2003)","DOI":"10.1016\/B978-012722442-8\/50075-6"},{"issue":"2","key":"58_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltson","year":"1999","unstructured":"Hjaltson, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems\u00a024(2), 265\u2013318 (1999)","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Data and Web Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72524-4_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:01:22Z","timestamp":1605744082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72524-4_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540724834","9783540725244"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72524-4_58","relation":{},"subject":[]}}