{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:36Z","timestamp":1750221216126,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,6,30]],"date-time":"2018-06-30T00:00:00Z","timestamp":1530316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"\u201cResearch and Development on Real World Big Data Integration and Analysis\u201d of RIKEN, Japan"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2018,6,30]]},"abstract":"<jats:p>\n            In marketing, helping manufacturers to find the matching preferences of potential customers for their products is an essential work, especially in e-commerce analyzing with big data. The aggregate reverse rank query has been proposed to return top-\n            <jats:italic>k<\/jats:italic>\n            customers who have more potential to buy a given product bundling than other customers, where the potential is evaluated by the aggregate rank, which is defined as the sum of each product\u2019s rank. This query correctly reflects the request only when the customers consider the products in the product bundling equally. Unfortunately, rather than thinking products equally, in most cases, people buy a product bundling because they appreciate a special part of the bundling. Manufacturers, such as video games companies and cable television industries, are also willing to bundle some attractive products with less popular products for the purpose of maximum benefits or inventory liquidation.\n          <\/jats:p>\n          <jats:p>Inspired by the necessity of general aggregate reverse rank query for unequal thinking, we propose a weighted aggregate reverse rank query, which treats the elements in product bundling with different weights to target customers from all aspects of thought. To solve this query efficiently, we first try a straightforward extension. Then, we rebuild the bound-and-filter framework for the weighted aggregate reverse rank query. We prove, theoretically, that the new approach finds the optimal bounds, and we develop the highly efficient algorithm based on these bounds. The theoretical analysis and experimental results demonstrated the efficacy of the proposed methods.<\/jats:p>","DOI":"10.1145\/3225216","type":"journal-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T12:29:41Z","timestamp":1534163381000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted Aggregate Reverse Rank Queries"],"prefix":"10.1145","volume":"4","author":[{"given":"Yuyang","family":"Dong","sequence":"first","affiliation":[{"name":"University of Tsukuba, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanxiong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Kitagawa","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325909"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335433"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671359"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767904"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 33rd International Conference on VLDB. 291--302","author":"Dellis Evangelos","year":"2007","unstructured":"Evangelos Dellis and Bernhard Seeger . 2007 . Efficient computation of reverse skyline queries . In Proceedings of the 33rd International Conference on VLDB. 291--302 . Evangelos Dellis and Bernhard Seeger. 2007. Efficient computation of reverse skyline queries. In Proceedings of the 33rd International Conference on VLDB. 291--302."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44406-2_8"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 20th International Conference on Extending Database Technology (EDBT\u201917)","author":"Dong Yuyang","year":"2017","unstructured":"Yuyang Dong , Hanxiong Chen , Jeffrey Xu Yu , Kazutaka Furuse , and Hiroyuki Kitagawa . 2017 . Grid-index algorithm for reverse rank queries . In Proceedings of the 20th International Conference on Extending Database Technology (EDBT\u201917) . 306--317. Yuyang Dong, Hanxiong Chen, Jeffrey Xu Yu, Kazutaka Furuse, and Hiroyuki Kitagawa. 2017. Grid-index algorithm for reverse rank queries. In Proceedings of the 20th International Conference on Extending Database Technology (EDBT\u201917). 306--317."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1600"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375690"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376641"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783381"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978090"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the ACM SIGMOD Workshop. 44--53","author":"Stanoi Ioana","year":"2000","unstructured":"Ioana Stanoi , Divyakant Agrawal , and Amr El Abbadi . 2000 . Reverse nearest neighbor queries for dynamic databases . In Proceedings of the ACM SIGMOD Workshop. 44--53 . Ioana Stanoi, Divyakant Agrawal, and Amr El Abbadi. 2000. Reverse nearest neighbor queries for dynamic databases. In Proceedings of the ACM SIGMOD Workshop. 44--53."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.12.001"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 13th International Conference on VLDB. 744--755","author":"Tao Yufei","year":"2004","unstructured":"Yufei Tao , Dimitris Papadias , and Xiang Lian . 2004 . Reverse kNN search in arbitrary dimensionality . In Proceedings of the 13th International Conference on VLDB. 744--755 . Yufei Tao, Dimitris Papadias, and Xiang Lian. 2004. Reverse kNN search in arbitrary dimensionality. In Proceedings of the 13th International Conference on VLDB. 744--755."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0168-2"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920890"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447890"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.50"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465278"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999309.1999313"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498317"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735492"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816698"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.62"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732952"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225216","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:51Z","timestamp":1750210791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,30]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6,30]]}},"alternative-id":["10.1145\/3225216"],"URL":"https:\/\/doi.org\/10.1145\/3225216","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"type":"print","value":"2374-0353"},{"type":"electronic","value":"2374-0361"}],"subject":[],"published":{"date-parts":[[2018,6,30]]},"assertion":[{"value":"2017-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}