Aggregation and Ordering in Factorised Databases

@article{Bakibayev2013AggregationAO,
  title={Aggregation and Ordering in Factorised Databases},
  author={Nurzhan Bakibayev and Tom{\'a}s Kocisk{\'y} and D. Olteanu and Jakub Z{\'a}vodn{\'y}},
  journal={Proc. VLDB Endow.},
  year={2013},
  volume={6},
  pages={1990-2001}
}
A common approach to data analysis involves understanding and manipulating succinct representations of data. In earlier work, we put forward a succinct representation system for relational data called factorised databases and reported on the main-memory query engine FDB for select-project-join queries on such databases. In this paper, we extend FDB to support a larger class of practical queries with aggregates and ordering. This requires novel optimisation and evaluation techniques. We show… Expand
57 Citations
Memory-Efficient Group-by Aggregates over Multi-Way Joins
  • 4
  • PDF
AJAR: Aggregations and Joins over Annotated Relations
  • 16
Compressed Representations of Conjunctive Query Results
  • 10
  • PDF
Incremental Maintenance of Regression Models over Joins
  • 1
  • PDF
Ranked Enumeration of Conjunctive Query Results
  • 10
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
FDB: A Query Engine for Factorised Relational Databases
  • 38
  • PDF
Eager Aggregation and Lazy Aggregation
  • 208
  • PDF
Factorised representations of query results: size bounds and readability
  • 43
  • PDF
C-Store: A Column-oriented DBMS
  • 1,151
  • PDF
Read-once functions and query evaluation in probabilistic databases
  • 55
  • PDF
Data Compression in Oracle
  • 98
  • PDF
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
  • 73
  • PDF
On Factorisation of Provenance Polynomials
  • 23
  • PDF
F1: A Distributed SQL Database That Scales
  • 215
  • PDF
...
1
2
3
4
...