全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于数据流模式的聚集快速查询计算研究

, PP. 0-0

Keywords: 集查询计算,数据流计算,近似查询方法

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了减少在计算和存档数据流的过程中对昂贵的存档数据的存取,分析了聚集数据查询的特点,并引入了聚集查询语言和聚集查询重写方法。针对数据流近似查询计算的需求,概述了数据流计算的基本特征,提出了一种基于数据流的近似计算模型。在此基础上,根据实际应用环境给出了一种近似查询提纲的小波方法。该计算架构和方法在人口信息系统中的实际应用表明,可以实现对数据流的快速聚集查询处理,并获得有效的查询结果。

References

[1]  GRUMBACH S,RAFANELLI M,TINININI L. Querying aggregate data[A].Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System[C].New York,NY,USA:ACM,1999.174-184.
[2]  GRUMBACH S,TINININI L. On the content of materialized aggregate views[A]. Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System[C].New York,NY,USA:ACM,2000.47-57.
[3]  COHEN S,NUTT W,SEREBRENIK A. Algorithms for rewriting aggregate queries using views[A]. Pro. Symposium on Advances in Databases and Information Systems[C].Prague,Czech Republic:ADBIS-DASFAA,2000.65-78.
[4]  ABITEBOUL S,DUSCHKA O M. Complexity of answering queries using materialized views[A].Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System[C].New York,NY,USA:ACM,1998.254-263.
[5]  CHAUDHURI S,DAS G,NARASAYYA V.A robust,optimization-based approach for approximate answering of aggregate queries[A]. ACM SIGMOD[C].New York,NY, USA:ACM SIGMOD,2001.295-306.
[6]  ALON N,MATIAS Y,SZEGEDY M. The space complexity of approximating the frequency moments[J]. Journal of Computer and System Sciences,1999,58(1):137-147.
[7]  CORMODE G,INDYK P,KOUDAS N,et al. Fast mining of tabular data via approximate distance computations[A]. IEEE ICDE[C].San Jose,California,USA:IEEE,2002.605-616.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133