{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T21:18:22Z","timestamp":1720473502353},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["ROADRUNNER"],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1016\/j.is.2016.09.004","type":"journal-article","created":{"date-parts":[[2016,9,17]],"date-time":"2016-09-17T15:55:24Z","timestamp":1474127724000},"page":"75-92","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Exploratory product search using top-k join queries"],"prefix":"10.1016","volume":"64","author":[{"given":"Orestis","family":"Gkorgkas","sequence":"first","affiliation":[]},{"given":"Akrivi","family":"Vlachou","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Doulkeridis","sequence":"additional","affiliation":[]},{"given":"Kjetil","family":"N\u00f8rv\u00e5g","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2016.09.004_bib1","unstructured":"G. Das, D. Gunopulos, N. Koudas, D. Tsirogiannis, Answering top-k queries using views, in: Proceedings of VLDB, 2006, pp. 451\u2013462."},{"issue":"4","key":"10.1016\/j.is.2016.09.004_bib2","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","article-title":"Optimal aggregation algorithms for middleware","volume":"66","author":"Fagin","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.is.2016.09.004_bib3","doi-asserted-by":"crossref","DOI":"10.1145\/1391729.1391730","article-title":"A survey of top-k query processing techniques in relational database systems","volume":"40","author":"Ilyas","year":"2008","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.is.2016.09.004_bib4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00778-004-0128-2","article-title":"Supporting top-k join queries in relational databases","volume":"13","author":"Ilyas","year":"2004","journal-title":"VLDB J."},{"issue":"3","key":"10.1016\/j.is.2016.09.004_bib5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1272743.1272749","article-title":"Efficient top-k aggregation of ranked inputs","volume":"32","author":"Mamoulis","year":"2007","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2016.09.004_bib6","doi-asserted-by":"crossref","unstructured":"J. Finger, N. Polyzotis, Robust and efficient algorithms for rank join evaluation, in: Proceedings of SIGMOD, 2009, pp. 415\u2013428.","DOI":"10.1145\/1559845.1559890"},{"key":"10.1016\/j.is.2016.09.004_bib7","unstructured":"S. Chaudhuri, L. Gravano, Evaluating top-k selection queries, in: Proceedings of VLDB, 1999, pp. 397\u2013410."},{"issue":"5","key":"10.1016\/j.is.2016.09.004_bib8","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/TKDE.2012.34","article-title":"Efficient all top-k computation \u2013 a unified solution for all top-k, reverse top-k and top-m influential queries","volume":"25","author":"Ge","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10.1016\/j.is.2016.09.004_bib9","first-page":"898","article-title":"Creating competitive products","volume":"2","author":"Wan","year":"2009","journal-title":"PVLDB"},{"issue":"1","key":"10.1016\/j.is.2016.09.004_bib10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00778-003-0099-8","article-title":"Algorithms and applications for answering ranked queries using ranked views","volume":"13","author":"Hristidis","year":"2004","journal-title":"VLDB J."},{"issue":"2","key":"10.1016\/j.is.2016.09.004_bib11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/1005566.1005569","article-title":"Evaluating top-k queries over web-accessible databases","volume":"29","author":"Marian","year":"2004","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10.1016\/j.is.2016.09.004_bib12","first-page":"109","article-title":"Promotion analysis in multi-dimensional space","volume":"2","author":"Wu","year":"2009","journal-title":"PVLDB"},{"issue":"6","key":"10.1016\/j.is.2016.09.004_bib13","first-page":"538","article-title":"Pushing the boundaries of crowd-enabled databases with query-driven schema expansion","volume":"5","author":"Selke","year":"2012","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2016.09.004_bib14","doi-asserted-by":"crossref","unstructured":"Y. Chang, L.D. Bergman, V. Castelli, C. Li, M. Lo, J.R. Smith, The onion technique: indexing for linear optimization queries, in: Proceedings of SIGMOD, 2000, pp. 391\u2013402.","DOI":"10.1145\/335191.335433"},{"key":"10.1016\/j.is.2016.09.004_bib15","doi-asserted-by":"crossref","unstructured":"M. Theobald, G. Weikum, R. Schenkel, Top-k query evaluation with probabilistic guarantees, in: Proceedings of VLDB, 2004, pp. 648\u2013659.","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"10.1016\/j.is.2016.09.004_bib16","doi-asserted-by":"crossref","unstructured":"M. Xie, L.V.S. Lakshmanan, P.T. Wood, Efficient top-k query answering using cached views, in: Proceedings of EDBT, 2013, pp. 489\u2013500.","DOI":"10.1145\/2452376.2452433"},{"key":"10.1016\/j.is.2016.09.004_bib17","unstructured":"D. Xin, C. Chen, J. Han, Towards robust indexing for ranked queries, in: Proceedings of VLDB, 2006, pp. 235\u2013246."},{"issue":"10","key":"10.1016\/j.is.2016.09.004_bib18","first-page":"785","article-title":"Reverse k-ranks query","volume":"7","author":"Zhang","year":"2014","journal-title":"PVLDB"},{"issue":"1","key":"10.1016\/j.is.2016.09.004_bib19","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/1670243.1670249","article-title":"Optimal algorithms for evaluating rank joins in database systems","volume":"35","author":"Schnaitter","year":"2010","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2016.09.004_bib20","doi-asserted-by":"crossref","unstructured":"K. Schnaitter, N. Polyzotis, Evaluating rank joins with optimal cost, in: Proceedings of PODS, 2008, pp. 43\u201352.","DOI":"10.1145\/1376916.1376924"},{"key":"10.1016\/j.is.2016.09.004_bib21","doi-asserted-by":"crossref","unstructured":"O. Gkorgkas, A. Vlachou, C. Doulkeridis, K. N\u00f8rv\u00e5g, Efficient processing of exploratory top-k joins, in: Proceedings of SSDBM, 2014, p. 35.","DOI":"10.1145\/2618243.2618280"},{"key":"10.1016\/j.is.2016.09.004_bib22","unstructured":"A. Natsev, Y.-C. Chang, J. R. Smith, C.-S. Li, J. S. Vitter, Supporting incremental join queries on ranked inputs, in: Proceedings of VLDB, 2001, pp. 281\u2013290."},{"issue":"12","key":"10.1016\/j.is.2016.09.004_bib23","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1109\/TKDE.2011.161","article-title":"Cost-aware rank join with random and sorted access","volume":"24","author":"Martinenghi","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.is.2016.09.004_bib24","unstructured":"D. Habich, W. Lehner, A. Hinneburg, Optimizing multiple top-k queries over joins, in: Proceedings of SSDBM, 2005, pp. 195\u2013204."},{"key":"10.1016\/j.is.2016.09.004_bib25","doi-asserted-by":"crossref","unstructured":"P. Agrawal, J. Widom, Confidence-aware join algorithms, in: Proceedings of ICDE, 2009, pp. 628\u2013639.","DOI":"10.1109\/ICDE.2009.141"},{"issue":"11","key":"10.1016\/j.is.2016.09.004_bib26","first-page":"1201","article-title":"Efficient rank join with aggregation constraints","volume":"4","author":"Xie","year":"2011","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2016.09.004_bib27","doi-asserted-by":"crossref","unstructured":"J. Lu, P. Senellart, C. Lin, X. Du, S. Wang, X. Chen, Optimal top-k generation of attribute combinations based on ranked lists, in: Proceedings of SIGMOD, 2012, pp. 409\u2013420.","DOI":"10.1145\/2213836.2213883"},{"key":"10.1016\/j.is.2016.09.004_bib28","doi-asserted-by":"crossref","unstructured":"W. Zhang, R. Cheng, B. Kao, Evaluating multi-way joins over discounted hitting time, in: Proceedings of ICDE, 2014, pp. 724\u2013735.","DOI":"10.1109\/ICDE.2014.6816695"},{"key":"10.1016\/j.is.2016.09.004_bib29","doi-asserted-by":"crossref","unstructured":"M.E. Khalefa, M.F. Mokbel, J.J. Levandoski, PrefJoin: an efficient preference-aware join operator, in: Proceedings of ICDE, 2011, pp. 995\u20131006.","DOI":"10.1109\/ICDE.2011.5767894"},{"key":"10.1016\/j.is.2016.09.004_bib30","doi-asserted-by":"crossref","unstructured":"W. Jin, M. Ester, Z. Hu, J. Han, The multi-relational skyline operator, in: Proceedings of ICDE, 2007, pp. 1276\u20131280.","DOI":"10.1109\/ICDE.2007.368992"},{"key":"10.1016\/j.is.2016.09.004_bib31","doi-asserted-by":"crossref","unstructured":"W. Jin, M.D. Morse, J.M. Patel, M. Ester, Z. Hu, Evaluating skylines in the presence of equijoins, in: Proceedings of ICDE, 2010, pp. 249\u2013260.","DOI":"10.1109\/ICDE.2010.5447841"},{"key":"10.1016\/j.is.2016.09.004_bib32","doi-asserted-by":"crossref","unstructured":"C. Doulkeridis, A. Vlachou, K. N\u00f8rv\u00e5g, Y. Kotidis, N. Polyzotis, Processing of rank joins in highly distributed systems, in: Proceedings of ICDE, 2012, pp. 606\u2013617.","DOI":"10.1109\/ICDE.2012.108"},{"key":"10.1016\/j.is.2016.09.004_bib33","doi-asserted-by":"crossref","unstructured":"A. Angel, S. Chaudhuri, G. Das, N. Koudas, Ranking objects based on relationships and fixed associations, in: Proceedings of EDBT, 2009, pp. 910\u2013921.","DOI":"10.1145\/1516360.1516464"},{"key":"10.1016\/j.is.2016.09.004_bib34","doi-asserted-by":"crossref","unstructured":"X. Guo, Y. Ishikawa, Multi-objective optimal combination queries, in: Proceedings of DEXA, 2011, pp. 47\u201361.","DOI":"10.1007\/978-3-642-23088-2_4"},{"key":"10.1016\/j.is.2016.09.004_bib35","doi-asserted-by":"crossref","unstructured":"A.G. Parameswaran, H. Garcia-Molina, Recommendations with prerequisites, in: Proceedings of RecSys, 2009, pp. 353\u2013356.","DOI":"10.1145\/1639714.1639786"},{"key":"10.1016\/j.is.2016.09.004_bib36","unstructured":"S.B. Roy, S. Amer-Yahia, A. Chawla, G. Das, C. Yu, Constructing and exploring composite items, in: Proceedings of SIGMOD, 2010, pp. 843\u2013854."},{"key":"10.1016\/j.is.2016.09.004_bib37","doi-asserted-by":"crossref","unstructured":"M. Xie, L.V.S. Lakshmanan, P.T. Wood, Breaking out of the box of recommendations: from items to packages, in: Proceedings of RecSys, 2010, pp. 151\u2013158.","DOI":"10.1145\/1864708.1864739"},{"issue":"11","key":"10.1016\/j.is.2016.09.004_bib38","doi-asserted-by":"crossref","first-page":"2662","DOI":"10.1109\/TKDE.2014.2306678","article-title":"Composite retrieval of diverse and complementary bundles","volume":"26","author":"Amer-Yahia","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.is.2016.09.004_bib39","doi-asserted-by":"crossref","unstructured":"P.J. Haas, J.F. Naughton, S. Seshadri, A.N. Swami, Fixed-precision estimation of join selectivity, in: Proceedings of PODS, 1993, pp. 190\u2013201.","DOI":"10.1145\/153850.153875"},{"issue":"3","key":"10.1016\/j.is.2016.09.004_bib40","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.is.2005.12.001","article-title":"Branch-and-bound processing of ranked queries","volume":"32","author":"Tao","year":"2007","journal-title":"Inf. Syst."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437916304227?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437916304227?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T02:37:13Z","timestamp":1656383833000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437916304227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":40,"alternative-id":["S0306437916304227"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2016.09.004","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exploratory product search using top-k join queries","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2016.09.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}