{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:30Z","timestamp":1750307250403,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"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,3,21]]},"DOI":"10.1145\/1951365.1951404","type":"proceedings-article","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:25:29Z","timestamp":1300796729000},"page":"319-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficient reverse skyline retrieval with arbitrary non-metric similarity measures"],"prefix":"10.1145","author":[{"given":"Prasad M.","family":"Deshpande","sequence":"first","affiliation":[{"name":"IBM Research - India, Bangalore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Deepak","sequence":"additional","affiliation":[{"name":"IBM Research - India, Bangalore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142531"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_16"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11827405_83"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INGS.2008.12"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_3_2_1_8_1","volume-title":"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 VLDB , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, 1997."},{"key":"e_1_3_2_1_9_1","first-page":"291","volume-title":"VLDB","author":"Dellis E.","year":"2007","unstructured":"E. Dellis and B. Seeger . Efficient computation of reverse skyline queries . In VLDB , pages 291 -- 302 , 2007 . E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In VLDB, pages 291--302, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353388"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276328"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/641007.641107"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.07.011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376641"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1670243.1670246"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.92.3.289"},{"key":"e_1_3_2_1_20_1","volume-title":"Efficient rknn retrieval with arbitrary non-metric similarity measures. PVLDB, 3(1)","author":"Deshpande P","year":"2010","unstructured":"Deepak. P and P. Deshpande . Efficient rknn retrieval with arbitrary non-metric similarity measures. PVLDB, 3(1) , 2010 . Deepak. P and P. Deshpande. Efficient rknn retrieval with arbitrary non-metric similarity measures. PVLDB, 3(1), 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353388"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872814"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956882"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85654-2_30"},{"key":"e_1_3_2_1_25_1","first-page":"44","volume-title":"In SIGMOD Workshop on DMKD","author":"Stanoi I.","year":"2000","unstructured":"I. Stanoi , D. Agrawal , and A. E. Abbadi . Reverse nearest neighbor queries for dynamic databases . In In SIGMOD Workshop on DMKD , pages 44 -- 53 , 2000 . I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In In SIGMOD Workshop on DMKD, pages 44--53, 2000."},{"key":"e_1_3_2_1_26_1","first-page":"2002","article-title":"Robust similarity measures for mobile object trajectories","author":"Vlachos M.","year":"2002","unstructured":"M. Vlachos , D. Gunopulos , and G. Kollios . Robust similarity measures for mobile object trajectories . In DEXA 2002 , 2002 . M. Vlachos, D. Gunopulos, and G. Kollios. Robust similarity measures for mobile object trajectories. In DEXA 2002, 2002.","journal-title":"DEXA"},{"key":"e_1_3_2_1_27_1","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 , 2001 . C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In ICDE, 2001."},{"key":"e_1_3_2_1_28_1","volume-title":"ISKE","author":"Yanmin Luo J. L.","year":"2008","unstructured":"J. L. Yanmin Luo , Canhong Lian and H. Chen . Finding rknn by compressed straightforward index . In ISKE , 2008 . J. L. Yanmin Luo, Canhong Lian and H. Chen. Finding rknn by compressed straightforward index. In ISKE, 2008."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSO.2009.74"}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","sponsor":["Microsoft Research Microsoft Research"],"location":"Uppsala Sweden","acronym":"EDBT\/ICDT '11"},"container-title":["Proceedings of the 14th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1951365.1951404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1951365.1951404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:14Z","timestamp":1750243934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1951365.1951404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":29,"alternative-id":["10.1145\/1951365.1951404","10.1145\/1951365"],"URL":"https:\/\/doi.org\/10.1145\/1951365.1951404","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}