Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value Stores

Today's article comes from the IEEE Explore journal. The authors are Lin et al., from Peking University, in China. In this paper they propose the architecture for a faster graph database, build a proof-of-concept, and then benchmark it against the market leaders.

DOI: 10.26599/BDMA.2023.9020015

Book
Book

Members Only

You must be an active Journal Club member to access this content. If you're already a member, click the blue button to login. If you're not a member yet, click the sign-up button to get started.

Login to My Account Sign Up