Scalable Computation of High-Order Optimization Queries.
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...
| Publicado en: | Communications of the ACM Vol. 62; no. 2; pp. 108 - 117 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Feb2019
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=134383092&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 134383092 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Feb2019 vid: 62 iid: 2 pid: 68 pub: Association for Computing Machinery artinfo: ui: 134383092 10.1145/3299881 ppf: 108 ppct: 9 formats: tig: atl: Scalable Computation of High-Order Optimization Queries. aug: au: Brucato, Matteo Abouzied, Azza Meliou, Alexandra affil: College of Information and Computer Sciences, University of Massachusetts, Amherst, MA, USA. Computer Science, New York University, Abu Dhabi, UAE. su: Querying (Computer science) Constrained optimization Query languages (Computer science) Computer programming Database searching sug: subj: Querying (Computer science) Constrained optimization Query languages (Computer science) Computer programming Database searching 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2019 holdings: @attributes: islocal: N |
|---|