Part 6 - Graph Databases Flashcards
1
Q
What is a node in a GDB
A
The main data element from which graphs are constructed
2
Q
What is the link between two nodes called?
A
Relationship. Can contain metadata, for example “relationship type”
3
Q
What is a graph?
A
A graph is a data model consisting of a set of nodes linked by relationships
4
Q
What is the problem with RDBMS, and how does the GDB approach fix this problem
A
RDBMS is very inefficient in traversal. GDB uses index free adjacency by using pointers instead of keys and lookup tables
5
Q
What does ACID stand for in GDB? Why is it important?
A
- Atomic
- Consistent
- Isolated
- Durable
Transactional consistency - all updates either succeed or fail
6
Q
From the following Cypher line, identify the nodes and relationship metadata:
(A)-[:LIKES]->(B)
A
Nodes: A & B
Relationship metadata: LIKES