关键词: 数据流, 流立方体, 在线分析处理, 基于平衡二叉及节点连接的多层次树（ANH-tree）, 多层次树（H-tree）

Abstract: Stream cube is stored by H-tree and uses H-cubing to compute each cuboid.However，as it is expensive to construct data cube in OLAP，efficient data structure，query method and validated algorithms are urgently needed.Examining stream cube，as H-tree layout is disorderly and H-cubing efficiency is limited，the performance is affected.ANH-tree（based on H-tree and improved by AVL-tree and Node-links） is proposed to index nodes of each layer of tree structure by binary tree，which facilitates the retrieval operation in the construction，and links a node to its descendant，which facilitates the direct search cuboid about an ad-hoc query.Relevant algorithms have been designed and implemented.As a proof，the performance study validates the ideas with respect to the factors such as time and memory space usage.

Key words: data stream, stream cube, On-Line Analytical Processing（OLAP）, AVL and Node links based Hyper-tree（ANH-tree）, Hyper-tree（H-tree）