Sciweavers

109 search results - page 21 / 22
» Optimization Using Tuple Subsumption
Sort
View
PODS
2000
ACM
179views Database» more  PODS 2000»
13 years 9 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
13 years 9 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
ICDE
2010
IEEE
266views Database» more  ICDE 2010»
13 years 5 months ago
Ranking for data repairs
Abstract— Improving data quality is a time-consuming, laborintensive and often domain specific operation. A recent principled approach for repairing dirty database is to use dat...
Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Nevi...
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 5 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
LCPC
2000
Springer
13 years 9 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips