The ring: worst-case optimal joins in graph databases using (almost) no extra space
From MaRDI portal
(Redirected from Publication:6536406)
Recommendations
- Worst-case optimal join algorithms
- Use of graph-theoretic models for optimal relational database accesses to perform join
- Joins via geometric resolutions. Worst case and beyond
- It's all a matter of degree. Using degree information to optimize multiway joins
- It's all a matter of degree: using degree information to optimize multiway joins
Cites work
- Boolean tensor decomposition for conjunctive queries with negation
- Colored range queries and document retrieval
- Compact binary relation representations with rich functionality
- Compressed representations of sequences and full-text indexes
- Compressing table data with column dependency
- Fast construction of wavelet trees
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 7650999 (Why is no real title available?)
- Indexing compressed text
- Joins via geometric resolutions. Worst case and beyond
- Lightweight algorithms for constructing and inverting the BWT of string collections
- New algorithms on wavelet trees and applications to information retrieval
- Size and treewidth bounds for conjunctive queries
- Size bounds and query plans for relational joins
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Tables
- Wavelet trees for all
This page was built for publication: The ring: worst-case optimal joins in graph databases using (almost) no extra space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536406)
