Package Queries, Technical, having this looked at by some practitioners.
Scalable Computation of High-Order Optimization Queries
By Matteo Brucato, Azza Abouzied, Alexandra Meliou
Communications of the ACM, January 2019, Vol. 62 No. 2, Pages 108-116
10.1145/3299881
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. .... "
Also Related:
https://cacm.acm.org/magazines/2019/2/234345-technical-perspective-to-do-or-not-to-do/abstract
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment