ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
A conventional materialized view blindly materializes and maintains all rows of a view, even rows that are never accessed. We propose a more flexible materialization strategy aime...
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
Tuple dropping, though commonly used for load shedding in most stream operations, is inadequate for m-way, windowed stream joins. The join output rate can be overly reduced becaus...
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
Different people or objects may share identical names in the real world, which causes confusion in many applications. It is a nontrivial task to distinguish those objects, especia...
102
click to vote
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
101
click to vote
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
In recent years there has been a great deal of interest in developing effective techniques for ad-hoc search and retrieval in structured repositories such as relational databases ...
104
click to vote
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
103
click to vote
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract breaches. To do so, the data custodian needs to transform its data. To determine the appropriate transforPrivacy preserving data mining so far has mainly mation, there are...
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
105
click to vote
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...