{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T07:53:20Z","timestamp":1677484400035},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,7]]},"abstract":"<jats:p>\n            Given a query object\n            <jats:italic>q<\/jats:italic>\n            , a reverse nearest neighbor (RNN) query in a common certain database returns the objects having\n            <jats:italic>q<\/jats:italic>\n            as their nearest neighbor. A new challenge for databases is dealing with uncertain objects. In this paper we consider probabilistic reverse nearest neighbor (PRNN) queries, which return the uncertain objects having the query object as nearest neighbor with a sufficiently high probability. We propose an algorithm for efficiently answering PRNN queries using new pruning mechanisms taking distance dependencies into account. We compare our algorithm to state-of-the-art approaches recently proposed. Our experimental evaluation shows that our approach is able to significantly outperform previous approaches. In addition, we show how our approach can easily be extended to PR\n            <jats:italic>k<\/jats:italic>\n            NN (where\n            <jats:italic>k<\/jats:italic>\n            &gt; 1) query processing for which there is currently no efficient solution.\n          <\/jats:p>","DOI":"10.14778\/2021017.2021024","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"669-680","source":"Crossref","is-referenced-by-count":33,"title":["Efficient probabilistic reverse nearest neighbor query processing on uncertain data"],"prefix":"10.14778","volume":"4","author":[{"given":"Thomas","family":"Bernecker","sequence":"first","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Emrich","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Zankl","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38724"},{"key":"e_1_2_1_2_1","first-page":"1151","volume-title":"Proc. VLDB","author":"Agrawal P.","year":"2006","unstructured":"P. Agrawal , O. Benjelloun , A. D. Sarma , C. Hayworth , S. U. Nabar , T. Sugihara , and J. Widom . Trio: A system for data, uncertainty, and lineage . In Proc. VLDB , pages 1151 -- 1154 , 2006 . P. Agrawal, O. Benjelloun, A. D. Sarma, C. Hayworth, S. U. Nabar, T. Sugihara, and J. Widom. Trio: A system for data, uncertainty, and lineage. In Proc. VLDB, pages 1151--1154, 2006."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767908"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.78"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453895"},{"key":"e_1_2_1_8_1","volume-title":"Monty python's the life of brian","author":"Chapman G.","year":"1979","unstructured":"G. Chapman , J. Cleese , T. Gilliam , E. Idle , T. Jones , and M. Palin . Monty python's the life of brian , 1979 . G. Chapman, J. Cleese, T. Gilliam, E. Idle, T. Jones, and M. Palin. Monty python's the life of brian, 1979."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.108"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367904"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497506"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.46"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.75"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807174"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559835"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920923"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687685"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0123-0"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00887-0_4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325858"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376744"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367935"},{"key":"e_1_2_1_25_1","first-page":"44","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 , pages 44 -- 53 , 2000 . I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proc. DMKD, pages 44--53, 2000."},{"key":"e_1_2_1_26_1","first-page":"744","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 , pages 744 -- 755 , 2004 . Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, pages 744--755, 2004."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2021017.2021024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:42:41Z","timestamp":1672220561000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2021017.2021024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":26,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["10.14778\/2021017.2021024"],"URL":"https:\/\/doi.org\/10.14778\/2021017.2021024","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}