147 search results - page 28 / 30 » Size Bounds and Query Plans for Relational Joins |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
PODS
2010
ACM
13 years 9 months ago
2010
ACM
Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the d...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
In GIS and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. However, most cardinal direction models are only able to h...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...