arrow
Return

Avoiding Materialisation for Guarded Aggregate Queries

delete2025-01-01
delete0
PRE
AI
M
Matthias Lanzinger
R
Reinhard Pichler
A
Alexander Selzer
DOI:10.14778/3718057.3718068delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Optimising queries with many joins is known to be a hard problem. The explosion of intermediate results as opposed to a much smaller final result poses a serious challenge to modern database management systems (DBMSs). This is particularly glaring in case of analytical queries that join many tables but ultimately only output comparatively small aggregate information. Analogous problems are faced by graph database systems when processing analytical queries with aggregates on top of complex path queries.
Keywords:
query optimization
join queries
database management systems
analytical queries
graph databases

Journal

P
Proceedings of the VLDB Endowment
IF:
3.3
Papers:
556
Citations:
1.2W

Organization

No organization information available