arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.09041cs.DS
收藏

二元关系的压缩数据结构及其应用

Compressed Data Structures for Binary Relations in Practice

Carlos Quijada-Fuentes, Miguel R. Penabad, Susana Ladra, Gilberto Gutiérrez

摘要:

二元关系在计算机科学中通常用于数据建模。除了使用矩阵或列表的经典表示之外,最近已经提出了一些压缩数据结构来表示紧凑空间中的二元关系,例如$k^2$树和二元关系小波树(BRWT)。了解他们的存储需求、支持的操作和时间性能是在给定域或应用程序、其数据分布和对数据计算的典型操作的情况下选择适当的数据表示的关键。在这项工作中,我们提出了一个经验比较几个压缩表示的二元关系。我们使用不同的(合成的和真实的)数据分布来分析它们的空间使用情况和操作速度。我们包括邻域和集合运算,还提出了BRWT的集合运算算法,这是以前文献中没有提出的。我们的结论是,没有一个明确的选择,优于其余的,但我们给出了一些建议,使用每个紧凑的表示取决于数据分布和类型的操作执行的数据。我们还包括一个可扩展性研究的数据表示。

英文摘要:

Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent binary relations in compact space, such as the $k^2$-tree and the Binary Relation Wavelet Tree (BRWT). Knowing their storage needs, supported operations and time performance is key for enabling an appropriate choice of data representation given a domain or application, its data distribution and typical operations that are computed over the data. In this work, we present an empirical comparison among several compressed representations for binary relations. We analyze their space usage and the speed of their operations using different (synthetic and real) data distributions. We include both neighborhood and set operations, also proposing algorithms for set operations for the BRWT, which were not presented before in the literature. We conclude that there is not a clear choice that outperforms the rest, but we give some recommendations of usage of each compact representation depending on the data distribution and types of operations performed over the data. We also include a scalability study of the data representations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑