Enumeration algorithms for conjunctive queries with projection

DOI10.46298/LMCS-21(3:27)2025MaRDI QIDQ6925608zbMATH OpenFDO

Authors Shaleen Deep, Xiao Hu, Paraschos Koutris

Publication date 25 September 2025

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://doi.org/10.46298/LMCS-21(3:27)2025

Mathematics Subject Classification ID

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

Cites work

• Answering FO+MOD queries under updates on bounded degree databases
• Constraint solving via fractional edge covers
• Counting Triangles under Updates in Worst-Case Optimal Time
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 3716801 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Introduction to algorithms.
• New bounds for matrix multiplication: from alpha to omega
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Probabilistic databases
• Ranked enumeration of conjunctive query results
• Size bounds for factorised representations of query results
• Structural tractability of enumerating CSP solutions
• Subcubic equivalences between path, matrix, and triangle problems
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Cited in

(2)

• Ranked enumeration of conjunctive query results
• Ranked enumeration of conjunctive query results

This page was built for publication: Enumeration algorithms for conjunctive queries with projection

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