- Could one say, that a graph database is a relational database but stores the references as physical addresses instead of logical connections that have to be translated to physical addresses on retrieval? Good for 1:1 but what if 1:n or n:m? Probably not single reference address stored but linked list.
- If 1 holds true, is data stored on disk like that or is there a translation between memory and disk?
- Are graph databases bidirectional by priciple?
- If bidirectional, are there storage penalties?
- Performance advantage is especially good with queries involving more than one reference, in relational terms involving more than one join. Maybe this is considered in the spot light of 6
- Performance advantage is especially good when starting at one spot and retrieving related data to this spot. For set operations it seems to be the other way round.
- Apparently, graph databases store redundant data when they are said to use more storage.
- There cannot be, by principle, a link/reference without both ends of the link.
- What Is a Graph Database and Property Graph | Neo4j
- Relational Databases vs. Graph Databases: A Comparison (to me it seems a bad relational model)
- sql - Comparison of Relational Databases and Graph Databases - Stack Overflow
- How do graph databases compare to relational databases? - Quora
- Graph database - Wikipedia
- graph databases for data warehousing
No comments:
Post a Comment