公开(公告)号：US20050065910A1

公开(公告)日：2005-03-24

申请号：US10913143

申请日：2004-08-06

申请人： Caleb Welton ,  Ekrem Soylemez ,  A.A. Hopeman

发明人： Caleb Welton ,  Ekrem Soylemez ,  A.A. Hopeman

IPC分类号： G06F17/30

CPC分类号： G06F17/30333 ,  G06F17/30489

摘要： A method and data structure is described that builds summary information using processor time that is usually proportional to the size of input data and a depth of hierarchies for a plurality of attributes. The output of computation is stored in a smaller area by eliminating redundant storage and computation. An index is generated which includes tuples or rows that include lower bound values for each of the attributes, values of children of the lower bound values based on the hierarchies of the attributes, and coverage class indicators of the coverage classes of the children.

摘要翻译： 描述了使用通常与输入数据的大小成比例的处理器时间和多个属性的层次深度来构建概要信息的方法和数据结构。 通过消除冗余存储和计算，计算的输出存储在较小的区域。 生成一个索引，其中包含元组或行，这些元组或行包括每个属性的下限值，基于属性的层次结构的下限值的子项的值以及子级别的覆盖类的coverage类指示符。