{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:47:36Z","timestamp":1760597256625,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"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":[[2006,6,27]]},"DOI":"10.1145\/1142473.1142531","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"515-526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["Efficient reverse k-nearest neighbor search in arbitrary metric spaces"],"prefix":"10.1145","author":[{"given":"Elke","family":"Achtert","sequence":"first","affiliation":[{"name":"University of Munich, Munich, Germany"}]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}]},{"given":"Peter","family":"Kunath","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}]},{"given":"Alexey","family":"Pryakhin","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"9","author":"Andrew A. M.","year":"1979","unstructured":"{1} A. M. Andrew . Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters , 9 , 1979 . {1} A. M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters, 9, 1979.","journal-title":"Information Processing Letters"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. VLDB","author":"Berchtold S.","year":"1996","unstructured":"{3} S. Berchtold , D. A. Keim , and H.-P. Kriegel . The X-Tree : An index structure for high-dimensional data . In Proc. VLDB , 1996 . {3} S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An index structure for high-dimensional data. In Proc. VLDB, 1996."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. VLDB","author":"Ciaccia P.","year":"1997","unstructured":"{4} P. Ciaccia , M. Patella , and P. Zezula . M-Tree: an efficient access method for similarity search in metric spaces . In Proc. VLDB , 1997 . {4} 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_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/937976.938050"},{"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","volume-title":"Chaos","author":"Schroeder M.","year":"1991","unstructured":"{8} M. Schroeder . Fractals , Chaos , Power Laws : Minutes from an infinite paradise. W.H. Freeman and company, New York, 1991 . {8} M. Schroeder. Fractals, Chaos, Power Laws: Minutes from an infinite paradise. W.H. Freeman and company, New York, 1991."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956882"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. DMKD","author":"Stanoi I.","year":"2000","unstructured":"{10} I. Stanoi , D. Agrawal , and A. E. Abbadi . Reverse nearest neighbor queries for dynamic databases . In Proc. DMKD , 2000 . {10} 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_11_1","volume-title":"Proc. VLDB","author":"Tao Y.","year":"2004","unstructured":"{11} Y. Tao , D. Papadias , and X. Lian . Reverse kNN search in arbitrary dimensionality . In Proc. VLDB , 2004 . {11} Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, 2004."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. ICDE","author":"Yang C.","year":"2001","unstructured":"{12} C. Yang and K.-I. Lin . An index structure for efficient reverse nearest neighbor queries . In Proc. ICDE , 2001 . {12} C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proc. ICDE, 2001."}],"event":{"name":"SIGMOD\/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Chicago IL USA","acronym":"SIGMOD\/PODS06"},"container-title":["Proceedings of the 2006 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142473.1142531","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1142473.1142531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:15Z","timestamp":1750259175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142473.1142531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":12,"alternative-id":["10.1145\/1142473.1142531","10.1145\/1142473"],"URL":"https:\/\/doi.org\/10.1145\/1142473.1142531","relation":{},"subject":[],"published":{"date-parts":[[2006,6,27]]},"assertion":[{"value":"2006-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}