A Fast Plan Enumerator for Recursive Queries - Systèmes intelligents pour les données, les connaissances et les humains Access content directly
Conference Papers Year : 2024

A Fast Plan Enumerator for Recursive Queries

Amela Fejza
  • Function : Author
  • PersonId : 1089701
Pierre Genevès
Nabil Layaïda

Abstract

Plan enumeration is one of the most crucial components in relational query optimization. We demonstrate RLQDAG, a system implementation of a top-down plan enumerator for the purpose of transforming sets of recursive relational terms efficiently. We describe a complete system of query optimization with parsers and compilers adapted for recursive queries over knowledge and property graphs. We focus on the enumeration component of this sytem, the RLQDAG, and especially on its efficiency in generating plans out of reach of other approaches. We show graphical representations of explored plan spaces for queries on real datasets. We demonstrate the plan enumerator and its benefits in finding more efficient query plans.
Fichier principal
Vignette du fichier
conference_101719.pdf (1.44 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04578576 , version 1 (17-05-2024)

Licence

Identifiers

  • HAL Id : hal-04578576 , version 1

Cite

Amela Fejza, Pierre Genevès, Nabil Layaïda. A Fast Plan Enumerator for Recursive Queries. ICDE 2024 - 40th IEEE International Conference On Data Engineering, May 2024, Utrecht, Netherlands. pp.1-4. ⟨hal-04578576⟩
0 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More