Linear Programs with Conjunctive Database Queries

DOI10.46298/lmcs-20(1:9)2024arXiv2210.16694v4MaRDI QIDQ6151558

Jan Ramon, Unnamed Author, Joachim Niehren, Florent Capelli

Publication date: 11 March 2024

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• Tractable counting of the answers to conjunctive queries
• All normalized anti-monotonic overlap graph measures are bounded
• Hypertree decompositions and tractable queries
• Treewidth. Computations and approximations
• An efficiently computable subgraph pattern support measure: counting independent observations
• Size Bounds and Query Plans for Relational Joins
• The Algorithmic Foundations of Differential Privacy
• Constraint solving via fractional edge covers
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Size Bounds for Factorised Representations of Query Results
• Solving Linear Programs in the Current Matrix Multiplication Time
• The Structure of Tractable Constraint Satisfaction Problems

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