{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:47:18Z","timestamp":1762624038560},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319985299"},{"type":"electronic","value":"9783319985305"}],"license":[{"start":{"date-parts":[[2018,8,28]],"date-time":"2018-08-28T00:00:00Z","timestamp":1535414400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-98530-5_15","type":"book-chapter","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T09:36:48Z","timestamp":1535362608000},"page":"168-181","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Continuous k-Nearest Neighbour Strategies Using the mqrtree"],"prefix":"10.1007","author":[{"given":"Wendy","family":"Osborn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,28]]},"reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.P., Seeger, B.: Efficient processing of spatial joins using R-trees. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD 1993, pp. 237\u2013246. ACM, New York (1993)","DOI":"10.1145\/170035.170075"},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.is.2006.03.002","volume":"32","author":"R Cheng","year":"2007","unstructured":"Cheng, R., Lam, K.Y., Prabhakar, S., Liang, B.: An efficient location update mechanism for continuous queries over moving objects. Inf. Syst. 32(4), 593\u2013620 (2007)","journal-title":"Inf. Syst."},{"issue":"10","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","volume":"24","author":"JH Friedman","year":"1975","unstructured":"Friedman, J.H., Baskett, F., Shustek, L.J.: An algorithm for finding nearest neighbors. IEEE Trans. Comput. 24(10), 1000\u20131006 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"15_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K Fukunage","year":"1975","unstructured":"Fukunage, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput. 24(7), 750\u2013753 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv. 30, 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 577\u2013590. ACM (2009)","DOI":"10.1145\/1559845.1559906"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/s10115-005-0196-7","volume":"8","author":"M Gupta","year":"2005","unstructured":"Gupta, M., Tu, M., Khan, L., Bastani, F., Yen, I.L.: A study of the model and algorithms for handling location-dependent continuous queries. Know. Inf. Syst. 8(4), 414\u2013437 (2005)","journal-title":"Know. Inf. Syst."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: SSD 1995: Proceedings of the 4th International Symposium on Advances in Spatial Databases, pp. 83\u201395. Springer (1995)","DOI":"10.1007\/3-540-60159-7_6"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10707-007-0041-0","volume":"13","author":"YK Huang","year":"2009","unstructured":"Huang, Y.K., Chen, C.C., Lee, C.: Continuous k-nearest neighbor query for moving objects with uncertain velocity. GeoInformatica 13(1), 1\u201325 (2009)","journal-title":"GeoInformatica"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Huang, Y.K., Chen, Z.W., Lee, C.: Continuous k-nearest neighbor query over moving objects in road networks. In: Advances in Data and Web Management, pp. 27\u201338. Springer (2009)","DOI":"10.1007\/978-3-642-00672-2_5"},{"issue":"8","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1016\/j.jss.2011.03.082","volume":"84","author":"S Ilarri","year":"2011","unstructured":"Ilarri, S., Bobed, C., Mena, E.: An approach to process continuous location-dependent queries on moving objects with support for location granules. J. Syst. Softw. 84(8), 1327\u20131350 (2011)","journal-title":"J. Syst. Softw."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1145\/1138394.1138396","volume":"31","author":"GS Iwerks","year":"2006","unstructured":"Iwerks, G.S., Samet, H., Smith, K.P.: Maintenance of k-nn and spatial join queries on continuously moving points. ACM Trans. Database Syst. (TODS) 31(2), 485\u2013536 (2006)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"6","key":"15_CR15","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/TMC.2007.70791","volume":"7","author":"WS Ku","year":"2008","unstructured":"Ku, W.S., Zimmermann, R., Wang, H.: Location-based spatial query processing with data sharing in wireless broadcast environments. IEEE Trans. Mob. Comput. 7(6), 778\u2013791 (2008)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.jss.2005.07.015","volume":"79","author":"KY Lam","year":"2006","unstructured":"Lam, K.Y., Ulusoy, \u00d6.: Adaptive schemes for location update generation in execution location-dependent continuous queries. J. Syst. Softw. 79(4), 441\u2013453 (2006)","journal-title":"J. Syst. Softw."},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s11036-011-0298-2","volume":"17","author":"F Liu","year":"2012","unstructured":"Liu, F., Hua, K.A.: Moving query monitoring in spatial network environments. Mob. Netw. Appl. 17(2), 234\u2013254 (2012)","journal-title":"Mob. Netw. Appl."},{"key":"15_CR18","first-page":"1","volume":"15","author":"M Moreau","year":"2012","unstructured":"Moreau, M., Osborn, W.: mqr-tree: a two-dimensional spatial access method. J. Comput. Sci. Eng. 15, 1\u201312 (2012)","journal-title":"J. Comput. Sci. Eng."},{"issue":"6","key":"15_CR19","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TKDE.2007.190617","volume":"19","author":"K Mouratidis","year":"2007","unstructured":"Mouratidis, K., Papadias, D.: Continuous nearest neighbor queries over sliding windows. IEEE Trans. Knowl. Data Eng. 19(6), 789\u2013803 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Osborn, W.: A k-nearest-neighbour query processing strategy using the mqr-tree. In: Proceedings of the 20th International Conference on Network-Based Information Systems (NBiS 2017), pp. 566\u2013577 (2017)","DOI":"10.1007\/978-3-319-65521-5_49"},{"issue":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. SIGMOD Rec. 24(2), 71\u201379 (1995)","journal-title":"SIGMOD Rec."},{"volume-title":"Location-Based Services","year":"2004","key":"15_CR22","unstructured":"Schiller, J.H., Voisard, A. (eds.): Location-Based Services. Morgan Kaufmann, San Francisco (2004)"},{"issue":"4","key":"15_CR23","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R Sproull","year":"1991","unstructured":"Sproull, R.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(4), 579\u2013589 (1991)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Network-Based Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98530-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T20:51:21Z","timestamp":1571777481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98530-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,28]]},"ISBN":["9783319985299","9783319985305"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98530-5_15","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2018,8,28]]}}}