Sciweavers

44 search results - page 1 / 9
» Evaluating holistic aggregators efficiently for very large d...
Sort
View
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 5 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
VLDB
1999
ACM
159views Database» more  VLDB 1999»
13 years 9 months ago
Aggregation Algorithms for Very Large Compressed Data Warehouses
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
Jianzhong Li, Doron Rotem, Jaideep Srivastava
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 8 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
CCGRID
2004
IEEE
13 years 8 months ago
Serving queries to multi-resolution datasets on disk-based storage clusters
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
Xi Zhang, Tony Pan, Ümit V. Çataly&uum...
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
13 years 9 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny