{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002953},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142451"},{"type":"electronic","value":"9783642142468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14246-8_32","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T14:09:26Z","timestamp":1278425366000},"page":"321-332","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Framework for Processing Continuous Queries on Moving Objects"],"prefix":"10.1007","author":[{"given":"Liang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhinong","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/3-540-46146-9_72","volume-title":"Database and Expert Systems Applications","author":"D.V. Kalashnikov","year":"2002","unstructured":"Kalashnikov, D.V., Prabhakar, S., Hambrusch, S.E.: Efficient Evaluation of Continuous Range Queries on Moving Objects. In: Hameurlain, A., Cicchetti, R., Traunm\u00fcller, R. (eds.) DEXA 2002. LNCS, vol.\u00a02453, pp. 731\u2013740. Springer, Heidelberg (2002)"},{"issue":"10","key":"32_CR2","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TC.2002.1039840","volume":"51","author":"S. Prabhakar","year":"2002","unstructured":"Prabhakar, S., Xia, Y., Kalashnikov, D.V., et al.: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Transactions on Computers\u00a051(10), 1124\u20131140 (2002)","journal-title":"IEEE Transactions on Computers"},{"key":"32_CR3","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. of SIGMOD, pp. 623\u2013634 (2004)","DOI":"10.1145\/1007568.1007638"},{"key":"32_CR4","doi-asserted-by":"crossref","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. of ICDE, pp. 643\u2013654 (2005)","DOI":"10.1145\/1007568.1007638"},{"key":"32_CR5","unstructured":"Yu, X., Pu, K.Q., Koudas, N.: Mointoring k-Nearest Neighbor Queries over Moving Objects. In: Proc. of ICDE, pp. 631\u2013642 (2005)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proc. of SIGMOD, pp. 634\u2013645 (2005)","DOI":"10.1145\/1066157.1066230"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Hu, H., Xu, J., Lee, D.L.: A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects. In: Proc. of SIGMOD, pp. 479\u2013490 (2005)","DOI":"10.1145\/1066157.1066212"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Hsueh, Y.-L., Zimmermann, R., Wang, H., et al.: Partition-Based Lazy Updates for Continuous Queries over Moving Objects. In: Proc. of GIS (2007)","DOI":"10.1145\/1341012.1341060"},{"key":"32_CR9","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: Proc. of VLDB, pp. 43\u201354 (2006)"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00259-9","volume":"181","author":"T. Asano","year":"1997","unstructured":"Asano, T., Ranjan, D., Roos, T., et al.: Space filling curves and their use in the design of geometric data structures. Theoretical Computer Science\u00a0181(1), 3\u201315 (1997)","journal-title":"Theoretical Computer Science"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-02982-0_5","volume-title":"Advances in Spatial and Temporal Databases","author":"U. Demiryurek","year":"2009","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) Advances in Spatial and Temporal Databases. LNCS, vol.\u00a05644, pp. 25\u201343. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14246-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T23:03:35Z","timestamp":1685660615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14246-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142451","9783642142468"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14246-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}