Sciweavers

367 search results - page 24 / 74
» Algorithms for selecting materialized views in a data wareho...
Sort
View
ICDE
2001
IEEE
115views Database» more  ICDE 2001»
14 years 9 months ago
Incremental Computation and Maintenance of Temporal Aggregates
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
Jun Yang 0001, Jennifer Widom
CIKM
2011
Springer
12 years 7 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
IS
2006
13 years 7 months ago
Incremental maintenance of aggregate and outerjoin expressions
Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several i...
Himanshu Gupta, Inderpal Singh Mumick
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
14 years 2 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