Linear Programs with Conjunctive Database Queries
In this paper, we study the problem of optimizing a linear program whose variables are the answers to a conjunctive query. For this we propose the language LP(CQ) for specifying linear programs whose constraints and objective functions depend on the answer sets of conjunctive queries. We contribute...
Main Authors: | Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2024-01-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/10232/pdf |
Similar Items
-
Uniform Reliability of Self-Join-Free Conjunctive Queries
by: Antoine Amarilli, et al.
Published: (2022-11-01) -
Fully dynamic evaluation for conjunctive queries with free access patterns
by: Zhang, H
Published: (2022) -
Advanced database query systems : techniques, applications and technologies /
by: Yan, Li, 1964-, et al.
Published: (c201) -
Enumerating Answers to First-Order Queries over Databases of Low Degree
by: Arnaud Durand, et al.
Published: (2022-05-01) -
Querying on spatio-temporal databases and graphs
by: Chen, Yue
Published: (2022)