arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.04094cs.DScs.DB
收藏

层次域上多维数据的有效表示

Efficient Representation of Multidimensional Data over Hierarchical Domains

Nieves R. Brisaboa, Ana Cerdeira-Pena, Narciso López-López, Gonzalo Navarro, Miguel R. Penabad, Fernando Silva-Coira

摘要:

我们考虑的问题,表示多维数据的每个维度的域是分层组织的,和查询需要在每个维度的层次结构中的不同节点的摘要信息。这是OLAP数据库的典型案例。一种基本的方法是将每个层次结构表示为一维线,并将查询转换为多维范围查询。这种方法可以通过将$k^2$ -treap推广到更多的维度来实现,这是一种二维点的紧凑表示,允许沿着通用范围进行有效的摘要查询。相反,我们提出了一个更灵活的泛化,而不是一个通用的四叉树样的空间分区,遵循域层次结构在每个维度上组织分区。结果结构比一般的多维结构更有效,因为查询是通过聚合树中更少的节点来解决的。

英文摘要:

We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of each dimension. This is the typical case of OLAP databases. A basic approach is to represent each hierarchy as a one-dimensional line and recast the queries as multidimensional range queries. This approach can be implemented compactly by generalizing to more dimensions the $k^2$-treap, a compact representation of two-dimensional points that allows for efficient summarization queries along generic ranges. Instead, we propose a more flexible generalization, which instead of a generic quadtree-like partition of the space, follows the domain hierarchies across each dimension to organize the partitioning. The resulting structure is much more efficient than a generic multidimensional structure, since queries are resolved by aggregating much fewer nodes of the tree.

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

↑