Sciweavers

98 search results - page 5 / 20
» A Formal Model for the Problem of View Selection for Aggrega...
Sort
View
APWEB
2004
Springer
14 years 1 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
ICDT
2001
ACM
86views Database» more  ICDT 2001»
14 years 3 days ago
Minimizing View Sets without Losing Query-Answering Power
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, w...
Chen Li, Mayank Bawa, Jeffrey D. Ullman
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
13 years 12 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
13 years 12 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
Volker Markl, Frank Ramsak, Rudolf Bayer
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 7 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han