期刊文献+

联机分析多维存储结构的研究 被引量:2

RESEARCH ON THE  MULTIDIMENSIONAL STORAGE STRUCTURE OF ON-LINE ANALYTICAL PROCESSING
下载PDF
导出
摘要 联机分析使用多维数组作为存储结构以加快查询响应时间。为了等同的对待每个维,适应稀疏数据,必须对多维数组进行划分。目前,有两种划分方法。本文分析了它们的优缺点,给出了一种统一的存储结构,实验结果表明,为了达到转换时间短和压缩比高的目的,要选择合适的划分向量和数据块体积。 On-line analytical processing uses multidimensional array as storage structure to speed up response time. To treat every dimension equally and adapt to sparse data, it is necessary to partition multidimensional array. There are two types of partition methods. This paper analyzes merit and demerit of these methods and gives a unified storage structure. The results of experiment show it is important to select appropriate partition vector and size of a data block to obtain high compress ratio and to make translation from text file to multidimensional array rapidly.
出处 《计算机应用与软件》 CSCD 北大核心 2005年第9期55-56,117,共3页 Computer Applications and Software
关键词 数据仓库 联机分析 数据立方体 多维数组 存储结构 响应时间 转换时间 压缩比 数据块 查询 Data warehouse OLAP Data cube Multidimensional array
  • 相关文献

参考文献6

  • 1Miguel A. , Ruiz-Sanchez, Beirsack E. W. , D, Abbous W. , Survey and taxonomy of IP address lookup algorithms. IEEE Network ,2001 (2) :8-22.
  • 2徐恪,徐明伟,吴建平,吴剑.路由查找算法研究综述[J].软件学报,2002,13(1):42-50. 被引量:43
  • 3Gupta P. ,Lin S. ,McKeown N. ,Routing Lookups in Hardware at Memory Access Speeds. Proceedings of IEEE INFOCOM'98. San Francisco,CA USA. April 1998.
  • 4Waldvogel M. , Carghese G. , Turner J. , et al. , Scalable high speed IP routing lookups. Computer Communication Review, 1997,27 ( 4 ) : 25-36.
  • 5Suri S. , Varghese G. ,Warkhede P. , R. Multiway Range Trees:Scalable IP Lookup with Fast Updates. IEEE Computer Society Press. 2001:1610-1614.
  • 6刘晨亮,许家栋,刘利章.一种兼容IPv4和IPv6的快速路由查找算法[J].计算机应用,2004,24(2):39-40. 被引量:7

二级参考文献31

  • 1Xu, Ke, Wu, Jian-ping, Wu, Jian. The analysis and design of fast route lookupalgorithms for high performance router. In: Kim, Kiseon, ed. Proceedings of the IEEEInternational Conference on ATM. San Francisco: IEEE Computer Society Press, 2001. 320~325.
  • 2Srinivasan, V. Fast and efficient Internet lookups [Ph.D. Thesis]. WashingtonUniversity, 1999.
  • 3Rekhter, Y., Li, T. An Architecturefor IP Address Allocation with CIDR. RFC 1518, 1993.
  • 4Fuller, V., Li, T., Yu, J., et al. Classless Inter-domain Routing (CIDR): anAddress Assignment and Aggregation Strategy. RFC 1519, 1993.
  • 5Hinden, R., Deering, S. IP Version 6 Addressing Architecture. RFC 2373, 1998.
  • 6Partridge, C. Locality and route caches. In: Claffy, K., Garrett, M., Braun, H.-W.,eds. Proceedings of the NSF workshop on Internet Statistics Measurement and Analysis.Diego, CA: NSF Press, 1996. 32~34.
  • 7Morrison, D.R. PATRICIA--practical algorithm to retrieve information coded inalphanumeric. Journal of the ACM, 1968, 15(4):514~534.
  • 8Sklower, Keith. A tree-based routing table for Berkeley Unix. Technical Report,Berkeley: University of California, 1993.
  • 9Internet routing table statistics. In: Saha, Debanjan, ed. Proceedings of the IEEEINFOCOM. San Francisco: IEEE Computer Society Press, 2001. 1444~1453.http://www.merit.edu/ipma/routing_table.
  • 10Cheung, G., McCanne, S. Optimal routing table design for IP address lookups undermemory constraints. In: Ephremides, A., Tripathi, S., eds. Proceedings of the IEEEINFOCOM. San Francisco: IEEE Computer Society Press, 1999. 1437~1444.

共引文献43

同被引文献14

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部