Sciweavers

173 search results - page 13 / 35
» Consistent Query Answering in Data Warehouses
Sort
View
VLDB
2000
ACM
129views Database» more  VLDB 2000»
14 years 1 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
EDBTW
2006
Springer
14 years 1 months ago
Preference-Driven Querying of Inconsistent Relational Databases
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...
CIKM
2009
Springer
14 years 2 months ago
Answering XML queries using materialized views revisited
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 3 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
PODS
1998
ACM
116views Database» more  PODS 1998»
14 years 1 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka