{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:07:30Z","timestamp":1761394050839,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,12]]},"DOI":"10.1145\/1989323.1989361","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"349-360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":107,"title":["Reverse spatial and textual k nearest neighbor search"],"prefix":"10.1145","author":[{"given":"Jiaheng","family":"Lu","sequence":"first","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Ying","family":"Lu","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183731"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142531"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516462"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/125187.125200"},{"issue":"1","key":"e_1_3_2_1_5_1","first-page":"373","article-title":"Retrieving top-k prestige-based relevant spatial web objects","volume":"3","author":"Cao X.","year":"2010","unstructured":"X. Cao , G. Cong , and C. S. Jensen . Retrieving top-k prestige-based relevant spatial web objects . PVLDB , 3 ( 1 ): 373 -- 384 , 2010 . X. Cao, G. Cong, and C. S. Jensen. Retrieving top-k prestige-based relevant spatial web objects. PVLDB, 3(1):373--384, 2010.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_3_2_1_7_1","first-page":"485","volume-title":"ICDE","author":"Yang C.","year":"2001","unstructured":"C. Yang and K. I. Lin . An index structure for efficient reverse nearest neighbor queries . In ICDE , pages 485 -- 492 , 2001 . C.Yang and K. I. Lin. An index structure for efficient reverse nearest neighbor queries. In ICDE, pages 485--492, 2001."},{"key":"e_1_3_2_1_8_1","first-page":"226","volume-title":"KDD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In KDD , pages 226 -- 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226--231, 1996."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_3_2_1_13_1","first-page":"99","volume-title":"VLDB","author":"Stanoi I.","year":"2001","unstructured":"I. Stanoi , M. Riedewald , D. Agrawal , and A. E. Abbadi . Discovery of influence sets in frequently updated databases . In VLDB , pages 99 -- 108 , 2001 . I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi. Discovery of influence sets in frequently updated databases. In VLDB, pages 99--108, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007692713085"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.144"},{"key":"e_1_3_2_1_16_1","volume-title":"Technical report","author":"Lu J.","year":"2011","unstructured":"J. Lu , Y. Lu , and G. Cong . Technical report , Renmin University of China . 2011 . J. Lu, Y. Lu, and G. Cong. Technical report, Renmin University of China. 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956882"},{"key":"e_1_3_2_1_20_1","first-page":"44","volume-title":"ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery","author":"Stanoi I.","year":"2000","unstructured":"I. Stanoi , D. Agrawal , and A. E. Abbadi . Reverse nearest neighbor queries for dynamic databases . In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery , pages 44 -- 53 , 2000 . I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 44--53, 2000."},{"key":"e_1_3_2_1_21_1","volume-title":"Introduction to Data Mining","author":"Tan P. -N.","year":"2005","unstructured":"P. -N. Tan , M. Steinbach , and V. Kumar . Introduction to Data Mining . Addison-Wesley , 2005 . P. -N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Addison-Wesley, 2005."},{"key":"e_1_3_2_1_22_1","first-page":"744","volume-title":"VLDB","author":"Tao Y.","year":"2004","unstructured":"Y. Tao , D. Papadias , and X. Lian . Reverse kNN search in arbitrary dimensionality . In VLDB , pages 744 -- 755 , 2004 . Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In VLDB, pages 744--755, 2004."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237705"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447890"},{"key":"e_1_3_2_1_25_1","first-page":"1056","volume-title":"PVLDB","author":"Wu W.","year":"2008","unstructured":"W. Wu , F. Yang , C.-Y. Chan , and K.-L. Tan . Finch : Evaluating reverse k-nearest-neighbor queries on location data . In PVLDB , pages 1056 -- 1067 , 2008 . W. Wu, F. Yang, C.-Y. Chan, and K.-L. Tan. Finch: Evaluating reverse k-nearest-neighbor queries on location data. In PVLDB, pages 1056--1067, 2008."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.77"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Athens Greece","acronym":"SIGMOD\/PODS '11"},"container-title":["Proceedings of the 2011 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989361","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989323.1989361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:20Z","timestamp":1750245740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":26,"alternative-id":["10.1145\/1989323.1989361","10.1145\/1989323"],"URL":"https:\/\/doi.org\/10.1145\/1989323.1989361","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}