Vertex-centric Parallel Computation of SQL Queries
| Autor: | Ainur Smagulova, Alin Deutsch |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Vertex (graph theory)
Scheme (programming language) FOS: Computer and information sciences SQL Computer science InformationSystems_DATABASEMANAGEMENT Databases (cs.DB) 0102 computer and information sciences 02 engineering and technology Thread (computing) Parallel computing 01 natural sciences Computer Science - Databases 010201 computation theory & mathematics 020204 information systems Spark (mathematics) 0202 electrical engineering electronic engineering information engineering Parallelism (grammar) Graph (abstract data type) computer computer.programming_language Database engine |
| Zdroj: | SIGMOD Conference |
| Popis: | We present a scheme for parallel execution of SQL queries on top of any vertex-centric BSP graph processing engine. The scheme comprises a graph encoding of relational instances and a vertex program specification of our algorithm called TAG-join, which matches the theoretical communication and computation complexity of state-of-the-art join algorithms. When run on top of the vertex-centric TigerGraph database engine on a single multi-core server, TAG-join exploits thread parallelism and is competitive with (and often outperforms) reference RDBMSs on the TPC benchmarks they are traditionally tuned for. In a distributed cluster, TAG-join outperforms the popular Spark SQL engine. 50 pages, LaTeX; added examples in Section 6.4; corrected figure in Section 8.6 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|