A formal OLAP algebra over labeled directed hypergraphs, called graphoids, is defined and shown to simulate classic data-cube operations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Online Analytical Processsing on Graph Data
A formal OLAP algebra over labeled directed hypergraphs, called graphoids, is defined and shown to simulate classic data-cube operations.