{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T11:44:03Z","timestamp":1773834243063,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,11,12]],"date-time":"2014-11-12T00:00:00Z","timestamp":1415750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10115-014-0803-6","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T20:05:48Z","timestamp":1415995548000},"page":"417-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A safe region based approach to moving KNN queries in obstructed space"],"prefix":"10.1007","volume":"45","author":[{"given":"Chuanwen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,12]]},"reference":[{"issue":"2","key":"803_CR1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD Record 19(2):322\u2013331","journal-title":"SIGMOD Record"},{"issue":"3","key":"803_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00778-005-0166-4","volume":"15","author":"R Benetis","year":"2006","unstructured":"Benetis R, Jensen S, Kar\u010diauskas G, \u010daltenis S (2006) Nearest and reverse nearest neighbor queries for moving objects. VLDB J 15(3):229\u2013249","journal-title":"VLDB J"},{"issue":"1","key":"803_CR3","first-page":"1138","volume":"2","author":"MA Cheema","year":"2009","unstructured":"Cheema MA, Lin X, Zhang Y, Wang W, Zhang W (2009) Lazy updates: an efficient technique to continuously monitoring reverse knn. PVLDB 2(1):1138\u20131149","journal-title":"PVLDB"},{"issue":"1\u20134","key":"803_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"LP Chew","year":"1989","unstructured":"Chew LP (1989) Constrained delaunay triangulations. Algorithmica 4(1\u20134):97\u2013108","journal-title":"Algorithmica"},{"issue":"3","key":"803_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0925-7721(02)00112-8","volume":"24","author":"M Berg De","year":"2003","unstructured":"De Berg M, Gudmundsson J, Hammar M, Overmars M (2003) On r-trees with low query complexity. Comput Geom 24(3):179\u2013195","journal-title":"Comput Geom"},{"key":"803_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"M Berg De","year":"2008","unstructured":"De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications. Springer, Berlin"},{"key":"803_CR7","doi-asserted-by":"crossref","unstructured":"Dijkstra E (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269\u2013271","DOI":"10.1007\/BF01386390"},{"key":"803_CR8","unstructured":"Eunus Ali M, Zhang R, Tanin E, Kulik L (2008) A motion-aware approach to continuous retrieval of 3d objects. In: ICDE, pp 843\u2013852"},{"key":"803_CR9","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B (2009) Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp 577\u2013590","DOI":"10.1145\/1559845.1559906"},{"key":"803_CR10","doi-asserted-by":"crossref","unstructured":"Gao Y, Yang J, Chen G, Zheng B, Chen C (2011) On efficient obstructed reverse nearest neighbor query processing. In: ACM SIGSPATIAL, pp 191\u2013200","DOI":"10.1145\/2093973.2094000"},{"key":"803_CR11","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B, Chen G, Li Q, Guo X (2011) Continuous visible nearest neighbor query processing in spatial databases. VLDB J 20(3):371\u2013396","DOI":"10.1007\/s00778-010-0200-z"},{"key":"803_CR12","doi-asserted-by":"crossref","unstructured":"Hsueh YL, Zimmermann R, Wang H, Ku WS (2007) Partition-based lazy updates for continuous queries over moving objects. In: GIS, pp 1\u20138","DOI":"10.1145\/1341012.1341060"},{"key":"803_CR13","doi-asserted-by":"crossref","unstructured":"Hu H, Xu J, Lee DL (2005) A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD, pp 479\u2013490","DOI":"10.1145\/1066157.1066212"},{"issue":"2","key":"803_CR14","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan K, Yu C, Zhang R (2005) idistance: an adaptive b $${}^{{+}}$$ + -tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364\u2013397","journal-title":"ACM Trans Database Syst"},{"key":"803_CR15","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search for spatial network databases. In: Very Large Data Bases, pp 840\u2013851","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"803_CR16","doi-asserted-by":"crossref","unstructured":"Li C, Gu Y, Li F, Chen M (2010) Moving k-nearest neighbor query over obstructed regions. In: Asia-Pacific Web Conference, pp 29\u201335","DOI":"10.1109\/APWeb.2010.28"},{"key":"803_CR17","doi-asserted-by":"crossref","unstructured":"Li C, Gu Y, Yu G, Li F (2011) wneighbors: a method for finding k nearest neighbors in weighted regions. In: DASFAA, Springer, pp 134\u2013148","DOI":"10.1007\/978-3-642-20152-3_11"},{"issue":"2","key":"803_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.14778\/2735471.2735473","volume":"8","author":"C Li","year":"2014","unstructured":"Li C, Gu Y, Qi J, Yu G, Zhang R, Yi W (2014) Processing moving knn queries using influential neighbor sets. Proc VLDB Endow 8(2):113\u2013124","journal-title":"Proc VLDB Endow"},{"issue":"5","key":"803_CR19","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1007\/s00778-007-0046-1","volume":"17","author":"MF Mokbel","year":"2008","unstructured":"Mokbel MF, Aref WG (2008) Sole: scalable on-line execution of continuous queries on spatio-temporal data streams. VLDB J 17(5):971\u2013995","journal-title":"VLDB J"},{"key":"803_CR20","doi-asserted-by":"crossref","unstructured":"Mokbel MF, Xiong X, Aref WG (2004) Sina: scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD, pp 623\u2013634","DOI":"10.1145\/1007568.1007638"},{"key":"803_CR21","first-page":"1451","volume":"17","author":"K Mouratidis","year":"2005","unstructured":"Mouratidis K, Papadias D, Bakiras S, Tao Y (2005) A threshold-based algorithm for continuous monitoring of k nearest neighbors. TKDE 17:1451\u20131464","journal-title":"TKDE"},{"key":"803_CR22","doi-asserted-by":"crossref","unstructured":"Nutanong S, Zhang R, Tanin E, Kulik L (2008) The v*diagram: a query dependent approach to moving knn queries. In: Very Large Data Bases, pp 1095\u20131106","DOI":"10.14778\/1453856.1453973"},{"key":"803_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","volume-title":"Spatial tessellations","author":"A Okabe","year":"2000","unstructured":"Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations. Wiley, NY"},{"key":"803_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F Preparata","year":"1985","unstructured":"Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin"},{"key":"803_CR25","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: SSTD, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"803_CR26","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D (2002) Time-parameterized queries in spatio-temporal databases. In: SIGMOD, pp 334\u2013345","DOI":"10.1145\/564691.564730"},{"key":"803_CR27","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Very Large Data Bases, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"803_CR28","doi-asserted-by":"crossref","unstructured":"\u0160altenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. In: SIGMOD, pp 331\u2013342","DOI":"10.1145\/342009.335427"},{"key":"803_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.is.2014.02.003","volume":"44","author":"Y Wang","year":"2014","unstructured":"Wang Y, Zhang R, Xu C, Qi J, Gu Y, Yu G (2014) Continuous visible k nearest neighbor query on moving objects. Inf Syst 44:1\u201321","journal-title":"Inf Syst"},{"key":"803_CR30","doi-asserted-by":"crossref","unstructured":"Ward PG, He Z, Zhang R, Qi J (2014) Real-time continuous intersection joins over large sets of moving objects using graphic processing units. The VLDB J, 1\u201321","DOI":"10.1007\/s00778-014-0358-x"},{"key":"803_CR31","doi-asserted-by":"crossref","unstructured":"Xia C, Hsu D, Tung AK (2004) A fast filter for obstructed nearest neighbor queries. In: Williams H, MacKinnon L (eds) Key Technologies for Data Management, Springer, pp 203\u2013215","DOI":"10.1007\/978-3-540-27811-5_19"},{"key":"803_CR32","unstructured":"Xia T, Zhang D (2006) Continuous reverse nearest neighbor monitoring. In: ICDE, pp 77\u201386"},{"key":"803_CR33","unstructured":"Xiong X, Mokbel MF, Aref WG (2005) Sea-cnn: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp 643\u2013654"},{"key":"803_CR34","unstructured":"Yu X, Pu KQ, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp 631\u2013642"},{"key":"803_CR35","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based spatial queries. In: SIGMOD, pp 443\u2013454","DOI":"10.1145\/872757.872812"},{"key":"803_CR36","doi-asserted-by":"crossref","unstructured":"Zhang J, Papadias D, Mouratidis K, Zhu M (2004) Spatial queries in the presence of obstacles. In: International conference on extending database technology, pp 366\u2013384","DOI":"10.1007\/978-3-540-24741-8_22"},{"issue":"8","key":"803_CR37","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.is.2010.05.004","volume":"35","author":"R Zhang","year":"2010","unstructured":"Zhang R, Jagadish HV, Dai BT, Ramamohanarao K (2010) Optimized algorithms for predictive range and knn queries on moving objects. Inf Syst 35(8):911\u2013932","journal-title":"Inf Syst"},{"issue":"4","key":"803_CR38","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s00778-011-0259-1","volume":"21","author":"R Zhang","year":"2012","unstructured":"Zhang R, Qi J, Lin D, Wang W, Wong RCW (2012) A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB J 21(4):561\u2013586","journal-title":"VLDB J"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0803-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0803-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0803-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:11:16Z","timestamp":1559124676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0803-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,12]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["803"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0803-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,12]]}}}