Sciweavers

10414 search results - page 2000 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
15 years 10 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
SIGMOD
2003
ACM
124views Database» more  SIGMOD 2003»
15 years 10 months ago
Dynamic XML documents with distribution and replication
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
Serge Abiteboul, Angela Bonifati, Gregory Cobena, ...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 10 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
SIGMOD
2001
ACM
146views Database» more  SIGMOD 2001»
15 years 10 months ago
On Supporting Containment Queries in Relational Database Management Systems
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, ...
« Prev « First page 2000 / 2083 Last » Next »