The Big Data Cube
Join the DZone community and get the full member experience.Join For Free
erik meijer’s paper your mouse is a database has an interesting illustration of “the big data cube” using three axes to classify databases.
the volume axis is big vs. small, or perhaps better, open vs. closed. relational databases can be large, and non-relational databases can be small. but the relational database model is closed in the sense that “it assumes a closed world that is under full control by the database.”
the velocity axis is (synchronous) pull vs. (asynchronous) push. the variety axis captures whether data is stored by foreign-key/primary-key relations or key-value pairs. the first axis could be labeled
here are the corners identified by the paper:
- traditional rdbms (small, pull, fk/pk)
- hadoop hbase (big, pull, fk/pk)
- object/relational mappers (small, pull, k/v)
- linq to objects (big, pull, k/v)
- reactive extensions (big, push, k/v)
how would you fill in the three corners not listed above?
Published at DZone with permission of John Cook, DZone MVB. See the original article here.
Opinions expressed by DZone contributors are their own.
Revolutionizing Algorithmic Trading: The Power of Reinforcement Learning
SRE vs. DevOps
Building a Flask Web Application With Docker: A Step-by-Step Guide