{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:30:47Z","timestamp":1742923847378,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_11","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T18:42:08Z","timestamp":1302288128000},"page":"134-148","source":"Crossref","is-referenced-by-count":2,"title":["wNeighbors: A Method for Finding k Nearest Neighbors in Weighted Regions"],"prefix":"10.1007","author":[{"given":"Chuanwen","family":"Li","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Fangfang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD Record\u00a019(2), 322\u2013331 (1990)","journal-title":"ACM SIGMOD Record"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X., Yu, J.X.: Monitoring path nearest neighbor in road networks. In: SigMod (2009)","DOI":"10.1145\/1559845.1559907"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"11_CR4","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"},{"issue":"9","key":"11_CR5","first-page":"1314","volume":"21","author":"Y. Gao","year":"2009","unstructured":"Gao, Y., Zheng, B., Chen, G., Lee, W.-C., Lee, K.C., Li, Q.: Visible reverse k-nearest neighbor query processing in spatial databases. TKDE\u00a021(9), 1314\u20131327 (2009)","journal-title":"TKDE"},{"key":"11_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"},{"key":"11_CR7","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":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/282918.282923","volume":"4","author":"L. Guibas","year":"1985","unstructured":"Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi. ACM Transactions on Graphics (TOG)\u00a04(2), 123 (1985)","journal-title":"ACM Transactions on Graphics (TOG)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-60159-7_6","volume-title":"Advances in Spatial Databases","author":"G. Hjaltason","year":"1995","unstructured":"Hjaltason, G., Samet, H.: Ranking in spatial databases. In: Advances in Spatial Databases, pp. 83\u201395. Springer, Heidelberg (1995)"},{"key":"11_CR10","unstructured":"Hu, H., Lee, D., Lee, V.: Distance indexing on road networks. In: Proceedings of the 32nd International Conference on Very Large Data Bases, p. 905, VLDB Endowment (2006)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H. Jagadish","year":"2005","unstructured":"Jagadish, H., Ooi, B., Tan, K., Yu, C., Zhang, R.: iDistance: An adaptive B-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS 2005)\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Transactions on Database Systems (TODS 2005)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Li, C., Gu, Y., Li, F., Chen, M.: Moving k-nearest neighbor query over obstructed regions. In: APWeb, Pusan, Korea (2010)","DOI":"10.1109\/APWeb.2010.28"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J. Mitchell","year":"1991","unstructured":"Mitchell, J., Papadimitriou, C.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM (JACM)\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM (JACM)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: The v*diagram: A query dependent approach to moving knn queries. In: VLDB, pp. 1095\u20131106 (2008)","DOI":"10.14778\/1453856.1453973"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/opre.38.3.426","volume":"38","author":"N. Papadakis","year":"1990","unstructured":"Papadakis, N., Perakis, A.: Deterministic minimal time vessel routing. Operations Research\u00a038(3), 426\u2013438 (1990)","journal-title":"Operations Research"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proceedings of the 29th International Conference on Very Large Data Bases, vol.\u00a029, pp. 802\u2013813, VLDB Endowment (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"11_CR17","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":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-24741-8_22","volume-title":"Advances in Database Technology - EDBT 2004","author":"J. Zhang","year":"2004","unstructured":"Zhang, J., Papadias, D., Mouratidis, K., Zhu, M.: Spatial queries in the presence of obstacles. In: Hwang, J., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 366\u2013384. Springer, Heidelberg (2004)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: SIGMOD, pp. 443\u2013454 (2003)","DOI":"10.1145\/872811.872812"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:48:21Z","timestamp":1558554501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20152-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201516","9783642201523"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20152-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}