一种简洁的自索引三元关系数据结构
A succinct data structure for self-indexing ternary relations
摘要：
二元关系的表示已经被深入研究，并且已经提出了许多不同的理论和实践表示来回答多个域中的常见查询。然而，三元关系并没有得到太多的关注，即使许多现实世界的应用程序需要处理三元关系。本文提出了一种新的压缩和自索引的数据结构--交错$K^2$ -树（I $K^2$ -tree），用于压缩表示和高效查询一般三元关系。IPDMATHABMM树是现有数据结构$K^2$树的演变，最初设计用于表示Web图，后来应用于其他领域. I $K^2$树能够扩展$K^2$树以表示三元关系，基于将其分解成二元关系的集合但提供所有三维中的索引能力的思想。我们提出了不同的方式来使用I $K^2$树建模不同类型的三元关系作为参考两个典型的领域：RDF和时态图。我们还通过实验评估了我们的代表性，并将其与其他最先进的解决方案在空间使用和性能方面进行了比较。
英文摘要：
The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary relations have not received as much attention, even though many real-world applications require the processing of ternary relations. In this paper we present a new compressed and self-indexed data structure that we call Interleaved $K^2$-tree (I$K^2$-tree), designed to compactly represent and efficiently query general ternary relations. The I$K^2$-tree is an evolution of an existing data structure, the $K^2$-tree, initially designed to represent Web graphs and later applied to other domains. The I$K^2$-tree is able to extend the $K^2$-tree to represent a ternary relation, based on the idea of decomposing it into a collection of binary relations but providing indexing capabilities in all the three dimensions. We present different ways to use I$K^2$-tree to model different types of ternary relations using as reference two typical domains: RDF and Temporal Graphs. We also experimentally evaluate our representations comparing them in space usage and performance with other solutions of the state of the art.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
