Skip to main content
Tweeted twitter.com/StackSoftEng/status/838795936474214400

Recently read couple of Graph DB tutorials. Most of them tell what is Graph DB/when to use/fetch syntax but no where found high level description how GraphDB dtoresstores the data internally to understand it better.

Coming from java backgoroundbackground, iI think GraphDB must be storing the data similarly like Java represents the Object graph. For example DeapartmentDepartment contains the list of employees. Each deartmentdepartment has its own address.

Department {

List<Employees> employees;
Address address;
}

When iI try to think it in terms of Graph DB, Department will be a node which will contains the list of memory location of itits employees.

Advantages :-

Consistency :- Whenever there is an update in employee node,it it does not need any update in department node as it just contains memory location of employee.

Traversal performance :- Fetching the employees for department is easy as it contains employee references. so noSo, no need to joinuse joins and indexes.

Is this how graph DB stores the data at high level or we can conceptualize its storage model to understand it better ?

Recently read couple of Graph DB tutorials. Most of them tell what is Graph DB/when to use/fetch syntax but no where found high level description how GraphDB dtores the data internally to understand it better.

Coming from java backgoround, i think GraphDB must be storing the data similarly like Java represents the Object graph. For example Deapartment contains the list of employees. Each deartment has its own address.

Department {

List<Employees> employees;
Address address;
}

When i try to think it in terms of Graph DB, Department will be a node which will contains the list of memory location of it employees.

Advantages :-

Consistency :- Whenever there is update in employee node,it does not need any update in department node as it just contains memory location of employee.

Traversal performance :- Fetching the employees for department is easy as it contains employee references. so no need to join and indexes.

Is this how graph DB stores the data at high level or we can conceptualize its storage model to understand it better ?

Recently read couple of Graph DB tutorials. Most of them tell what is Graph DB/when to use/fetch syntax but no where found high level description how GraphDB stores the data internally to understand it better.

Coming from java background, I think GraphDB must be storing the data similarly like Java represents the Object graph. For example Department contains the list of employees. Each department has its own address.

Department {

List<Employees> employees;
Address address;
}

When I try to think it in terms of Graph DB, Department will be a node which contains the list of memory location of its employees.

Advantages :-

Consistency :- Whenever there is an update in employee node, it does not need any update in department node as it just contains memory location of employee.

Traversal performance :- Fetching the employees for department is easy as it contains employee references. So, no need to use joins and indexes.

Is this how graph DB stores the data at high level or we can conceptualize its storage model to understand it better ?

Source Link
user3198603
  • 1.9k
  • 2
  • 18
  • 22

How Graph DB stores the data?

Recently read couple of Graph DB tutorials. Most of them tell what is Graph DB/when to use/fetch syntax but no where found high level description how GraphDB dtores the data internally to understand it better.

Coming from java backgoround, i think GraphDB must be storing the data similarly like Java represents the Object graph. For example Deapartment contains the list of employees. Each deartment has its own address.

Department {

List<Employees> employees;
Address address;
}

When i try to think it in terms of Graph DB, Department will be a node which will contains the list of memory location of it employees.

Advantages :-

Consistency :- Whenever there is update in employee node,it does not need any update in department node as it just contains memory location of employee.

Traversal performance :- Fetching the employees for department is easy as it contains employee references. so no need to join and indexes.

Is this how graph DB stores the data at high level or we can conceptualize its storage model to understand it better ?