Linear Programs with Conjunctive Database Queries

DOI10.46298/LMCS-20(1:9)2024MaRDI QIDQ6151558zbMATH OpenFDO

Authors Florent Capelli, Joachim Niehren, Jan Ramon

Publication date 11 March 2024

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2210.16694v4

zbMATH Keywords

optimizationdatabaselinear program

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Toward practical query evaluation for constraint databases
• Privately solving linear programs
• Relational linear programming
• A semantic approach to optimize linear datalog programs
• Semantic Optimization of Conjunctive Queries

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6148924 (Why is no real title available?)
• A Modeling Language for Mathematical Programming
• All normalized anti-monotonic overlap graph measures are bounded
• An efficiently computable subgraph pattern support measure: counting independent observations
• Hypertree decompositions and tractable queries
• Linear programs with conjunctive queries
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Size bounds and query plans for relational joins
• Size bounds for factorised representations of query results
• Solving Linear Programs in the Current Matrix Multiplication Time
• The Structure of Tractable Constraint Satisfaction Problems
• The algorithmic foundations of differential privacy
• Tractable counting of the answers to conjunctive queries
• Treewidth. Computations and approximations

This page was built for publication: Linear Programs with Conjunctive Database Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151558)