A formal OLAP algebra over labeled directed hypergraphs, called graphoids, is defined and shown to simulate classic data-cube operations.
G´ omez, Bart Kuijpers, and Alejandro A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.