{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:00:23Z","timestamp":1757311223119},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_22","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:15:32Z","timestamp":1182802532000},"page":"188-199","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Algorithms for Historical Continuous kNN Query Processing over Moving Object Trajectories"],"prefix":"10.1007","author":[{"given":"Yunjun","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gencai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: IDEAS, pp. 44\u201353 (2002)","DOI":"10.1109\/IDEAS.2002.1029655"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: SIGMOD, pp. 189\u2013200 (2000)","DOI":"10.1145\/342009.335414"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/11535331_19","volume-title":"Advances in Spatial and Temporal Databases","author":"E. Frentzos","year":"2005","unstructured":"Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Nearest Neighbor Search on Moving Object Trajectories. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 328\u2013345. Springer, Heidelberg (2005)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. ACM TODS\u00a024, 265\u2013318 (1999)","journal-title":"ACM TODS"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Iwerks, G.S., Samet, H., Smith, K.: Continuous k-Nearest Neighbor Queries for Continuously Moving Points with Updates. In: VLDB, pp. 512\u2013523 (2003)","DOI":"10.1016\/B978-012722442-8\/50052-5"},{"key":"22_CR7","volume-title":"R-trees: theory and applications","author":"Y. Manolopoulos","year":"2005","unstructured":"Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-trees: theory and applications. Springer, Heidelberg (2005)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: SIGMOD, pp. 634\u2013645 (2005)","DOI":"10.1145\/1066157.1066230"},{"key":"22_CR9","first-page":"1451","volume":"17","author":"K. Mouratidis","year":"2005","unstructured":"Mouratidis, K., Papadias, D., Bakiras, S., Tao, Y.: A Threshold-based Algorithm for Continuous Monitoring of k Nearest Neighbors. TKDE\u00a017, 1451\u20131464 (2005)","journal-title":"TKDE"},{"key":"22_CR10","unstructured":"Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches in Query Processing for Moving Object Trajectories. In: VLDB, pp. 395\u2013406 (2000)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"22_CR12","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":"22_CR13","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: VLDB, pp. 287\u2013298 (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D.: Time Parameterized Queries in Spatio-Temporal Databases. In: SIGMOD, pp. 334\u2013345 (2002)","DOI":"10.1145\/564691.564730"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-48482-5_11","volume-title":"Advances in Spatial Databases","author":"Y. Theodoridis","year":"1999","unstructured":"Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: G\u00fcting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol.\u00a01651, pp. 147\u2013164. Springer, Heidelberg (1999)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Vazirgiannis, M., Sellis, T.K.: Spatio-Temporal Indexing for Large Multimedia Applications. In: ICMCS, pp. 441\u2013448 (1996)","DOI":"10.1109\/MMCS.1996.535011"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Xiong, X., Mokbel, M., Aref, W.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: ICDE, pp. 643\u2013654 (2005)","DOI":"10.1145\/1007568.1007638"},{"key":"22_CR18","unstructured":"Yu, X., Pu, K., Koudas, N.: Monitoring k-Nearest Neighbor Queries Over Moving Objects. In: ICDE, pp. 631\u2013642 (2005)"},{"key":"22_CR19","first-page":"232","volume":"22","author":"Y. Gao","year":"2007","unstructured":"Gao, Y., Li, C., Chen, G., Chen, L., Jiang, X., Chen, C.: Efficient k-Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories. JCST\u00a022, 232\u2013244 (2007)","journal-title":"JCST"}],"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_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T16:59:44Z","timestamp":1683910784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72524-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540724834","9783540725244"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72524-4_22","relation":{},"subject":[]}}