{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:55:15Z","timestamp":1759683315838,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,24]],"date-time":"2009-03-24T00:00:00Z","timestamp":1237852800000},"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":[[2009,3,24]]},"DOI":"10.1145\/1516360.1516462","type":"proceedings-article","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T16:34:53Z","timestamp":1239035693000},"page":"886-897","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Reverse k-nearest neighbor search in dynamic and general metric databases"],"prefix":"10.1145","author":[{"given":"Elke","family":"Achtert","sequence":"first","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,3,24]]},"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.1007\/s00450-007-0027-z"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. VLDB","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-Tree: an efficient access method for similarity search in metric spaces . In Proc. VLDB , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-Tree: an efficient access method for similarity search in metric spaces. In Proc. VLDB, 1997."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375718"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719095"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956882"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. DMKD","author":"Stanoi I.","year":"2000","unstructured":"I. Stanoi , D. Agrawal , and A. E. Abbadi . Reverse nearest neighbor queries for dynamic databases . In Proc. DMKD , 2000 . I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proc. DMKD, 2000."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. VLDB","author":"Tao Y.","year":"2004","unstructured":"Y. Tao , D. Papadias , and X. Lian . Reverse kNN search in arbitrary dimensionality . In Proc. VLDB , 2004 . Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.148"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. ICDE","author":"Yang C.","year":"2001","unstructured":"C. Yang and K.-I. Lin . An index structure for efficient reverse nearest neighbor queries . In Proc. ICDE , 2001 . C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proc. ICDE, 2001."}],"event":{"name":"EDBT\/ICDT '09: EDBT\/ICDT '09 joint conference","acronym":"EDBT\/ICDT '09","location":"Saint Petersburg Russia"},"container-title":["Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516360.1516462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1516360.1516462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:57Z","timestamp":1750253397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516360.1516462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,24]]},"references-count":15,"alternative-id":["10.1145\/1516360.1516462","10.1145\/1516360"],"URL":"https:\/\/doi.org\/10.1145\/1516360.1516462","relation":{},"subject":[],"published":{"date-parts":[[2009,3,24]]},"assertion":[{"value":"2009-03-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}