Filters








285 Hits in 8.0 sec

Range Top/Bottom k Queries in OLAP Sparse Data Cubes [chapter]

Zhong Wei Luo, Tok Wang Ling, Chuan Heng Ang, Sin Yeung Lee, Bin Cui
2001 Lecture Notes in Computer Science  
A range top k query finds the top k maximum values over all selected cells of an OLAP data cube where the selection is specified by the range of contiguous values for each dimension.  ...  In this paper, we propose a partitionbased storage structure, which is capable of answering both range top and bottom k queries in OLAP sparse data cubes.  ...  In particular, we propose a new pre-computation approach for a class of OLAP queries called Range Top/Bottom k Queries, which is capable of finding both top k maximum and bottom k minimum values with just  ... 
doi:10.1007/3-540-44759-8_66 fatcat:h5ib534atjferov6lalsphb4iy

Evaluation of Top-k OLAP Queries Using Aggregate R–Trees [chapter]

Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
2005 Lecture Notes in Computer Science  
A straightforward method to evaluate a top-k OLAP query is to compute the aggregate value for each group and then select the groups with the highest aggregates.  ...  In this paper, we study the integration of the top-k operator with the aggregate query processing module.  ...  The data cube is partitioned into sufficiently small cells and the top-k aggregate values in each partition are pre-computed.  ... 
doi:10.1007/11535331_14 fatcat:rfbr2lvlpvajpm5uinfzfw4uli

Privacy Preserving OLAP over Distributed XML Data: A Theoretically-Sound Secure-Multiparty-Computation Approach

Alfredo Cuzzocrea, Elisa Bertino
2011 Journal of computer and system sciences (Print)  
In order to fulfill this gap, we propose a novel Secure Multiparty Computation (SMC)-based privacy preserving OLAP framework for distributed collections of XML documents.  ...  Privacy Preserving Distributed OLAP is becoming a critical challenge for next-generation Business Intelligence (BI) scenarios, due to the "natural suitability" of OLAP in analyzing distributed massive  ...  [58] describes yet another perturbation-based technique for OLAP data cubes, called Cubic-Wise Balance method, whose main goal is that of providing privacy preserving range queries over data cubes.  ... 
doi:10.1016/j.jcss.2011.02.004 fatcat:ut45awj5qfayzmagxwiq4g5fga

Integrating OLAP and Ranking: The Ranking-Cube Methodology

Dong Xin, Jiawei Han
2007 2007 IEEE 23rd International Conference on Data Engineering Workshop  
While pre-computation and multi-dimensional aggregation is the standard solution for OLAP, materializing dynamic ranking results is unrealistic because the ranking criteria are not known until the query  ...  We study the problem of On-Line Analytical Processing (OLAP) of ranked queries, where ranked queries are conducted in the arbitrary subset of data defined by multi-dimensional selections.  ...  OLAP refers to a set of data analysis tools developed for analyzing data in data warehouses since 1990s [27] .  ... 
doi:10.1109/icdew.2007.4401000 dblp:conf/icde/XinH07 fatcat:fxeo53c2lzco7jwqaslwcigqi4

Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining [chapter]

Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
2001 Lecture Notes in Computer Science  
We present a general framework for the CGM which allows for the efficient parallelization of existing data cube construction algorithms for OLAP.  ...  We study the applicability of coarse grained parallel computing model (CGM) to on-line analytical processing (OLAP) for data mining.  ...  Coarse Grained Parallel OLAP Data cube queries represent an important class of On-Line Analytical Processing (OLAP) queries in decision support systems.  ... 
doi:10.1007/3-540-45718-6_64 fatcat:67pqk3i27jesze7qrv463yipiu

OLAP over Continuous Domains via Density-Based Hierarchical Clustering [chapter]

Michelangelo Ceci, Alfredo Cuzzocrea, Donato Malerba
2011 Lecture Notes in Computer Science  
Following this latest trend, in this paper we propose a novel method for effectively and efficiently supporting roll-up and drill-down operations over OLAP data cubes with continuous dimensions via a density-based  ...  In traditional OLAP systems, roll-up and drill-down operations over data cubes exploit fixed hierarchies defined on discrete attributes that play the roles of dimensions, and operate along them.  ...  This work is partial fulfillment of the research objective of ATENEO-2009 project "Estrazione, Rappresentazione e Analisi di Dati Complessi".  ... 
doi:10.1007/978-3-642-23863-5_57 fatcat:wd2kwi24ffdhhamohe4ozu2giq

DPCube: Releasing Differentially Private Data Cubes for Health Information

Yonghui Xiao, James Gardner, Li Xiong
2012 2012 IEEE 28th International Conference on Data Engineering  
Analytical Processing (OLAP) queries and learning tasks.  ...  We demonstrate DPCube, a component in our Health Information DE-identification (HIDE) framework, for releasing differentially private data cubes (or multi-dimensional histograms) for sensitive data.  ...  The authors would like to thank the anonymous reviewers for their comments which helped improve the final version of this demo paper.  ... 
doi:10.1109/icde.2012.135 dblp:conf/icde/XiaoGX12 fatcat:jaqkyh6wrvbojiocjg4bhrxzmu

A time efficient and accurate retrieval of range aggregate queries using fuzzy clustering means (FCM) approach

A. Murugan, D. Gobinath, S. Ganesh Kumar, B. Muruganantham, Sarubala Velusamy
2020 International Journal of Electrical and Computer Engineering (IJECE)  
Statistical analysis: Existing approaches cannot guarantee an efficient retrieval of data from the database.  ...  Findings: This problem is overcome in the proposed methodology by introducing the FCM clustering instead of k means clustering which can cluster the large volume of data which are similar in nature.  ...  The Prefix-sum Cube (PC) method [4, 6, 7] is first used in OLAP to improve the range-aggregate query performance.  ... 
doi:10.11591/ijece.v10i1.pp415-420 fatcat:ywpkeodldvg5bewpeyidewtsam

Search Driven Analysis of Heterogenous XML Data [article]

Andrey Balmin, Latha Colby (IBM Almaden Research Center), Emiran Curtmola, Quanzhong Li (IBM Almaden Research Center), Fatma Ozcan
2009 arXiv   pre-print
SEDA then maps query results onto a set of known, or newly created, facts and dimensions, and derives a star schema and its instantiation to be fed into an off-the-shelf OLAP tool, for further analysis  ...  This can be very time-consuming and costly, especially if the underlying XML data has a lot of variety in structure, and only a subset of attributes constitutes meaningful dimensions and facts.  ...  ACKNOWLEDGEMENTS We would like to thank Zografoula Vagena for her contributions to the top-k search algorithm and some other aspects of the system.  ... 
arXiv:0909.1773v1 fatcat:w6alimsu7zgezg456bnqr3jc5y

Parallel querying of ROLAP cubes in the presence of hierarchies

Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
2005 Proceedings of the 8th ACM international workshop on Data warehousing and OLAP - DOLAP  
Online Analytical Processing is a powerful framework for the analysis of organizational data.  ...  Supporting efficient indexing facilities for multi-dimensional cube queries is an issue of some complexity.  ...  RELATED WORK The data cube model was formally introduced in [9] . In the succeeding years, a series of algorithms for the efficient computation of the data cube were presented.  ... 
doi:10.1145/1097002.1097019 dblp:conf/dolap/DehneER05 fatcat:hbbjdummzzhi5bsyf7dkiduase

Cost Modeling and Estimation for OLAP-XML Federations [chapter]

Dennis Pedersen, Karsten Riis, Torben Bach Pedersen
2002 Lecture Notes in Computer Science  
On top of the algebra, a SQL-based OLAP query language, SQL , has been defined.  ...  For example, the SQL query "SELECT SUM(Quantity),Nation(Supplier) FROM Purchases GROUP BY Nation(Supplier)" computes the total quantity of the purchases in the cube, grouped by the Nation level of the  ...  Introduction OLAP systems [20] enable powerful decision support based on multidimensional analysis of large amounts of detail data.  ... 
doi:10.1007/3-540-46145-0_24 fatcat:mza4tajshrauvj2g7ivm6eajqq

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  
Over the past generation, data warehousing and online analytical processing (OLAP) applications have become the cornerstone of contemporary decision support environments.  ...  Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP).  ...  In the OLAP domain, early work often focused on the development of algorithms for the efficient computation of the data cube.  ... 
doi:10.5626/jcse.2013.7.1.1 fatcat:26pyagf7wzcdfox2rlbpxlacsy

Effectively and efficiently supporting roll-up and drill-down OLAP operations over continuous dimensions via hierarchical clustering

Michelangelo Ceci, Alfredo Cuzzocrea, Donato Malerba
2013 Journal of Intelligent Information Systems  
Following this research trend, in this paper we propose a novel method, founded on a density-based hierarchical clustering algorithm, to support roll-up and drill-down operations over OLAP data cubes with  ...  Abstract In traditional OLAP systems, roll-up and drill-down operations over data cubes exploit fixed hierarchies defined on discrete attributes, which play the roles of dimensions, and operate along them  ...  This work is in partial fulfillment of the requirements of the Italian project VINCENTE PON02_00563_3470993 "A Virtual collective INtelligenCe ENvironment to develop sustainable Technology Entrepreneurship  ... 
doi:10.1007/s10844-013-0268-1 fatcat:cnjmsppqbzfh3kh4q5xbrn2fte

Range queries in OLAP data cubes

Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant
1997 Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97  
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions.  ...  By maintaining auxiliary information which is of the same size as the data cube, all range queries for a given cube can be answered in constant time, irrespective of the size of the sub-cube circumscribed  ...  Acknowledgment We wish to thank Prabhakar Raghavan and Sunita Sarawagi for their helpful comments.  ... 
doi:10.1145/253260.253274 dblp:conf/sigmod/HoAMS97 fatcat:36c65sldmvg5lfh6nuyk4bdyse

Range queries in OLAP data cubes

Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant
1997 SIGMOD record  
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions.  ...  By maintaining auxiliary information which is of the same size as the data cube, all range queries for a given cube can be answered in constant time, irrespective of the size of the sub-cube circumscribed  ...  Acknowledgment We wish to thank Prabhakar Raghavan and Sunita Sarawagi for their helpful comments.  ... 
doi:10.1145/253262.253274 fatcat:bjbyxr4atrdovaj6utbx3lbhli
« Previous Showing results 1 — 15 out of 285 results