Distributed Graph Storage And Querying System
Graph databases offer an efficient way to store and access inter-connected data. However, to query large graphs that no longer fit in memory, it becomes necessary to make multiple trips to the storage device to filter and gather data based on the query. But I/O accesses are expensive operations and...
Main Author: | Balaji, Janani |
---|---|
Format: | Others |
Published: |
ScholarWorks @ Georgia State University
2016
|
Subjects: | |
Online Access: | http://scholarworks.gsu.edu/cs_diss/110 http://scholarworks.gsu.edu/cgi/viewcontent.cgi?article=1112&context=cs_diss |
Similar Items
-
Functional querying in graph databases
by: Jaroslav Pokorný
Published: (2017-11-01) -
Design of Formal Query Languages and Schemas for Graph Databases
by: Sharma, Chandan
Published: (2021) -
Modeling and Querying Graph Data
by: Yang, Hong
Published: (2009) -
A Survey Of Persistent Graph Databases
by: Liu, Yufan
Published: (2014) -
Sequence queries on temporal graphs
by: Zhu, Haohan
Published: (2016)