302
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
293
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
321
Voted
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
319
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper, we propose a new model for coherent clustering of gene expression data called reg-cluster. The proposed model allows (1) the expression profiles of genes in a clust...
275
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
The problem of frequently updating multi-dimensional indexes arises in many location-dependent applications. While the R-tree and its variants are one of the dominant choices for ...
287
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
316
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
339
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
343
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...