research-article

Public Access

Scalable computation of high-order optimization queries

Authors:

Matteo Brucato,

Alexandra MeliouAuthors Info & Claims

Communications of the ACM, Volume 62, Issue 2

Pages 108 - 116

https://doi.org/10.1145/3299881

Published: 28 January 2019 Publication History

All formats PDF

Abstract

Constrained optimization problems are at the heart of significant applications in a broad range of domains, including finance, transportation, manufacturing, and healthcare. Modeling and solving these problems has relied on application-specific solutions, which are often complex, error-prone, and do not generalize. Our goal is to create a domain-independent, declarative approach, supported and powered by the system where the data relevant to these problems typically resides: the database. We present a complete system that supports package queries, a new query model that extends traditional database queries to handle complex constraints and preferences over answer sets, allowing the declarative specification and efficient evaluation of a significant class of constrained optimization problems---integer linear programs (ILP)---within a database.

References

[1]

Alagoz, O., Schaefer, A.J., Roberts, M.S. Optimizing Organ Allocation and Acceptance. Springer, Boston, MA, 2009, 1--24.

[2]

Baykasoglu, A., Dereli, T., Das, S. Project team selection using fuzzy optimization approach. Cybern. Syst. 38, 2 (2007), 155--185.

Digital Library

[3]

Bisschop, J. AIMMS Optimization Modeling. Paragon Decision Technology, 2006.

Digital Library

[4]

Brucato, M., Abouzied, A., Meliou, A. Package queries: efficient and scalable computation of high-order constraints. VLDB J. (Oct. 2017).

Digital Library

[5]

Brucato, M., Beltran, J.F., Abouzied, A., Meliou, A. Scalable package queries in relational database systems. PVLDB 9, 7 (2016), 576--587.

Digital Library

[6]

Brucato, M., Ramakrishna, R., Abouzied, A., Meliou, A. PackageBuilder: From tuples to packages. PVLDB 7, 13 (2014), 1593--1596.

Digital Library

[7]

Chen, D.-S., Batson, R.G., Dang, Y. Applied Integer Programming: Modeling and Solution. John Wiley & Sons, 2011.

[8]

Cook, W., Hartmann, M. On the complexity of branch and cut methods for the traveling salesman problem. Polyhedral Comb. 1 (1990), 75--82.

[9]

De Choudhury, M., Feldman, M., Amer-Yahia, S., Golbandi, N., Lempel, R., Yu, C. Automatic construction of travel itineraries using social breadcrumbs. In Proceedings of the 21<sup>st</sup> ACM Conference on Hypertext and Hypermedia (Toronto, Ontario, Canada, June 13-16, 2010) ACM, NY, 35--44.

Digital Library

[10]

Deng, T., Fan, W., Geerts, F. On the complexity of package recommendation problems. In PODS '12 Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (Scottsdale, Arizona, USA, May 21-23, 2012) ACM, NY, 261--272.

Digital Library

[11]

Finkel, R.A., Bentley, J.L. Quad trees a data structure for retrieval on composite keys. Acta Inf. 4, 1 (1974), 1--9.

Digital Library

[12]

IBM CPLEX Optimization Studio. http://www.ibm.com/software/commerce/optimization/cplex-optimizer/.

[13]

Lappas, T., Liu, K., Terzi, E. Finding a team of experts in social networks. In KDD '09 Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Paris, France, June 28-July 01, 2009) ACM, NY, 467--476.

Digital Library

[14]

Makuch, W.M., Dodge, J.L., Ecker, J.G., Granfors, D.C., Hahn, G.J. Managing consumer credit delinquency in the us economy: A multi-billion dollar management science application. Interfaces 22, 1 (1992), 90--109.

Digital Library

[15]

Meliou, A., Suciu, D. Tiresias: The database oracle for how-to queries. In SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data (Scottsdale, Arizona, USA, May 20-24, 2012) ACM, NY, 337--348.

Digital Library

[16]

Padberg, M., Rinaldi, G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 1 (1991), 60--100.

Digital Library

[17]

Parameswaran, A.G., Venetis, P., Garcia-Molina, H. Recommendation systems with complex constraints: A course recommendation perspective. ACM TOIS 29, 4 (2011), 1--33.

Digital Library

[18]

Pinel, F., Varshney, L.R. Computational creativity for culinary recipes. In CHI EA '14 CHI '14 Extended Abstracts on Human Factors in Computing Systems (Toronto, Ontario, Canada, April 26-May 01, 2014) ACM, NY, 439--442.

Digital Library

[19]

Rushmeier, R.A., Kontogiorgis, S.A. Advances in the optimization of airline fleet assignment. Transp. Sci. 31, 2 (1997), 159--169.

Digital Library

[20]

Sauer, O.A., Shepard, D.M., Mackie, T.R. Application of constrained optimization to radiotherapy planning. Med. Phys. 26, 11 (1999), 2359--2366.

[21]

Terrer, J.M.A., Benede, M.A.N., del Rio, E.B., Llanas, S.C. A feasible application of constrained optimization in the IMRT system. IEEE Trans. Biomed. Eng. 54, 3 (2007), 370--379.

[22]

The Sloan Digital Sky Survey. http://www.sdss.org/.

[23]

Wang, X., Dong, X.L., Meliou, A. In SIGMOD '15 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (Melbourne, Victoria, Australia, May 31-June 04, 2015) ACM, NY, 1231--1245.

Digital Library

[24]

Williamson, D.P., Shmoys, D.B. The Design of Approximation Algorithms. Cambridge University Press, 2011.

Cited By

Makhija NGatterbauer W(2023)A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP RelaxationsProceedings of the ACM on Management of Data10.1145/36267151:4(1-27)Online publication date: 12-Dec-2023
https://dl.acm.org/doi/10.1145/3626715
Morris PMarx D(2021)A tight condition for triangle factors in pseudorandom graphsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458121(899-918)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458121
Aboulnaga AAbouzied AEchihabi KOuzzani M(2021)Database systems research in the Arab worldCommunications of the ACM10.1145/344775064:4(120-123)Online publication date: 22-Mar-2021
https://dl.acm.org/doi/10.1145/3447750

Index Terms

Scalable computation of high-order optimization queries
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Scalable and efficient processing of top-k multiple-type integrated queries
Abstract
In this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Scalable containment for unions of conjunctive queries under constraints
SWIM '13: Proceedings of the Fifth Workshop on Semantic Web Information Management

We consider the problem of query containment under ontological constraints, such as those of RDFS. Query containment, i.e., deciding whether the answers of a given query are always contained in the answers of another query, is an important problem to ...
Containment and Optimization of Object-Preserving Conjunctive Queries

In the optimization of queries in an object-oriented database (OODB) system, a natural first step is to use the typing constraints imposed by the schema to transform a query into an equivalent one that logically accesses a minimal set of objects. We ...

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM

Communications of the ACM Volume 62, Issue 2

February 2019

112 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3310134

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 January 2019

Published in CACM Volume 62, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed

Funding Sources

National Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
13,347
Total Downloads

Downloads (Last 12 months)852
Downloads (Last 6 weeks)111

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Makhija NGatterbauer W(2023)A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP RelaxationsProceedings of the ACM on Management of Data10.1145/36267151:4(1-27)Online publication date: 12-Dec-2023
https://dl.acm.org/doi/10.1145/3626715
Morris PMarx D(2021)A tight condition for triangle factors in pseudorandom graphsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458121(899-918)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458121
Aboulnaga AAbouzied AEchihabi KOuzzani M(2021)Database systems research in the Arab worldCommunications of the ACM10.1145/344775064:4(120-123)Online publication date: 22-Mar-2021
https://dl.acm.org/doi/10.1145/3447750

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents