TY - JOUR
T1 - Answering Aggregate Queries with Ordered Direct Access
AU - Eldar, Idan
AU - Carmeli, Nofar
AU - Kimelfeld, Benny
N1 - Publisher Copyright:
© 2021 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
PY - 2023
Y1 - 2023
N2 - The paper presents recent findings on the fine-grained complexity of conjunctive queries with aggregation. For common aggregate functions (e.g., min, max, sum), such a query can be phrased as an ordinary conjunctive query over a database annotated with a suitable commutative semiring. We investigate the ability to evaluate queries by constructing in log-linear time a data structure that provides logarithmic-time direct access to the answers, ordered by a lexicographic order of choice. Importantly, these complexity guarantees hold even if the result of the query is asymptotically larger than log-linear in the size of the input.
AB - The paper presents recent findings on the fine-grained complexity of conjunctive queries with aggregation. For common aggregate functions (e.g., min, max, sum), such a query can be phrased as an ordinary conjunctive query over a database annotated with a suitable commutative semiring. We investigate the ability to evaluate queries by constructing in log-linear time a data structure that provides logarithmic-time direct access to the answers, ordered by a lexicographic order of choice. Importantly, these complexity guarantees hold even if the result of the query is asymptotically larger than log-linear in the size of the input.
UR - http://www.scopus.com/inward/record.url?scp=85162858249&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:85162858249
SN - 1613-0073
VL - 3409
JO - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
T2 - 15th Alberto Mendelzon International Workshop on Foundations of Data Management, AMW 2023
Y2 - 22 May 2023 through 26 May 2023
ER -