Cited By
View all- Wang QYou JZou BChen YHuang XJia L(2021)Reduced Quotient Cube: Maximize Query Answering Capacity in OLAPIEEE Access10.1109/ACCESS.2021.3120278(1-1)Online publication date: 2021
A Closed Frag-Shells Cubing Algorithm on High Dimensional and Non-Hierarchical Data Sets
Article No.: 6, Pages 1 - 8
Abstract
In view of high-dimensional and non-hierarchical large data sets, an improved CFSC (Closed Frag-Shells Cube) method is proposed based on the Frag-Shells method in this paper. When the Data Cube is generated, the high-dimensional data is divided into several low-dimensional data fragments by using the idea of partitioning cubes into dimension attributes. For each dimension data segment, the closed cubes of each dimension data segment are calculated using the closed cube calculation. A query bitmap is added to each fragment, and a query index table of closed segments is constructed by using bit map index technology to reduce the storage space occupied by the result set and to increase the query efficiency. Based on the application of multidimensional analysis of water conservancy census data, it is proved that this method can effectively reduce the storage space of cube data of water conservancy census data and improve the efficiency of OLAP (online analytical processing) query.
References
[1]
Zhu K, Wan D, Cheng X. Computation of Data Cube in Analysis of Water Census Results {J}. Computer & Digital Engineering, 2014, 42(9): 1591--1594.
[2]
Beyer K, Ramakrishnan R. Bottom-up computation of sparse and iceberg cube{C}//ACM SIGMOD Record. ACM, 1999, 28(2): 359--370.
[3]
Wang W, Feng J, Lu H, and et al. Condensed cube: An effective approach to reducing data cube size{C}//Data Engineering, 2002. Proceedings. 18th International Conference on. IEEE, 2002: 155--165.
[4]
Sismanis Y, Deligiannakis A, and Roussopoulos N, et al. Dwarf: Shrinking the petacube{C}//Proceedings of the 2002 ACM SIGMOD international conference on Management of data. ACM, 2002: 464--475.
[5]
Chee Yong Chan, Yannis E. Ioannidis. Bitmap Index Design and Evaluation{C}. In Proceedings of SIGMOD Conference'1998. 1998:355--366.
[6]
Patrick Valduriez. Join Indices{J}. ACM Transaction Database System, 1987, 12(2): 218--246.
[7]
Gray J, Chaudhuri S, Bosworth A, et al. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals{J}. Data Mining and Knowledge Discovery, 1997, 1(1): 29--53.
[8]
Shanshan Tang, Dingsheng Wan, Yuelong Zhu. Reasearch On Water Census Data Cube Parallel Computing Method{J}.Computer Engineering and Applications,2015, 51(22):124--129.
[9]
Li X, Han J, Gonzalez H. High-dimensional OLAP: A minimal cubing approach{C}//Proceedings of the Thirtieth international conference on Very large data bases-Volume 30. VLDB Endowment, 2004: 528--539.
[10]
Baeza-Yates R, Ribeiro-Neto B. Modern information retrieval {M}. New York: ACM press, 1999.
[11]
Xin D, Shao Z, Han J, et al. C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking{C}. International Conference on Data Engineering, 2005: 4.
[12]
Yannis Sismanis, Antonios Deligiannakis, Nick Roussopoulos, Yannis Kotidis. Dwarf: shrinking the PetaCube{C}. In Proceedings of SIGMOD Conference'2002. 2002:464--475.
[13]
Xiao W, Xi J. CCBitmaps: A Space-Time Efficient Index Structure for OLAP{C}. Advanced Data Mining and Applications, International Conference, Adma 2009, Beijing, China, August 17-19, 2009. Proceedings, 2009: 729--735.
[14]
Wu K, Stockinger K, Shoshani A. Breaking the curse of cardinality on bitmap indexes{C}//Scientific and Statistical Database Management. Springer Berlin Heidelberg, 2008: 348--365.
[15]
Wang Z, Xu Y. Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update{C}. International Conference on Internet Computing in Science and Engineering, 2008: 60--67.
[16]
Agarwal S, Agrawal R, Deshpande P M, et al. On the computation of multidimensional aggregates{C}//VLDB. 1996, 96: 506--521.
[17]
Shanshan Tang, Dingsheng Wan, Yuelong Zhu, and Jianguo Yao. Frag-shells cube based on hierarchical dimension encoding tree. Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication (IMCOM '17). ACM, 2017, 2:1--2:9.
[18]
Baeza-Yates R, Ribeiro-Neto B. Modern information retrieval {M}. New York: ACM press, 1999.
Recommendations
Frag-shells cube based on hierarchical dimension encoding tree
IMCOM '17: Proceedings of the 11th International Conference on Ubiquitous Information Management and CommunicationPre-computation of data cube can greatly improve the performance of OLAP (online analytical processing). There are a lot of effective pre-computation methods of data cube. But in practice, appropriate pre-computation method for the characteristics of ...
A high performance hierarchical cubing algorithm and efficient OLAP in high-dimensional data warehouse
PAKDD'07: Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data miningData cube has been playing an essential role in fast OLAP (online analytical processing) in many data warehouses. The pre-computation of data cubes is critical for improving the OLAP response time of in large high-dimensional data warehouses. However, ...
Time-HOBI: Index for optimizing star queries
One of the important research and technological problems in data warehouse query optimization concerns star queries. So far, most of the research focused on optimizing such queries by means of join indexes, bitmap join indexes, or various ...
Comments
Information & Contributors
Information
Published In
January 2018
628 pages
ISBN:9781450363853
DOI:10.1145/3164541
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- SKKU: SUNGKYUNKWAN UNIVERSITY
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 January 2018
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- the National Science and Technology Support Plan Project of China
- the Ministry of Water Resources Public Welfare Industry Research Special Foundation of China
Conference
IMCOM '18
IMCOM '18: The 12th International Conference on Ubiquitous Information Management and Communication
January 5 - 7, 2018
Langkawi, Malaysia
Acceptance Rates
IMCOM '18 Paper Acceptance Rate 100 of 255 submissions, 39%;
Overall Acceptance Rate 213 of 621 submissions, 34%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 42Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
Cited By
View all- Wang QYou JZou BChen YHuang XJia L(2021)Reduced Quotient Cube: Maximize Query Answering Capacity in OLAPIEEE Access10.1109/ACCESS.2021.3120278(1-1)Online publication date: 2021
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in