{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T18:05:10Z","timestamp":1792173910564,"version":"4.4.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>\n            Top-\n            <jats:italic>k<\/jats:italic>\n            queries are widely applied for retrieving a ranked set of the\n            <jats:italic>k<\/jats:italic>\n            most interesting objects based on the individual user preferences. As an example, in online marketplaces, customers (users) typically seek a ranked set of products (objects) that satisfy their needs. Reversing top-\n            <jats:italic>k<\/jats:italic>\n            queries leads to a query type that instead returns the set of customers that find a product appealing (it belongs to the top-\n            <jats:italic>k<\/jats:italic>\n            result set of their preferences). In this paper, we address the challenging problem of processing queries that identify the top-\n            <jats:italic>m<\/jats:italic>\n            most\n            <jats:italic>influential products<\/jats:italic>\n            to customers, where influence is defined as the cardinality of the reverse top-\n            <jats:italic>k<\/jats:italic>\n            result set. This definition of influence is useful for market analysis, since it is directly related to the number of customers that value a particular product and, consequently, to its visibility and impact in the market. Existing techniques require processing a reverse top-\n            <jats:italic>k<\/jats:italic>\n            query for each object in the database, which is prohibitively expensive even for databases of moderate size. In contrast, we propose two algorithms,\n            <jats:italic>SB<\/jats:italic>\n            and\n            <jats:italic>BB<\/jats:italic>\n            , for identifying the most influential objects:\n            <jats:italic>SB<\/jats:italic>\n            restricts the candidate set of objects that need to be examined, while\n            <jats:italic>BB<\/jats:italic>\n            is a branch-and-bound algorithm that retrieves the result incrementally. Furthermore, we propose meaningful variations of the query for most influential objects that are supported by our algorithms. Our experiments demonstrate the efficiency of our algorithms both for synthetic and real-life datasets.\n          <\/jats:p>","DOI":"10.14778\/1920841.1920890","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"364-372","source":"Crossref","is-referenced-by-count":44,"title":["Identifying the most influential data objects with reverse top-k queries"],"prefix":"10.14778","volume":"3","author":[{"given":"Akrivi","family":"Vlachou","sequence":"first","affiliation":[{"name":"Norwegian University of Science and Technology (NTNU), Trondheim, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Doulkeridis","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology (NTNU), Trondheim, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kjetil","family":"N\u00f8rv\u00e5g","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology (NTNU), Trondheim, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Kotidis","sequence":"additional","affiliation":[{"name":"Athens University of Economics and Business (AUEB), Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_2_1","first-page":"397","volume-title":"Proc. of VLDB","author":"Chaudhuri S.","year":"1999","unstructured":"S. Chaudhuri and L. Gravano . Evaluating top-k selection queries . In Proc. of VLDB , pages 397 -- 410 , 1999 . S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In Proc. of VLDB, pages 397--410, 1999."},{"key":"e_1_2_1_3_1","first-page":"291","volume-title":"Proc. of VLDB","author":"Dellis E.","year":"2007","unstructured":"E. Dellis and B. Seeger . Efficient computation of reverse skyline queries . In Proc. of VLDB , pages 291 -- 302 , 2007 . E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In Proc. of VLDB, pages 291--302, 2007."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142547"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497444"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.12.001"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447890"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687729"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687754"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739052"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687641"},{"key":"e_1_2_1_14_1","first-page":"946","volume-title":"Proc. of VLDB","author":"Xia T.","year":"2005","unstructured":"T. Xia , D. Zhang , E. Kanoulas , and Y. Du . On computing top-t most influential spatial sites . In Proc. of VLDB , pages 946 -- 957 , 2005 . T. Xia, D. Zhang, E. Kanoulas, and Y. Du. On computing top-t most influential spatial sites. In Proc. of VLDB, pages 946--957, 2005."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:36:54Z","timestamp":1672227414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920890"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920890","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}