Scalable computation of high-order optimization queries

Matteo Brucato, Azza Abouzied, Alexandra Meliou

    Research output: Contribution to journalArticle

    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 1 2019

    Fingerprint

    Constrained optimization
    Finance
    Specifications

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Scalable computation of high-order optimization queries. / Brucato, Matteo; Abouzied, Azza; Meliou, Alexandra.

    In: Communications of the ACM, Vol. 62, No. 2, 01.02.2019, p. 108-116.

    Research output: Contribution to journalArticle

    Brucato, M, Abouzied, A & Meliou, A 2019, 'Scalable computation of high-order optimization queries', Communications of the ACM, vol. 62, no. 2, pp. 108-116. https://doi.org/10.1145/3299881
    Brucato, Matteo ; Abouzied, Azza ; Meliou, Alexandra. / Scalable computation of high-order optimization queries. In: Communications of the ACM. 2019 ; Vol. 62, No. 2. pp. 108-116.
    @article{21e94685e8f64ebe99896d8ddfa7f2d3,
    title = "Scalable computation of high-order optimization queries",
    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.",
    author = "Matteo Brucato and Azza Abouzied and Alexandra Meliou",
    year = "2019",
    month = "2",
    day = "1",
    doi = "10.1145/3299881",
    language = "English (US)",
    volume = "62",
    pages = "108--116",
    journal = "Communications of the ACM",
    issn = "0001-0782",
    publisher = "Association for Computing Machinery (ACM)",
    number = "2",

    }

    TY - JOUR

    T1 - Scalable computation of high-order optimization queries

    AU - Brucato, Matteo

    AU - Abouzied, Azza

    AU - Meliou, Alexandra

    PY - 2019/2/1

    Y1 - 2019/2/1

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=85061092097&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85061092097&partnerID=8YFLogxK

    U2 - 10.1145/3299881

    DO - 10.1145/3299881

    M3 - Article

    VL - 62

    SP - 108

    EP - 116

    JO - Communications of the ACM

    JF - Communications of the ACM

    SN - 0001-0782

    IS - 2

    ER -