1759 search results - page 193 / 352 » Distributed Paging |
144
Voted
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
139
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
133
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
128
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
136
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...