{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:06:14Z","timestamp":1743026774296,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029813"},{"type":"electronic","value":"9783642029820"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-02982-0_24","type":"book-chapter","created":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T05:31:51Z","timestamp":1246253511000},"page":"373-379","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets"],"prefix":"10.1007","author":[{"given":"Mahady","family":"Hasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: SIGMOD Conference, pp. 634\u2013645 (2005)","DOI":"10.1145\/1066157.1066230"},{"key":"24_CR2","unstructured":"Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631\u2013642 (2005)"},{"key":"24_CR3","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: ICDE, pp. 643\u2013654 (2005)","DOI":"10.1145\/1007568.1007638"},{"key":"24_CR4","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":"24_CR5","volume-title":"Spatial tessellations: concepts and applications of Voronoi diagrams","author":"A. Okabe","year":"1992","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial tessellations: concepts and applications of Voronoi diagrams. John Wiley and Sons Inc., Chichester (1992)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: SIGMOD Conference, pp. 443\u2013454 (2003)","DOI":"10.1145\/872757.872812"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. In: SIGMOD Conference, pp. 334\u2013345 (2002)","DOI":"10.1145\/564691.564730"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: SSD, pp. 83\u201395 (1995)","DOI":"10.1007\/3-540-60159-7_6"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11863939_17","volume-title":"Geographic Information Science","author":"L. Kulik","year":"2006","unstructured":"Kulik, L., Tanin, E.: Incremental rank updates for moving query points. In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol.\u00a04197, pp. 251\u2013268. Springer, Heidelberg (2006)"},{"key":"24_CR10","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)"},{"issue":"1","key":"24_CR11","first-page":"1095","volume":"1","author":"S. Nutanong","year":"2008","unstructured":"Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: The v*-diagram: a query-dependent approach to moving knn queries. PVLDB\u00a01(1), 1095\u20131106 (2008)","journal-title":"PVLDB"},{"issue":"2","key":"24_CR12","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(2), 153\u2013180 (2002)","journal-title":"GeoInformatica"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02982-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T20:43:30Z","timestamp":1685047410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02982-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029813","9783642029820"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02982-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}