首頁 > 網路資源 > 大同大學數位論文系統

Title page for etd-0718104-211031


URN etd-0718104-211031 Statistics This thesis had been viewed 2770 times. Download 1022 times.
Author Cheng-Ling shiou
Author's Email Address ken.shiou@msa.hinet.net
Department Computer Science and Enginerring
Year 2003 Semester 2
Degree Master Type of Document Master's Thesis
Language English Page Count 49
Title Implementation for Subcube Based Query Processing
Keyword
  • subcube
  • query processing
  • OLAP
  • materialized view
  • data warehous
  • data cube
  • data cube
  • data warehous
  • materialized view
  • OLAP
  • query processing
  • subcube
  • Abstract Data cube materialization is commonly used in reducing OLAP response time. However, to materialize a whole data cube needs large disk space, because the focus on the interested subjects of decision makers results in only a small portion of data cubes being frequently accessed. The subcube, a finer partition of a data cube is proposed. The subcubes are formed by mapping the multi-dimensional queries, and the number of subcubes becomes larger after various queries issued by users with different dimension levels and value ranges. The management framework of these subcubes is important. Another concerned issue is how to pick up the most appropriate subcubes for the query processing. The technique directly affects the query performance. This thesis research uses binary trees and linked lists to manage and organize the subcubes. For saving the query processing time, an algorithm for searching appropriate subcubes is proposed, and the performance of the subcube based query processing algorithm is improved.
    Advisor Committee
  • Huei-Huang Chen - advisor
  • none - co-chair
  • none - co-chair
  • Files indicate access worldwide
    Date of Defense 2004-07-08 Date of Submission 2004-07-18


    Browse | Search All Available ETDs