Umeå universitets logga

umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Reaching back to move forward: using old ideas to achieve a new level of query optimization
University of Oxford, United Kingdom.
University of Oxford, United Kingdom.
TU Wien, Austria.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.ORCID-id: 0000-0002-7742-0439
Visa övriga samt affilieringar
2023 (Engelska)Ingår i: Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), CEUR-WS , 2023, artikel-id 6Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Join queries involving many relations pose a severe challenge to today's query optimisation techniques. To some extent, this is due to the fact that these techniques do not pay sufficient attention to structural properties of the query. In stark contrast, the Database Theory community has intensively studied structural properties of queries (such as acyclicity and various notions of width) and proposed efficient query evaluation techniques through variants of Yannakakis' algorithm for many years. However, although most queries in practice actually are acyclic or have low width, structure-guided query evaluation techniques based on Yannakakis' algorithm have not found their way into mainstream database technology yet.

The goal of this work is to address this gap between theory and practice. We want to analyse the potential of considering the query structure for speeding up modern DBMSs in cases that have been traditionally challenging. To this end, we propose a rewriting of SQL queries into a sequence of SQL statements that force the DBMS to follow a Yannakakis-style query execution. Through first empirical results we show that structure-guided query evaluation can indeed make the evaluation of many difficult join queries significantly faster.

Ort, förlag, år, upplaga, sidor
CEUR-WS , 2023. artikel-id 6
Serie
CEUR Workshop proceedings, ISSN 1613-0073 ; 3409
Nyckelord [en]
large join queries, query optimization, Yannakakis' algorithm
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:umu:diva-211822Scopus ID: 2-s2.0-85162848779OAI: oai:DiVA.org:umu-211822DiVA, id: diva2:1781848
Konferens
15th Alberto Mendelzon International Workshop on Foundations of Data Management, AMW 2023, Santiago de Chile, Chile, May 22-26, 2023
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)Tillgänglig från: 2023-07-11 Skapad: 2023-07-11 Senast uppdaterad: 2024-07-02Bibliografiskt granskad

Open Access i DiVA

fulltext(932 kB)63 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 932 kBChecksumma SHA-512
a61712d871698914c240032f4b08421a2e56bd4da8c7a03dd698d246d14006e981fd941d03c605e3b1957106177aed109739fc949ebdaaf040a4eaf7bb7d1fb1
Typ fulltextMimetyp application/pdf

Övriga länkar

ScopusProceedings

Person

Okulmus, Cem

Sök vidare i DiVA

Av författaren/redaktören
Okulmus, Cem
Av organisationen
Institutionen för datavetenskap
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 63 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 287 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf