The Query Speed Improvement on Distributed Graph Database Using Streaming Graph Partitioning Strategy with Asynchronous Transaction Information
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 104 === In this research, we propose an idea to delay the commit time in a dis-tributed graph database by the asynchronous transaction. In this way, moreinformation can be gathered to make better streaming graph partitioning de-cision and that will lead to faster query...
Main Authors: | Li-Yuan Hung, 洪立遠 |
---|---|
Other Authors: | 廖世偉 |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/11637388195284483656 |
Similar Items
-
An Association-Oriented Partitioning Approach for Streaming Graph Query
by: Yun Hao, et al.
Published: (2017-01-01) -
Streaming Graph Partitioning with Graph Convolutional Networks
by: Zwolak, Michal
Published: (2020) -
Functional querying in graph databases
by: Jaroslav Pokorný
Published: (2017-11-01) -
Scalable Streaming Graph Partitioning
by: Seyed Khamoushi, Seyed Mohammadreza
Published: (2017) -
Big Graph Processing : Partitioning and Aggregated Querying
by: Echbarthi, Ghizlane
Published: (2017)