Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value Stores
Graph databases have gained widespread adoption in various industries and have been utilized in a range of applications, including financial risk assessment, commodity recommendation, and data lineage tracking. While the principles and design of these databases have been the subject of some investig...
Main Authors: | Heng Lin, Zhiyong Wang, Shipeng Qi, Xiaowei Zhu, Chuntao Hong, Wenguang Chen, Yingwei Luo |
---|---|
Format: | Article |
Language: | English |
Published: |
Tsinghua University Press
2024-03-01
|
Series: | Big Data Mining and Analytics |
Subjects: | |
Online Access: | https://www.sciopen.com/article/10.26599/BDMA.2023.9020015 |
Similar Items
-
Standard Framework for Comparison of Graph Partitioning Techniques
by: Mudasser Iqbal, et al.
Published: (2015-07-01) -
Improving Query Response Time for Graph Data Using Materialization
by: Abdul Waheed, et al.
Published: (2015-12-01) -
Extended Property-level k-vertex Cardinality Constraints Model for Graph Databases
by: Martina Šestak, et al.
Published: (2023-04-01) -
Auxo: A Temporal Graph Management System
by: Wentao Han, et al.
Published: (2019-03-01) -
Graph Computing Systems and Partitioning Techniques: A Survey
by: Tewodros Alemu Ayall, et al.
Published: (2022-01-01)