239
click to vote
ICDE
2007
IEEE
16 years 5 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 ...
266
click to vote
ICDE
2007
IEEE
16 years 5 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 ...
247
click to vote
ICDE
2007
IEEE
16 years 5 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...
241
Voted
ICDE
2007
IEEE
16 years 5 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...
247
Voted
ICDE
2007
IEEE
16 years 5 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 ...
220
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
We address skyline and top-k processing in web interaction scenarios. We model the problem space based on game theory principles and present new algorithms and heuristics to reali...
244
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Ordinary people have access to unprecedented volumes of information today. Researchers in the fields of information management (IM) and human-computer interaction (HCI) are reacti...
221
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
The suitability of Peer-to-Peer (P2P) approaches for fulltext web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retri...