140 Hits in 5.7 sec

Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes

S. Geffner, D. Agrawal, A. El Abbadi, T. Smith
1999 Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)  
Range sum queries on data cubes are a powerful tool for analysis.  ...  A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions.  ...  The relative prefix sum approach is a new method for answering range sum queries on data cubes.  ... 
doi:10.1109/icde.1999.754948 dblp:conf/icde/GeffnerAAS99 fatcat:ekm3nqqaqrgdveootvzob34kh4

Space-Efficient Range-Sum Queries in OLAP [chapter]

Fredrik Bengtsson, Jingsen Chen
2004 Lecture Notes in Computer Science  
In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time update and using minimum space.  ...  The complexity for query is O(2 ℓd ) and for updates O((2 ℓ 2 ℓ √ n) d ) on a data cube of n d elements, where ℓ is a trade-off parameter. Our algorithm improve over previous best known results.  ...  Our work is a generalization of both the Space-Efficient Relative Prefix Sum [9] and the Space-Efficient Dynamic Data Cube [9] .  ... 
doi:10.1007/978-3-540-30076-2_9 fatcat:p3lkdknfcrcdtezrvfw4orvmue

A study on workload-aware wavelet synopses for point and range-sum queries

Michael Mathioudakis, Dimitris Sacharidis, Timos Sellis
2006 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP - DOLAP '06  
Further, we present the first known algorithm for constructing wavelet synopses for a special class of range-sum query workloads.  ...  Our experimental results, clearly justify the necessity for designing workload-aware algorithms, especially in the case of range-sum queries.  ...  They showed that the Haar decomposition deployed over the prefix sum array/cube of the data is in fact orthogonal with respect to the L2 norm over range-sum queries -this is not the case for the weighted  ... 
doi:10.1145/1183512.1183519 dblp:conf/dolap/MathioudakisSS06 fatcat:4r3dspg3yzf4bjn5swc3ynqf5y

Practical Trade-Offs for the Prefix-Sum Problem [article]

Giulio Ermanno Pibiri, Rossano Venturini
2020 arXiv   pre-print
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed.  ...  It is a classic problem in data structure design with a wide range of applications in computing from coding to databases.  ...  An OLAP system relies on the popular data cube model [15] , where the data is represented as a -dimensional array.  ... 
arXiv:2006.14552v3 fatcat:gppndmhwpvafjpmhsekob7pvli

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.  ...  However, updating the prefix sum cube is very expensive. To overcome this, the -tree was proposed by Chun et al. (Dynamic update cube for range-sum queries. Proc. Int. Conf.  ...  ACKNOWLEDGEMENT We would also like to thank Michele Mooney for her careful proof reading of this paper.  ... 
doi:10.1093/comjnl/bxr004 fatcat:2iayrokdcvbpxfpsdiamcdz7ya

Space-Efficient Data Cubes for Dynamic Environments [chapter]

Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi, Renato Pajarola
2000 Lecture Notes in Computer Science  
The first, Relative Prefix Sums (RPS), supports a constant response time for ad-hoc range sum queries on the data cube, while at the same time greatly reducing the update costs compared to prior approaches  ...  The second, the Dynamic Data Cube (DDC), guarantees a sub-linear cost for both range sum queries and updates.  ...  [8] have presented an elegant algorithm for computing range sum queries in data cubes which we call the Prefix Sum (PS) approach.  ... 
doi:10.1007/3-540-44466-1_3 fatcat:ebrsjwc3trbadom7nw2pevlh54

Integration Of Big Data And Cloud Computing To Detect Black Money Check Rotation With Range Aggregate Queries

K. Nithiya, S. Balaji
2016 International Journal Of Engineering And Computer Science  
Data Mining can process only Structured Data only. Big Data Approach is spoken all over the Paper.  ...  These massive amounts of data are called as a big data. Range-aggregate queries are to apply a certain aggregate function on all tuples within given query ranges.  ...  was the first to present Prefix-Sum Cube approach to solving the numeric data cube aggregation [4] problems in OLAP.  ... 
doi:10.18535/ijecs/v5i6.23 fatcat:zntsgpanubhvtbaebi36ekyc6i

The Dynamic Data Cube [chapter]

Steven Geffner, Divakant Agrawal, Amr El Abbadi
2000 Lecture Notes in Computer Science  
In a recent paper [GAES99], we have presented an algorithm for computing range sum queries in data cubes which we call the relative prefix sum approach.  ...  Ho, Agrawal, Megiddo and Srikant [HAMS97] have presented an elegant algorithm for computing range sum queries in data cubes which we call the prefix sum approach.  ...  In recent work, we presented the relative prefix sum approach [GAES99]. The relative prefix sum approach achieves O(1) complexity for queries and O(n d/2 ) for updates.  ... 
doi:10.1007/3-540-46439-5_17 fatcat:wrr4wgfxxzdcpk3xlketjvonva

Flexible Data Cubes for Online Aggregation [chapter]

Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
2001 Lecture Notes in Computer Science  
The proposed approach provides a modular framework for combining one-dimensional aggregation techniques to create spaceoptimal high-dimensional data cubes.  ...  Techniques were proposed recently that speed up aggregate range queries on MOLAP data cubes by storing pre-computed aggregates.  ...  RPS is improved by the Space-Efficient Relative Prefix Sum (SRPS) [17] which guarantees the same query and update costs as RPS, but uses less space.  ... 
doi:10.1007/3-540-44503-x_11 fatcat:rqsq6d2z7vd4ppjpftqe73cbdq

Beyond basic faceted search

Ori Ben-Yitzhak, Sivan Yogev, Nadav Golbandi, Nadav Har'El, Ronny Lempel, Andreas Neumann, Shila Ofek-Koifman, Dafna Sheinwald, Eugene Shekita, Benjamin Sznajder
2008 Proceedings of the international conference on Web search and web data mining - WSDM '08  
We see this capability as a step toward bringing OLAP capabilities, traditionally supported by databases over relational data, to the domain of free-text queries over metadata-rich content.  ...  We show that by reducing the problem to a recently solved tree-indexing scenario, data with correlated facets can be efficiently indexed and retrieved.  ...  We also thank former IBMers Andrei Broder, Nadav Eiron, Marcus Fontoura and Runping Qi for early discussions on this topic.  ... 
doi:10.1145/1341531.1341539 dblp:conf/wsdm/Ben-YitzhakGHLNOSSSY08 fatcat:l2q2szegcnd25p2rhkiwvkx6ca

Modeling and Querying Data Cubes on the Semantic Web [article]

Lorena Etcheverry and Silvia Silvia Gomez and Alejandro Vaisman
2015 arXiv   pre-print
In this paper we introduce a formal data model where the main object is the data cube, and define OLAP operations using this model, independent of the underlying representation of the cube.  ...  With the advent of initiatives such as Open Data and Open Government, organizations want to share their multidimensional data cubes and make them available to be queried online.  ...  QUERYING DATA CUBES We now present our proposal for querying data cubes on the semantic web.  ... 
arXiv:1512.06080v1 fatcat:2b26blwnmbe7thysv3kbz7evoi

Query optimization for OLAP-XML federations

Dennis Pedersen, Karsten Riis, Torben Bach Pedersen
2002 Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP - DOLAP '02  
The changing data requirements of today's dynamic business environments are not handled well by current OLAP systems.  ...  In this paper we present novel techniques for query optimization in federations of OLAP and XML databases.  ...  CONCLUSION AND FUTURE WORK Motivated by the need for federating external XML data with OLAP data, and the subsequent need for efficient query processing in such OLAP-XML federations, we have presented  ... 
doi:10.1145/583890.583899 dblp:conf/dolap/PedersenRP02 fatcat:k4txlt34pzbzlff6l7amil5sji

Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams

Jiawei Han, Yixin Chen, Guozhu Dong, Jian Pei, Benjamin W. Wah, Jianyong Wang, Y. Dora Cai
2005 Distributed and parallel databases  
Third, an efficient stream data cubing algorithm is developed which computes only the layers (cuboids) along a popular path and leaves the other cuboids for query-driven, on-line computation.  ...  For fast online multi-dimensional analysis of stream data, three important techniques are proposed for efficient and effective computation of stream cubes.  ...  We also tested it for some industry data sets and got similar performance results. However, we cannot discuss the results here due to the confidentiality of the data sets.  ... 
doi:10.1007/s10619-005-3296-1 fatcat:4voq77s7bresderdwky3ivmamq

Dimensional enrichment of statistical linked open data

Jovan Varga, Alejandro A. Vaisman, Oscar Romero, Lorena Etcheverry, Torben Bach Pedersen, Christian Thomsen
2016 Journal of Web Semantics  
On-Line Analytical Processing (OLAP) is a data analysis technique typically used for local and well-prepared data.  ...  There is already a considerable amount of statistical linked open data sets published using the RDF Data Cube Vocabulary (QB) which is designed for these purposes.  ...  Acknowledgments This research has been funded by the European Commission through the Erasmus Mundus Joint Doctorate "Information Technologies for Business Intelligence -Doctoral College" (IT4BI-DC) and  ... 
doi:10.1016/j.websem.2016.07.003 fatcat:rghuepxvxvcfzbwak554ye52pa

A foundation for spatial data warehouses on the Semantic Web

Nurefşan Gür, Torben Bach Pedersen, Esteban Zimányi, Katja Hose, Mark Gahegan
2018 Semantic Web Journal  
The paper also defines a number of Spatial OLAP (SOLAP) operators over QB4SOLAP cubes and provides algorithms for generating spatially extended SPARQL queries from the SOLAP operators.  ...  Large volumes of geospatial data are being published on the Semantic Web (SW), yielding a need for advanced analysis of such data.  ...  OLAP operators OLAP operators are used for expressing queries over data cubes. The traditional OLAP operators are given next.  ... 
doi:10.3233/sw-170281 fatcat:2i352cnkljh7nptkoo6pruljqq
« Previous Showing results 1 — 15 out of 140 results