1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DB2023★ 1 cited
AeonG: An Efficient Built-in Temporal Support in Graph Databases
Jiamin Hou, Zhanhao Zhao, Zhouyu Wang +4
Real world graphs are often dynamic and evolve over time. It is crucial for storing and querying graph evolution in graph databases. However, existing works either suffer from high…
cs.DB2021
Making RDBMSs Efficient on Graph Workloads Through Predefined Joins
Guodong Jin, Semih Salihoglu
Joins in native graph database management systems (GDBMSs) are predefined to the system as edges, which are indexed in adjacency list indices and serve as pointers. This contrasts…