Finding hierarchical frequent items in data streams

被引：0

作者：

Feng, Wenfeng ^{[1
]}

Guo, Qiao ^{[1
]}

Zhang, Zhibin ^{[2
]}

机构：

[1] Beijing Inst Technol, Network Informat Ctr, Beijing 100081, Peoples R China

[2] Henan Univ Technol, Dept Comp Sci & Engn, Zhengzhou 454000, Peoples R China

来源：

WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS | 2006年

关键词：

data stream; summary data structure; hierarchical frequent items; approximate algorithms;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A Hierarchical Sketch was implemented to summarize the hierarchical structure in stream data. The sketch used a XOR-based pair-wise independent family of hash functions on the hierarchical domain to map stream data items to a three dimensional array of counters of sin L xDx W. Of the counter array, L was the layers in hierarchy, D was the number of uniformly and randomly chosen hash functions, and W was the range of hash functions. Based on the sketch, an algorithm that identified and evaluated the hierarchical frequent items over data streams approximately was implemented. This algorithm has sub-linear time and space costs and is almost exact in statistic meaning.

引用

页码：5972 / +

页数：2