Sciweavers

62 search results - page 11 / 13
» Optimization of Relational Schemas Containing Inclusion Depe...
Sort
View
DCC
2004
IEEE
14 years 7 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
ACTAC
1998
71views more  ACTAC 1998»
13 years 7 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 8 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 7 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
ISPASS
2006
IEEE
14 years 1 months ago
Workload sanitation for performance evaluation
The performance of computer systems depends, among other things, on the workload. Performance evaluations are therefore often done using logs of workloads on current productions s...
Dror G. Feitelson, Dan Tsafrir