106
click to vote
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
115
click to vote
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
108
click to vote
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
Errors in estimating page counts can lead to poor choice of access methods and in turn to poor quality plans. Although there is past work in using execution feedback for accurate c...
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
120
click to vote
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
The management of privacy and security in the context of data stream management systems (DSMS) remains largely an unaddressed problem to date. Unlike in traditional DBMSs where acc...
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
Decreasing disk costs have made it practical to retain longlived snapshots, enabling new applications that analyze past states and infer about future states. Current approaches of...