Sciweavers

14 search results - page 1 / 3
» Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Sort
View
DAWAK
2007
Springer
13 years 11 months ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
SSD
2005
Springer
105views Database» more  SSD 2005»
13 years 10 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 9 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
SIGMOD
2004
ACM
148views Database» more  SIGMOD 2004»
14 years 5 months ago
Vertical and Horizontal Percentage Aggregations
Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such lim...
Carlos Ordonez
DOLAP
2000
ACM
13 years 9 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer