{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:43Z","timestamp":1761621043653,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T00:00:00Z","timestamp":1281398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00778-010-0200-z","type":"journal-article","created":{"date-parts":[[2010,8,9]],"date-time":"2010-08-09T07:01:45Z","timestamp":1281337305000},"page":"371-396","source":"Crossref","is-referenced-by-count":31,"title":["Continuous visible nearest neighbor query processing in spatial databases"],"prefix":"10.1007","volume":"20","author":[{"given":"Yunjun","family":"Gao","sequence":"first","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Gencai","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaofa","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,10]]},"reference":[{"key":"200_CR1","doi-asserted-by":"crossref","unstructured":"Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: SSTD, pp. 79\u201396 (2001)","DOI":"10.1007\/3-540-47724-1_5"},{"key":"200_CR2","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\/564728.564730"},{"key":"200_CR3","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":"200_CR4","doi-asserted-by":"crossref","unstructured":"Nutanong, S., Tanin, E., Zhang, R.: Visible nearest neighbor queries. In: DASFAA, pp. 876\u2013883 (2007)","DOI":"10.1007\/978-3-540-71703-4_73"},{"issue":"5","key":"200_CR5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TKDE.2009.158","volume":"22","author":"S. Nutanong","year":"2010","unstructured":"Nutanong S., Tanin E., Zhang R.: Incremental evaluation of visible nearest neighbor queries. IEEE Trans. Knowl. Data Eng. 22(5), 665\u2013681 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"200_CR6","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B., Chen, G., Lee, W.C., Lee, K.C.K., Li, Q.: Visible reverse k-nearest neighbor queries. In: ICDE, pp. 1203\u20131206 (2009)","DOI":"10.1109\/ICDE.2009.201"},{"issue":"9","key":"200_CR7","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1109\/TKDE.2009.113","volume":"21","author":"Y. Gao","year":"2009","unstructured":"Gao Y., Zheng B., Chen G., Lee W.C., Lee K.C.K., Li Q.: Visible reverse k-nearest neighbor query processing in spatial databases. IEEE Trans. Knowl. Data Eng. 21(9), 1314\u20131327 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"200_CR8","doi-asserted-by":"crossref","unstructured":"Xia, C., Hsu, D., Tung, A.K.H.: A fast filter for obstructed nearest neighbor queries. In: BNCOD, pp. 203\u2013215 (2004)","DOI":"10.1007\/978-3-540-27811-5_19"},{"key":"200_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, J., Papadias, D., Mouratidis, K., Zhu, M.: Spatial queries in the presence of obstacles. In: EDBT, pp. 366\u2013384 (2004)","DOI":"10.1007\/978-3-540-24741-8_22"},{"key":"200_CR10","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp. 577\u2013590 (2009)","DOI":"10.1145\/1559845.1559906"},{"key":"200_CR11","doi-asserted-by":"crossref","unstructured":"Estivill-Castro, V., Lee, I.: Autoclust+: Automatic clustering of point-data sets in the presence of obstacles. In: TSDM, pp. 133\u2013146 (2000)","DOI":"10.1007\/3-540-45244-3_11"},{"key":"200_CR12","doi-asserted-by":"crossref","unstructured":"Park, S.H., Lee, J.H., Kim, D.H.: Spatial clustering based on moving distance in the presence of obstacles. In: DASFAA, pp. 1024\u20131027 (2007)","DOI":"10.1007\/978-3-540-71703-4_96"},{"key":"200_CR13","doi-asserted-by":"crossref","unstructured":"Tung, A.K.H., Hou, J., Han, J.: Spatial clustering in the presence of obstacles. In: ICDE, pp. 359\u2013367 (2001)","DOI":"10.1109\/ICDE.2001.914848"},{"issue":"1\u20132","key":"200_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1142\/S0218213005002053","volume":"14","author":"X. Wang","year":"2005","unstructured":"Wang X., Hamilto H.J.: Clustering spatial data in the presence of obstacles. Int. J. Artif. Intell. Tools 14(1\u20132), 177\u2013198 (2005)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"200_CR15","doi-asserted-by":"crossref","unstructured":"Wang, X., Rostoker, C., Hamilton, H.J.: Density-based spatial clustering in the presence of obstacles and facilitators. In: PKDD, pp. 446\u2013458 (2004)","DOI":"10.1007\/978-3-540-30116-5_41"},{"key":"200_CR16","doi-asserted-by":"crossref","unstructured":"Zaiane, O.R., Lee, C.H.: Clustering spatial data in the presence of obstacles: A density-based approach. In: IDEAS, pp. 214\u2013223 (2002)","DOI":"10.1109\/IDEAS.2002.1029674"},{"issue":"4","key":"200_CR17","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M. Sharifzadeh","year":"2008","unstructured":"Sharifzadeh M., Kolahdouzan M., Shahabi C.: The optimal sequenced route query. VLDB J. 17(4), 765\u2013787 (2008)","journal-title":"VLDB J."},{"issue":"4","key":"200_CR18","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10707-007-0034-z","volume":"12","author":"M. Sharifzadeh","year":"2008","unstructured":"Sharifzadeh M., Shahabi C.: Processing optimal sequenced route queries using voronoi diagrams. GeoInformatica 12(4), 411\u2013433 (2008)","journal-title":"GeoInformatica"},{"key":"200_CR19","doi-asserted-by":"crossref","unstructured":"Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.H.: On trip planning queries in spatial databases. In: SSTD, pp. 273\u2013290 (2005)","DOI":"10.1007\/11535331_16"},{"key":"200_CR20","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":"200_CR21","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201354 (1984)","DOI":"10.1145\/971697.602266"},{"key":"200_CR22","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B., Lee, W.C., Chen, G.: Continuous visible nearest neighbor queries. In: EDBT, pp. 144\u2013155 (2009)","DOI":"10.1145\/1516360.1516378"},{"issue":"3","key":"200_CR23","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"Cheung K.L., Fu A.W.C.: Enhanced nearest neighbour search on the R-tree. SIGMOD Rec. 27(3), 16\u201321 (1998)","journal-title":"SIGMOD Rec."},{"key":"200_CR24","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"200_CR25","doi-asserted-by":"crossref","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in R-trees. In: ICDT, pp. 394\u2013408 (1997)","DOI":"10.1007\/3-540-62222-5_59"},{"key":"200_CR26","unstructured":"Henrich, A.: A distance-scan algorithm for spatial access structures. In: GIS, pp. 136\u2013143 (1994)"},{"issue":"2","key":"200_CR27","doi-asserted-by":"crossref","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 Trans. Database Syst. 24(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"200_CR28","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.: Constrained nearest neighbor queries. In: SSTD, pp. 257\u2013278 (2001)","DOI":"10.1007\/3-540-47724-1_14"},{"key":"200_CR29","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, pp. 301\u2013312 (2004)"},{"issue":"2","key":"200_CR30","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias D., Tao Y., Mouratidis K., Hui K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"200_CR31","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest- neighbors queries in spatial databases. In: SSDBM, pp. 297\u2013306 (2004)"},{"key":"200_CR32","doi-asserted-by":"crossref","unstructured":"Deng, K., Zhou, X., Shen, H., Xu, K., Lin, X.: Surface k-NN query processing. In: ICDE, p. 78 (2006)","DOI":"10.1109\/ICDE.2006.152"},{"issue":"1","key":"200_CR33","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TKDE.2006.15","volume":"18","author":"H. Hu","year":"2006","unstructured":"Hu H., Lee D.L.: Range nearest-neighbor query. IEEE Trans. Knowl. Data Eng. 18(1), 78\u201391 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"200_CR34","unstructured":"Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: ICDE, pp. 422\u2013432 (1997)"},{"key":"200_CR35","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":"200_CR36","unstructured":"Li, Y., Yang, J., Han, J.: Continuous k-nearest neighbor search for moving objects. In: SSDBM, pp. 123\u2013126 (2004)"},{"key":"200_CR37","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":"200_CR38","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":"200_CR39","unstructured":"Yu, X., Pu, K., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631\u2013642 (2005)"},{"key":"200_CR40","doi-asserted-by":"crossref","unstructured":"Liu, F., Hua, K.A., Do, T.T.: A P2P technique for continuous k-nearest-neighbor query in road networks. In: DEXA, pp. 264\u2013276 (2007)","DOI":"10.1007\/978-3-540-74469-6_27"},{"key":"200_CR41","unstructured":"Mouratidis, K., Yiu, M., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: VLDB, pp. 43\u201354 (2006)"},{"issue":"11","key":"200_CR42","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1109\/TKDE.2005.172","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. IEEE Transactions on Knowledge and Data Engineering 17(11), 1451\u20131464 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"200_CR43","doi-asserted-by":"crossref","unstructured":"Wu, W., Guo, W., Tan, K.L.: Distributed processing of moving k-nearest-neighbor query on moving objects. In: ICDE, pp. 1116\u20131125 (2007)","DOI":"10.1109\/ICDE.2007.368970"},{"issue":"7","key":"200_CR44","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TMC.2007.1004","volume":"6","author":"B. Zheng","year":"2007","unstructured":"Zheng B., Lee W.C., Lee D.L.: On searching continuous k nearest neighbors in wireless data broadcast systems. IEEE Trans. Mob. Comput. 6(7), 748\u2013761 (2007)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"200_CR45","unstructured":"Feng, J., Watanabe, T.: A fast method for continuous nearest target objects query on road network. In: VSMM, pp. 182\u2013191 (2002)"},{"issue":"4","key":"200_CR46","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10707-005-4575-8","volume":"9","author":"M.R. Kolahdouzan","year":"2005","unstructured":"Kolahdouzan M.R., Shahabi C.: Alternative solutions for continuous k nearest neighbor queries in spatial network databases. GeoInformatica 9(4), 321\u2013341 (2005)","journal-title":"GeoInformatica"},{"key":"200_CR47","unstructured":"Cho, H.J., Chung, C.W.: An efficient and scalable approach to CNN queries in a road network. In: VLDB, pp. 865\u2013876 (2005)"},{"key":"200_CR48","doi-asserted-by":"crossref","unstructured":"Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Handbook of Computation Geometry. Elsevier, Amsterdam (2000)","DOI":"10.1016\/B978-044482537-7\/50020-6"},{"issue":"3","key":"200_CR49","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/1099-1778(200007)11:3<129::AID-VIS227>3.0.CO;2-T","volume":"11","author":"M. Kofler","year":"2000","unstructured":"Kofler M., Gervautz M., Gruber M.: R-trees for organizing and visualizing 3D GIS databases. J. Vis. Comput. Animat. 11(3), 129\u2013143 (2000)","journal-title":"J. Vis. Comput. Animat."},{"key":"200_CR50","unstructured":"Shou, L., Chionh, C., Ruan, Y., Huang, Z., Tan, K.L.: Walking through a very large virtual environment in real-time. In: VLDB, pp. 401\u2013410 (2001)"},{"key":"200_CR51","doi-asserted-by":"crossref","unstructured":"Shou, L., Huang, Z., Tan, K.L.: HDoV-tree: The structure, the storage, the speed. In: ICDE, pp. 557\u2013568 (2003)","DOI":"10.1109\/ICDE.2003.1260821"},{"issue":"3","key":"200_CR52","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00778-005-0168-2","volume":"16","author":"Y. Tao","year":"2007","unstructured":"Tao Y., Papadias D., Lian X., Xiao X.: Multidimensional reverse kNN search. VLDB J. 16(3), 293\u2013316 (2007)","journal-title":"VLDB J."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0200-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-010-0200-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0200-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:30:37Z","timestamp":1740353437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-010-0200-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,10]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s00778-010-0200-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2010,8,10]]}}}