1175 search results - page 55 / 235 » Querying by examples |
CTRSA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database en...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
KR
2010
Springer
14 years 2 months ago
2010
Springer
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
DBPL
1991
Springer
14 years 1 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...