Sciweavers

173 search results - page 10 / 35
» Range queries in dynamic OLAP data cubes
Sort
View
EDBT
2002
ACM
141views Database» more  EDBT 2002»
14 years 7 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
ICDE
1999
IEEE
118views Database» more  ICDE 1999»
14 years 8 months ago
Maintaining Data Cubes under Dimension Updates
OLAP systems support data analysis through a multidimensional data model, according to which data facts are viewed as points in a space of application-related dimensions", or...
Carlos A. Hurtado, Alberto O. Mendelzon, Alejandro...
EDBT
2000
ACM
13 years 11 months ago
Materialized View Selection for Multi-Cube Data Models
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
14 years 1 months ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire
ICDT
2001
ACM
153views Database» more  ICDT 2001»
13 years 12 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...