Direct access for answers to conjunctive queries with aggregation

DOI10.4230/LIPICS.ICDT.2024.4MaRDI QIDQ6902087zbMATH OpenFDO

Authors Idan Eldar, Nofar Carmeli, Benny Kimelfeld

Publication date 11 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2024.4

zbMATH Keywords

aggregate queriesannotated databasesanswer orderingscommutative semiringsconjunctive queriesdirect accessprovenance semiringsquery classificationranking function

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Answering FO+MOD queries under updates on bounded degree databases
• Computing thejth solution of a first-order query
• Deciding equivalences among conjunctive aggregate queries
• Dynamic complexity under definable changes
• Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• On a class of \(O(n^ 2)\) problems in computational geometry
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Size bounds for factorised representations of query results
• Towards polynomial lower bounds for dynamic problems

Cited in

(3)

• Enumeration and updates for conjunctive linear algebra queries through expressibility
• Direct access for answers to conjunctive queries with aggregation
• Dynamic direct access of MSO query evaluation over strings

This page was built for publication: Direct access for answers to conjunctive queries with aggregation

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