3 ms·
Some perspective on this subject: - A graph database is essentially a relational database plus join recursion. Many modern relational databases support join re
by jandrewrogers 11y ago
Some perspective on this subject:
- A graph database is essentially a relational database plus join recursion. Many modern relational databases support join recursion; support for graph models is ubiquitous, they just don't call themselves "graph databases". There are other reasons graph-like computation is relatively rare.
- There are some important types of relationships that are effectively not representable in graph data models. Relationships that have a topological nature, such as negative constraints, spatiotemporal, etc are notoriously problematic.
- General graph-like operations have terrible scalability and performance characteristics as commonly implemented. Consequently, people almost never organize their data models this way unless it is absolutely unavoidable. Even Facebook materializes common traversals as non-graphs so that they do not have to execute them dynamically. The heavy reliance on secondary indexing for performance in most graph databases ensures they will be marginal for large-scale data models.
- Semantic Web fails at scale because no two people map reality to definitions in the same way. This is particularly obvious at global scales because of cultural influences on how we interpret the world. If you've ever done global data model integrations, and I have, you quickly realize that the only values that are approximately consistent globally are physic-based measurements e.g. "650nm wavelength" (instead of "red"). The nodes have no common definition in practice, just commonly overlapping parts of countless subjective interpretations of the definition, which leads to pollution of the data model in real systems.
- espeed 11y agoHi Andrew - Have you explored holographic algorithms/encodings that use shape to represent elements such that you can succinctly and uniquely define an object/relation in terms of the composition of its constituent parts in a way that enables fast decomposition back into its constituent parts?
- deleted 11y ago[deleted]
- wolfgke 11y ago> Have you explored holographic algorithms/encodings[...] As far as the wording in mainstream science is, holographic algorithms are something entirely different, see https://en.wikipedia.org/wiki/Holographic_algorithm https://en.wikipedia.org/wiki/Holographic_algorithm.
- espeed 11y agoVladimir Kornyak touches on some of these ideas in these papers: 1. On Compatibility of Discrete Relations (2005) http://arxiv.org/pdf/math-ph/0504048.pdf http://arxiv.org/pdf/math-ph/0504048.pdf 2. Structural and Symmetry Analysis of Discrete Dynamical Systems (2010) http://arxiv.org/pdf/1006.1754.pdf http://arxiv.org/pdf/1006.1754.pdf 3. Discrete Dynamical Models: Combinatorics, Statistics and Continuum Approximations (2015) http://mmg.tversu.ru/images/publications/2015-vol3-n1/Kornyak-2015-01-05.pdf http://mmg.tversu.ru/images/publications/2015-vol3-n1/Kornya... On a somewhat related note -- applying quantum principles to graph database processing -- see this new paper by Marko Rodriguez (the creator of the Gremlin graph programming language): 4. Quantum Walks with Gremlin (2015) http://arxiv.org/pdf/1511.06278v1.pdf http://arxiv.org/pdf/1511.06278v1.pdf