{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:33Z","timestamp":1725490233717},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74581-5_49","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T08:20:21Z","timestamp":1188030021000},"page":"444-453","source":"Crossref","is-referenced-by-count":0,"title":["Continuous K-Nearest Neighbor Queries for Moving Objects"],"prefix":"10.1007","author":[{"given":"Hui","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingquan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghong","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","volume-title":"ACM SIGMOD","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangle. In: ACM SIGMOD, ACM Press, New York (1990)"},{"key":"49_CR2","unstructured":"Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: Proceedings of the International Conference on Data Engineering, pp. 422\u2013432 (1997)"},{"key":"49_CR3","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":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-47724-1_6","volume-title":"Advances in Spatial and Temporal Databases","author":"B. Zheng","year":"2001","unstructured":"Zheng, B., Lee, D.: Semantic caching in location-dependent query processing. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 97\u2013116. Springer, Heidelberg (2001)"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-48344-6_7","volume-title":"Spatio-Temporal Database Management","author":"G. Kollios","year":"1999","unstructured":"Kollios, G., Gunopulos, D., Tsotras, V.J.: Nearest neighbor queries in a mobile environment. In: B\u00f6hlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol.\u00a01678, pp. 119\u2013134. Springer, Heidelberg (1999)"},{"key":"49_CR6","first-page":"334","volume-title":"Proceedings ACM SIGMOD Conference","author":"Y. Tao","year":"2002","unstructured":"Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. In: Proceedings ACM SIGMOD Conference, pp. 334\u2013345. ACM Press, New York (2002)"},{"key":"49_CR7","volume-title":"Proceedings of ACM SIGMOD","author":"N. Roussopoulos","year":"1995","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proceedings of ACM SIGMOD, ACM Press, New York (1995)"},{"issue":"3","key":"49_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, A.: Enhanced Nearest Neighbor Search on the R-tree. SIGMOD Record\u00a027(3), 16\u201321 (1998)","journal-title":"SIGMOD Record"},{"key":"49_CR9","volume-title":"ACM SIGMOD","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD, ACM Press, New York (1984)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: Proc. Int\u2019l Symp. Database Eng. & Applications, pp. 44\u201353 (2002)","DOI":"10.1109\/IDEAS.2002.1029655"},{"key":"49_CR11","unstructured":"Xiong, X., Mokbel, M.F., Aref, W.G., Hambrusch, S.E., Prabhakar, S.: Scalable Spatio-Temporal Continuous Query Processing for Location-Aware Services. In: Proc. 16th Int\u2019l Conf. Scientific and Statistical Database Management, pp. 317\u2013326 (2004)"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","first-page":"287","volume-title":"Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web","author":"Y. Tao","year":"2003","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol.\u00a02590, pp. 287\u2013298. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computation and Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74581-5_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:26:13Z","timestamp":1619519173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74581-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745808"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74581-5_49","relation":{},"subject":[]}}