With the rapid growth of RDF (resource description framework) data volume, it is challenging to answer queries over dynamic RDF graphs of which the data frequently changes (by insertion/deletion) over time. This article presents QRDF, an efficient RDF graph processing system that supports not only efficient storage but also fast query of dynamic RDF graphs. QRDF (i) adopts a red-black (RB) tree for quick RDF data insertion/deletion and (ii) asynchronously moves data from the RB tree into a vector for efficient RDF query. QRDF performs early pruning on its index structure for various RDF query patterns. Experimental results show that the query performance of QRDF over RDF graphs is about 2x higher than that of the state-of-the-art RDF processing systems.

中文翻译：

---

QRDF：用于快速查询的高效 RDF 图处理系统

随着 RDF（资源描述框架）数据量的快速增长，回答对动态 RDF 图的查询具有挑战性，其中数据随着时间的推移经常变化（通过插入/删除）。本文介绍了QRDF，这是一种高效的 RDF 图处理系统，不仅支持高效存储，还支持动态 RDF 图的快速查询。QRDF (i) 采用红黑 (RB) 树来快速插入/删除 RDF 数据，以及 (ii) 将数据从 RB 树异步移动到向量中以进行高效的 RDF 查询。QRDF 对各种 RDF 查询模式的索引结构进行早期修剪。实验结果表明，QRDF 在 RDF 图上的查询性能比最先进的 RDF 处理系统高出约 2 倍。