Sciweavers

59 search results - page 4 / 12
» Containment of conjunctive queries on annotated relations
Sort
View
PODS
2010
ACM
205views Database» more  PODS 2010»
14 years 16 days ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
JCSS
2008
73views more  JCSS 2008»
13 years 7 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...
ICDT
2001
ACM
110views Database» more  ICDT 2001»
13 years 12 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
PODS
2006
ACM
121views Database» more  PODS 2006»
14 years 7 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke
NAR
2007
109views more  NAR 2007»
13 years 7 months ago
GeneTrees: a phylogenomics resource for prokaryotes
The GeneTrees phylogenomics system pursues comparative genomic analyses from the perspective of gene phylogenies for individual genes. The GeneTrees project has the goal of provid...
Yuying Tian, Allan W. Dickerman