Scalable computation of high-order optimization queries

Matteo Brucato, Azza Abouzied, Alexandra Meliou

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)108-116
Number of pages9
JournalCommunications of the ACM
Volume62
Issue number2
DOIs
StatePublished - Feb 2019

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Scalable computation of high-order optimization queries'. Together they form a unique fingerprint.

Cite this