4,849 Hits in 3.0 sec

A New Big Data Benchmark for OLAP Cube Design Using Data Pre-Aggregation Techniques

Roberto Tardío, Alejandro Maté, Juan Trujillo
2020 Applied Sciences  
A wrong design of the OLAP cube alters significantly several key performance metrics, including: (i) the analytic capabilities of the cube (time and ability to provide an answer to a query), (ii) size  ...  of the OLAP cube, and (iii) time required to build the OLAP cube.  ...  Figure 3 . 3 Query latency results grouped by OLAP cube design and query type. Figure 4 . 4 Percentage of queries resolved in less than 3 s.  ... 
doi:10.3390/app10238674 fatcat:c635wk6bvfaf5ob6vw7e5lywdq

Materialization of fragmented views in multidimensional databases

Matteo Golfarelli, Vittorio Maniezzo, Stefano Rizzi
2004 Data & Knowledge Engineering  
In the classical approach to materialization, each view includes all and only the measures of the cube it aggregates.  ...  We formalize the fragmentation problem as a 0-1 integer linear programming problem, which is then solved by means of a standard integer programming solver to determine the optimal fragmentation for a given  ...  For each workload, the bulk of the queries works on LI, while the percentage of queries requiring both schemes ranges between 15% and 20%.  ... 
doi:10.1016/j.datak.2003.11.001 fatcat:7fjokqe2xvfvvanspt3gz44use

Query Optimization: Fund Data Generation Applying NonClustered Indexing and MapReduced Data Cube Numerosity Reduction Method

Mercy Burawis
2020 International Journal of Advanced Trends in Computer Science and Engineering  
In this paper, the query optimization technique is to address the prolonged execution of the query by applying one of the data reduction strategies called numerosity reduction methods; slice and dice data  ...  MapReduce based approach is for handling large scale data, in which it is of great help to enhance the data cube computation and achieve optimal time over large data set.  ...  of the optimized query reaches its optimal time.  ... 
doi:10.30534/ijatcse/2020/1991.12020 fatcat:oixhfbvdvvhzvndbbj44uf5nji

Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP

Alfredo Cuzzocrea
2005 Proceedings of the 8th ACM international workshop on Data warehousing and OLAP - DOLAP  
To this end, scalability of the techniques and accuracy of the answers are recognized as important limitations of state-of-the-art approximate query answering proposals in OLAP.  ...  Such a framework allows us to efficiently support OLAP applications, as answering queries is the main bottleneck for this kind of applications.  ...  Figure 5 . 5 Variation of the average percentage relative error w.r.t. the query selectivity.  ... 
doi:10.1145/1097002.1097020 dblp:conf/dolap/Cuzzocrea05 fatcat:a5dmmmyrnnbzbl7kidy7i7osry

Squid: Enabling search in DHT-based systems

Cristina Schmidt, Manish Parashar
2008 Journal of Parallel and Distributed Computing  
The fundamental concept underlying the approach is the definition of multi-dimensional information spaces and the maintenance of locality in these spaces.  ...  Squid supports complex queries containing partial keywords, wildcards and ranges. Analytical and simulation results show that Squid is scalable and efficient.  ...  Percentage of nodes queried, with and without the optimization, plotted on a logarithmic scale.  ... 
doi:10.1016/j.jpdc.2008.02.003 fatcat:av2rsam2uvgg3gv7bwghtpmyf4

Hybrid Query and Data Ordering for Fast and Progressive Range-Aggregate Query Answering

Cyrus Shahabi, Mehrdad Jahangiri, Dimitri Sacharidis
2005 International Journal of Data Warehousing and Mining  
While prior work focused on the ordering of either the query or the data coefficients, we propose a class of hybrid ordering techniques that exploits both query and data wavelets in answering queries progressively  ...  Data analysis systems require range-aggregate query answering of large multidimensional datasets.  ...  Recall that in our experiments we used an approximate data cube that is 50,000 times smaller than the actual cube ( percentage of the cube).  ... 
doi:10.4018/jdwm.2005040103 fatcat:xqoomtrqd5eghagswxsabavhja

R-Store: A scalable distributed system for supporting real-time analytics

Feng Li, M. Tamer Ozsu, Gang Chen, Beng Chin Ooi
2014 2014 IEEE 30th International Conference on Data Engineering  
Based on the metadata stored in the storage system, either the data cube or OLTP database or both are used by the MapReduce jobs for OLAP queries.  ...  With the awareness of the ability of big data in providing enterprises useful insights from vast amounts of data, effective and timely decisions derived from real-time analytics are important.  ...  ACKNOWLEDGMENT The work described in this paper was in part supported by the Singapore Ministry of Education Grant No.  ... 
doi:10.1109/icde.2014.6816638 dblp:conf/icde/LiOCO14 fatcat:ezv65uty6zhy5lfznlkodpdmca

Mining Query Plans for Finding Candidate Queries and Sub-Queries for Materialized Views in BI Systems Without Cube Generation

Atul Thakare, Srijay Deshpande, Amit Kshirsagar, Parag Deshpande
2019 Computing and informatics  
Materialized views are important for optimizing Business Intelligence (BI) systems when they are designed without data cubes.  ...  The proposed algorithm showed significant improvement in terms of more number of optimized queries because it is using the execution plan tree of the query as a basis of selection of query to be optimized  ...  joins • QA -Percentage of queries involving only aggregations • QJA -Percentage of queries involving both joins and aggregations Table 2.  ... 
doi:10.31577/cai_2019_2_473 fatcat:55elhssz35eurbvyp2q2ewimcm


Oleg Sabinin, Ekaterina Sheikina
2017 Theoretical & Applied Science  
The implemented experiment includes the comparison of average performance of databases, MOLAP, ROLAP and HOLAP with the constant number of rows in a fact table and the increasing complexity of queries,  ...  this paper is to compare a relational database, an optimized relational database, OLAP as a model of multidimensional databases and formulate the prerequisites of the usage of MOLAP, ROLAP and HOLAP on  ...  However, the percentage of required space will be shown in the next section.  ... 
doi:10.15863/tas.2017.11.55.21 fatcat:v2xa2no4zvctnkvj7czwjbjbyi


Qingwei Lin, Weichen Ke, Jian-Guang Lou, Hongyu Zhang, Kaixin Sui, Yong Xu, Ziyi Zhou, Bo Qiao, Dongmei Zhang
2018 Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18  
To enable interactive identification of insights, a large number of dimension combinations need to be searched and a series of aggregation queries need to be quickly answered.  ...  The existing approaches answer interactive queries on big data through data cubes or approximate query processing.  ...  We also thank all the members of Software Analytics team at MSRA for the discussions.  ... 
doi:10.1145/3219819.3219867 dblp:conf/kdd/LinKLZSXZQZ18 fatcat:ynpplolpuvakdgorajqizh5yuq

Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance and Scale It Too

Todd Eavis, Ahmad Taleb
2013 Journal of Computing Science and Engineering  
Specifically, it utilizes an OLAP algebra coupled with a domain specific query optimizer, to map user queries directly to the storage and indexing framework.  ...  Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage  ...  To evaluate the benefit of the optimization process, we execute our query test suite against both the optimized and un optimized versions of the DBMS, for input data sets of one million and 10 million  ... 
doi:10.5626/jcse.2013.7.1.1 fatcat:26pyagf7wzcdfox2rlbpxlacsy


Alfredo Cuzzocrea, Paolo Serafino
2009 Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09  
techniques, which perform well on small-in-size low-dimensional data cubes, whereas their performance in both representing the input data domain and efficiently supporting approximate query answering  ...  The problem of efficiently compressing massive high-dimensional data cubes still waits for efficient solutions capable of overcoming well-recognized scalability limitations of state-of-the-art histogram-based  ...  Figure 6 . 6 Percentage variation of  rel w.r.t. ||Q|| on data cube CVA 15 . Figure 7 . 7 Percentage variation of  rel w.r.t. ||Q|| on data cube SKEW 15 .  ... 
doi:10.1145/1516360.1516448 dblp:conf/edbt/CuzzocreaS09 fatcat:lkgoy3ovardvlfkrfbnkfu5igm

Efficient Updates for OLAP Range Queries on Flash Memory

M. McCarthy, Z. He
2011 Computer journal  
A popular data structure used for answering OLAP range-sum queries is the prefix sum cube. It allows the range-sum query to be answered in constant time.  ...  The particular type of queries considered are range queries using the aggregate functions SUM, COUNT and AVG.  ...  ACKNOWLEDGEMENT We would also like to thank Michele Mooney for her careful proof reading of this paper.  ... 
doi:10.1093/comjnl/bxr004 fatcat:2iayrokdcvbpxfpsdiamcdz7ya

Optimizing OLAP cube processing on solid state drives

Zhibo Chen, Carlos Ordonez
2013 Proceedings of the sixteenth international workshop on Data warehousing and OLAP - DOLAP '13  
We propose optimizations for SQL queries to enhance their performance on SSDs. An experimental evaluation with the TPC-H database compares performance of our optimizations on SSDs and HDDs.  ...  This unique ability to retrieve data quickly combines perfectly with OLAP cube processing. In this paper, we study how to improve performance of OLAP cube processing on SSDs.  ...  This is an example of a query involving the CUBE operation on three dimensions of the TPC-H Orders Optimization of Cube Generation For both cube generation approaches mentioned above, the advantage  ... 
doi:10.1145/2513190.2513197 dblp:conf/dolap/0002O13 fatcat:4c2et34k2zebjnfyyo7lt3nocq

DROLAP - A Dense-Region Based Approach to On-Line Analytical Processing [chapter]

David W. Cheung, Bo Zhou, Ben Kao, Kan Hu, Sau Dan Lee
1999 Lecture Notes in Computer Science  
The core of building a DROLAP system lies in the mining of dense regions in a data cube. We h a ve de ned the dense region mining problem as an optimization problem.  ...  With this type of distributions, most data points are gathered together to form some dense regions, while the remaining small percentage of data points are distributed sparsely in the cube space.  ...  In Figure 13 , the reponse time of DROLAP is linear to the percentage of space query.  ... 
doi:10.1007/3-540-48309-8_71 fatcat:vb7whmchpjf4lmdeouiit77ygy
« Previous Showing results 1 — 15 out of 4,849 results