99 search results - page 16 / 20 » On the complexity of division and set joins in the relationa... |
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
APAL
2008
13 years 8 months ago
2008
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
DBISP2P
2003
Springer
14 years 1 months ago
2003
Springer
When joining information provider peers to a peer-to-peer network, an arbitrary distribution is sub-optimal. In fact, clustering peers by their characteristics, enhances search and...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of di...