{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:48:31Z","timestamp":1742971711022,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201516"},{"type":"electronic","value":"9783642201523"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20152-3_9","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T22:42:08Z","timestamp":1302302528000},"page":"104-118","source":"Crossref","is-referenced-by-count":1,"title":["A Unified Algorithm for Continuous Monitoring of Spatial Queries"],"prefix":"10.1007","author":[{"given":"Mahady","family":"Hasan","sequence":"first","affiliation":[]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-00202-1_7","volume-title":"WALCOM: Algorithms and Computation","author":"S.W. Bae","year":"2009","unstructured":"Bae, S.W., Korman, M., Tokuyama, T.: All farthest neighbors in the presence of highways and obstacles. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 71\u201382. Springer, Heidelberg (2009)"},{"issue":"2","key":"9_CR2","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"},{"doi-asserted-by":"crossref","unstructured":"Cheema, M.A., Brankovic, L., Lin, X., Zhang, W., Wang, W.: Multi-guarded safe zone: An effective technique to monitor moving circular range queries. In: ICDE, pp. 189\u2013200 (2010)","key":"9_CR3","DOI":"10.1109\/ICDE.2010.5447864"},{"issue":"1","key":"9_CR4","first-page":"1138","volume":"2","author":"M.A. Cheema","year":"2009","unstructured":"Cheema, M.A., Lin, X., Zhang, Y., Wang, W., Zhang, W.: Lazy updates: An efficient technique to continuously monitoring reverse knn. VLDB\u00a02(1), 1138\u20131149 (2009)","journal-title":"VLDB"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/978-3-540-71703-4_71","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"M.A. Cheema","year":"2007","unstructured":"Cheema, M.A., Yuan, Y., Lin, X.: CircularTrip: An effective algorithm for continuous kNN queries. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol.\u00a04443, pp. 863\u2013869. Springer, Heidelberg (2007)"},{"issue":"10","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1016\/S0031-3203(98)00002-8","volume":"31","author":"Z. Chen","year":"1998","unstructured":"Chen, Z., Ness, J.W.V.: Characterizations of nearest and farthest neighbor algorithms by clustering admissibility conditions. Pattern Recognition\u00a031(10), 1573\u20131578 (1998)","journal-title":"Pattern Recognition"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-47724-1_14","volume-title":"Advances in Spatial and Temporal Databases","author":"H. Ferhatosmanoglu","year":"2001","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D.P., Abbadi, A.E.: Constrained nearest neighbor queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 257\u2013278. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Gedik, B., Liu, L.: Mobieyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In: EDBT, pp. 67\u201387 (2004)","key":"9_CR8","DOI":"10.1007\/978-3-540-24741-8_6"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-12026-8_19","volume-title":"Database Systems for Advanced Applications","author":"M. Hasan","year":"2010","unstructured":"Hasan, M., Cheema, M.A., Qu, W., Lin, X.: Efficient algorithms to monitor continuous constrained k nearest neighbor queries. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol.\u00a05981, pp. 233\u2013249. Springer, Heidelberg (2010)"},{"unstructured":"Henrich, A.: A distance scan algorithm for spatial access structures. In: ACM-GIS, pp. 136\u2013143 (1994)","key":"9_CR10"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-60159-7_6","volume-title":"Advances in Spatial Databases","author":"G.R. Hjaltason","year":"1995","unstructured":"Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol.\u00a0951, pp. 83\u201395. Springer, Heidelberg (1995)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-45876-X_18","volume-title":"Advances in Database Technology - EDBT 2002","author":"I. Lazaridis","year":"2002","unstructured":"Lazaridis, I., Porkaew, K., Mehrotra, S.: Dynamic queries over mobile objects. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Hwang, J., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 269\u2013286. Springer, Heidelberg (2002)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/978-3-540-74484-9_70","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"Y. Luo","year":"2007","unstructured":"Luo, Y., Chen, H., Furuse, K., Ohbo, N.: Efficient methods in finding aggregate nearest neighbor by projection-based filtering. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol.\u00a04707, pp. 821\u2013833. Springer, Heidelberg (2007)"},{"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)","key":"9_CR14","DOI":"10.1145\/1066157.1066230"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst.\u00a030(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","key":"9_CR16","DOI":"10.1145\/568271.223794"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(89)90045-7","volume":"39","author":"S. Suri","year":"1989","unstructured":"Suri, S.: Computing geodesic furthest neighbors in simple polygons. J. Comput. Syst. Sci.\u00a039(2), 220\u2013235 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1109\/TKDE.2006.176","volume":"18","author":"K.L. Wu","year":"2006","unstructured":"Wu, K.L., Chen, S.K., Yu, P.S.: Incremental processing of continual range queries over moving objects. IEEE Trans. Knowl. Data Eng.\u00a018(11), 1560\u20131575 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Wu, W., Tan, K.L.: isee: Efficient continuous k-nearest-neighbor monitoring over moving objects. In: SSDBM, p. 36 (2007)","key":"9_CR19","DOI":"10.1109\/SSDBM.2007.37"},{"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)","key":"9_CR20","DOI":"10.1145\/1007568.1007638"},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"M.L. Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE Trans. Knowl. Data Eng.\u00a017(6), 820\u2013833 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"unstructured":"Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631\u2013642 (2005)","key":"9_CR22"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20152-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T06:36:06Z","timestamp":1686033366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20152-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201516","9783642201523"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20152-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}