{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:58:20Z","timestamp":1759683500927},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642012020"},{"type":"electronic","value":"9783642012037"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01203-7_3","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T16:35:15Z","timestamp":1241454915000},"page":"31-42","source":"Crossref","is-referenced-by-count":3,"title":["Processing of Continuous k Nearest Neighbor Queries in Road Networks"],"prefix":"10.1007","author":[{"given":"Wei","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenghua","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhinong","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45431-4_7","volume-title":"Next Generation Information Technologies and Systems","author":"O. Wolfson","year":"2002","unstructured":"Wolfson, O.: Moving objects information management: The database challenge. In: Halevy, A.Y., Gal, A. (eds.) NGITS 2002. LNCS, vol.\u00a02382, pp. 75\u201389. Springer, Heidelberg (2002)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Kol\u00e1rvr, J., Pedersen, T.B., Timko, I.: Nearest Neighbor Queries in Road Networks. In: Proc. ACM Intl. Symposium on Advances in Geographic Information Systems(ACM GIS 2003), pp. 1\u20138 (2003)","DOI":"10.1145\/956676.956677"},{"key":"3_CR3","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: Proc. Intl. Conf. on Very Large Data Bases (VLDB 2006), pp. 43\u201354 (2006)"},{"key":"3_CR4","unstructured":"Wang, H., Zimmermann, R.: Location-based Query Processing on Moving Objects in Road Networks. In: Proc. Intl. Conf. on Very Large Data Bases (VLDB 2007), pp. 321\u2013332 (2007)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. Intl. Conf. on Very Large Data Bases, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: Proc. Intl. Conf. on Very Large Data Bases (VLDB 2004), pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8\/50074-7"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable Incremental Processing of Continuous Queries in Spatiotemporal Databases. In: Proc. Intl. Conf. on Management of Data (SIGMOD 2004), pp. 623\u2013634 (2004)","DOI":"10.1145\/1007568.1007638"},{"key":"3_CR8","unstructured":"Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: Proc. Intl. Conf. on Data Engineering (ICDE 2005), pp. 643\u2013654 (2005)"},{"key":"3_CR9","unstructured":"Yu, X., Pu, K.Q., Koudas, N.: Mointoring k-Nearest Neighbour Queries over Moving Objects. In: Proc. Intl. Conf. on Data Engineering (ICDE 2005), pp. 631\u2013642 (2005)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proc. Intl. Conf. on Management of Data, Baltimore (SIGMOD 2005), pp. 634\u2013645 (2005)","DOI":"10.1145\/1066157.1066230"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T. Brinkhoff","year":"2002","unstructured":"Brinkhoff, T.: A Framework for Generating Network based Moving Objects. GeoInformatica\u00a06, 153\u2013180 (2002)","journal-title":"GeoInformatica"}],"container-title":["Studies in Computational Intelligence","Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01203-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T23:44:32Z","timestamp":1558136672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01203-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642012020","9783642012037"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01203-7_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}