{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T18:00:09Z","timestamp":1758477609477},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>\n            The problem of maximizing bichromatic reverse\n            <jats:italic>k<\/jats:italic>\n            nearest neighbor queries (BR\n            <jats:italic>k<\/jats:italic>\n            NN) has been extensively studied in spatial databases. In this work, we present a related query for spatial-textual databases that finds an optimal location, and a set of keywords that maximizes the size of bichromatic reverse spatial textual\n            <jats:italic>k<\/jats:italic>\n            nearest neighbors (MaxBRST\n            <jats:italic>k<\/jats:italic>\n            NN). Such a query has many practical applications including social media advertisements where a limited number of relevant advertisements are displayed to each user. The problem is to find the location and the text contents to include in an advertisement so that it will be displayed to the maximum number of users. The increasing availability of spatial-textual collections allows us to answer these queries for both spatial proximity and textual similarity. This paper is the first to consider the MaxBRST\n            <jats:italic>k<\/jats:italic>\n            NN query. We show that the problem is NP-hard and present both approximate and exact solutions.\n          <\/jats:p>","DOI":"10.14778\/2904121.2904122","type":"journal-article","created":{"date-parts":[[2016,4,12]],"date-time":"2016-04-12T12:24:41Z","timestamp":1460463881000},"page":"456-467","source":"Crossref","is-referenced-by-count":29,"title":["Maximizing bichromatic reverse spatial and textual k nearest neighbor queries"],"prefix":"10.14778","volume":"9","author":[{"given":"Farhana M.","family":"Choudhury","sequence":"first","affiliation":[{"name":"RMIT University, Melbourne, Australia"}]},{"given":"J. Shane","family":"Culpepper","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[{"name":"Queen's University, Belfast, UK"}]}],"member":"320","published-online":{"date-parts":[[2016,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.53"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_2_1_5_1","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Hochbaum D.","year":"1997","unstructured":"D. Hochbaum . Approximation Algorithms for NP-hard Problems . PWS Publishing Company , 1997 . D. Hochbaum. Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063971"},{"key":"e_1_2_1_7_1","first-page":"149","volume-title":"EWCG","author":"Cardinal J. J.","year":"2006","unstructured":"J. J. Cardinal and S. Langerman . Min-max-min geometric facility location problems . In EWCG , pages 149 -- 152 , 2006 . J. J. Cardinal and S. Langerman. Min-max-min geometric facility location problems. In EWCG, pages 149--152, 2006."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.45"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0336-8"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335415"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37487-6_13"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0527-4"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989361"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576232"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2035253.2035270"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.50"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920890"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687729"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0230-1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687754"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063788"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"},{"key":"e_1_2_1_24_1","first-page":"643","volume-title":"VLDB","author":"Zhang D.","year":"2006","unstructured":"D. Zhang , Y. Du , T. Xia , and Y. Tao . Progressive computation of the min-dist optimal-location query . In VLDB , pages 643 -- 654 , 2006 . D. Zhang, Y. Du, T. Xia, and Y. Tao. Progressive computation of the min-dist optimal-location query. In VLDB, pages 643--654, 2006."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767892"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2904121.2904122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:54:13Z","timestamp":1672224853000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2904121.2904122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.14778\/2904121.2904122"],"URL":"https:\/\/doi.org\/10.14778\/2904121.2904122","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}