{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T01:17:21Z","timestamp":1789435041222,"version":"build-2803163510"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1420941"],"award-info":[{"award-number":["IIS-1420941"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1421322"],"award-info":[{"award-number":["IIS-1421322"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1453543"],"award-info":[{"award-number":["IIS-1453543"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00778-017-0483-4","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T14:42:34Z","timestamp":1508856154000},"page":"693-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Package queries: efficient and scalable computation of high-order constraints"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2730-6432","authenticated-orcid":false,"given":"Matteo","family":"Brucato","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azza","family":"Abouzied","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandra","family":"Meliou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"483_CR1","doi-asserted-by":"crossref","unstructured":"Basu Roy, S., Amer-Yahia, S., Chawla, A., Das, G., Yu, C.: Constructing and exploring composite items. In: SIGMOD, pp 843\u2013854 (2010)","DOI":"10.1145\/1807167.1807258"},{"issue":"2","key":"483_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/01969720601139041","volume":"38","author":"A Baykasoglu","year":"2007","unstructured":"Baykasoglu, A., Dereli, T., Das, S.: Project team selection using fuzzy optimization approach. Cybern. Syst. 38(2), 155\u2013185 (2007)","journal-title":"Cybern. Syst."},{"issue":"9","key":"483_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"483_CR4","volume-title":"AIMMS Optimization Modeling","author":"J Bisschop","year":"2006","unstructured":"Bisschop, J.: AIMMS Optimization Modeling. Paragon Decision Technology, Haarlem (2006)"},{"key":"483_CR5","doi-asserted-by":"crossref","unstructured":"Bonatti, P., Calimeri, F., Leone, N., Ricca, F.: A 25-year perspective on logic programming. Chapter Answer Set Programming, pp. 159\u2013182. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14309-0_8"},{"issue":"7","key":"483_CR6","first-page":"576","volume":"9","author":"M Brucato","year":"2016","unstructured":"Brucato, M., Beltran, J.F., Abouzied, A., Meliou, A.: Scalable package queries in relational database systems. PVLDB 9(7), 576\u2013587 (2016)","journal-title":"PVLDB"},{"issue":"13","key":"483_CR7","first-page":"1593","volume":"7","author":"M Brucato","year":"2014","unstructured":"Brucato, M., Ramakrishna, R., Abouzied, A., Meliou, A.: PackageBuilder: from tuples to packages. PVLDB 7(13), 1593\u20131596 (2014)","journal-title":"PVLDB"},{"key":"483_CR8","first-page":"75","volume":"1","author":"W Cook","year":"1990","unstructured":"Cook, W., Hartmann, M.: On the complexity of branch and cut methods for the traveling salesman problem. Polyhedral Comb. 1, 75\u201382 (1990)","journal-title":"Polyhedral Comb."},{"key":"483_CR9","doi-asserted-by":"crossref","unstructured":"De Choudhury, M., Feldman, M., Amer-Yahia, S., Golbandi, N., Lempel, R., Yu, C.: Automatic construction of travel itineraries using social breadcrumbs. In: HyperText, pp. 35\u201344 (2010)","DOI":"10.1145\/1810617.1810626"},{"key":"483_CR10","doi-asserted-by":"crossref","unstructured":"Deng, T., Fan, W., Geerts, F.: On the complexity of package recommendation problems. In: PODS, pp. 261\u2013272 (2012)","DOI":"10.1145\/2213556.2213592"},{"key":"483_CR11","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226\u2013231 (1996)"},{"key":"483_CR12","unstructured":"Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.D.: Computing iceberg queries efficiently. In: VLDB\u201998, Proceedings of 24th International Conference on Very Large Data Bases, Aug 24\u201327, 1998, New York City, New York, USA, pp. 299\u2013310 (1998)"},{"issue":"1","key":"483_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Inform. 4(1), 1\u20139 (1974)","journal-title":"Acta Inform."},{"key":"483_CR14","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. In: Leuschel, M., Schrijvers, T., (eds.) Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP\u201914), volume \n                    arXiv:1405.3694v1\n                    \n                   (2014). Theory and Practice of Logic Programming, Online Supplement"},{"key":"483_CR15","unstructured":"GNU Bison. \n                    https:\/\/www.gnu.org\/software\/bison\/"},{"key":"483_CR16","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation Algorithms for NP-Hard Problems, pp. 144\u2013191 (1997)"},{"key":"483_CR17","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/B978-012722442-8\/50074-4","volume-title":"Proceedings 2003 VLDB Conference","author":"Sudipto Guha","year":"2003","unstructured":"Guha, S., Gunopulos, D., Koudas, N., Srivastava, D., Vlachos, M.: Efficient approximation of optimization queries under parametric aggregation constraints. In: VLDB, pp. 778\u2013789 (2003)"},{"key":"483_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm as 136: a k-means clustering algorithm. Appl. Stat. 28, 100\u2013108 (1979)","journal-title":"Appl. Stat."},{"issue":"301","key":"483_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"483_CR20","unstructured":"IBM CPLEX Optimization Studio. \n                    http:\/\/www.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/"},{"key":"483_CR21","doi-asserted-by":"crossref","unstructured":"Kalinin, A., Cetintemel, U., Zdonik, S.: Interactive data exploration using semantic windows. In: SIGMOD, pp. 505\u2013516 (2014)","DOI":"10.1145\/2588555.2593666"},{"issue":"10","key":"483_CR22","first-page":"1094","volume":"8","author":"A Kalinin","year":"2015","unstructured":"Kalinin, A., \u00c7etintemel, U., Zdonik, S.B.: Searchlight: enabling integrated search and exploration over large multidimensional data. PVLDB 8(10), 1094\u20131105 (2015)","journal-title":"PVLDB"},{"issue":"51","key":"483_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"1","author":"PC Kanellakis","year":"1995","unstructured":"Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint query languages. J. Comput. Syst. Sci. 1(51), 26\u201352 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"483_CR24","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis, vol. 344. Wiley, Hoboken (2009)"},{"key":"483_CR25","unstructured":"Laporte, M., Novelli, N., Cicchetti, R., Lakhal, L.: Computing full and iceberg datacubes using partitions. In: Foundations of Intelligent Systems, 13th International Symposium, ISMIS 2002, Lyon, France, June 27\u201329, 2002, Proceedings, pp. 244\u2013254 (2002)"},{"key":"483_CR26","doi-asserted-by":"crossref","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: SIGKDD, pp. 467\u2013476 (2009)","DOI":"10.1145\/1557019.1557074"},{"key":"483_CR27","doi-asserted-by":"crossref","unstructured":"Meliou, A., Suciu, D.: Tiresias: the database oracle for how-to queries. In: SIGMOD, pp. 337\u2013348 (2012)","DOI":"10.1145\/2213836.2213875"},{"key":"483_CR28","unstructured":"Mirzasoleiman, B., Karbasi, A., Sarkar, R., Krause, A.: Identifying representative elements in massive data. In: NIPS, Distributed Submodular maximization (2013)"},{"key":"483_CR29","unstructured":"Ng, R.T., Wagner, A.S., Yin, Y.: Iceberg-cube computation with PC clusters. In: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, USA, May 21\u201324, 2001, pp. 25\u201336 (2001)"},{"issue":"1","key":"483_CR30","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"issue":"4","key":"483_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2037661.2037665","volume":"29","author":"AG Parameswaran","year":"2011","unstructured":"Parameswaran, A.G., Venetis, P., Garcia-Molina, H.: Recommendation systems with complex constraints: a course recommendation perspective. ACM TOIS 29(4), 1\u201333 (2011)","journal-title":"ACM TOIS"},{"key":"483_CR32","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"483_CR33","doi-asserted-by":"crossref","unstructured":"Pinel, F., Varshney, L.R.: Computational creativity for culinary recipes. In: CHI, pp. 439\u2013442 (2014)","DOI":"10.1145\/2559206.2574794"},{"key":"483_CR34","unstructured":"The Sloan Digital Sky Survey. \n                    http:\/\/www.sdss.org\/"},{"key":"483_CR35","unstructured":"The TPC-H Benchmark. \n                    http:\/\/www.tpc.org\/tpch\/"},{"key":"483_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"483_CR37","unstructured":"Xie, M., Lakshmanan, L.V.S., Wood, P.T.: Breaking out of the box of recommendations: from items to packages. In: Proceedings of the 2010 ACM Conference on Recommender Systems, RecSys 2010, Barcelona, Spain, Sep 26\u201330, 2010, pp. 151\u2013158 (2010)"},{"issue":"3","key":"483_CR38","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/s11704-012-2014-1","volume":"6","author":"M Xie","year":"2012","unstructured":"Xie, M., Lakshmanan, L.V.S., Wood, P.T.: Composite recommendations: from items to packages. Front. Comput. Sci. 6(3), 264\u2013277 (2012)","journal-title":"Front. Comput. Sci."},{"issue":"14","key":"483_CR39","first-page":"1941","volume":"7","author":"M Xie","year":"2014","unstructured":"Xie, M., Lakshmanan, L.V.S., Wood, P.T.: Generating top-k packages via preference elicitation. PVLDB 7(14), 1941\u20131952 (2014)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0483-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0483-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0483-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T15:35:05Z","timestamp":1589643305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0483-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,24]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["483"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0483-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,24]]},"assertion":[{"value":"23 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}