5130 search results - page 170 / 1026 » Constraint Query Languages |
SAC
2003
ACM
15 years 8 months ago
2003
ACM
We propose a predefined set of basic components for designing and implementing constraint solver cooperations and solver cooperation languages. Combining these components into pa...
147
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
135
click to vote
KES
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Access control for semi-structured data is nontrivial, as witnessed by the number of access control approaches in recent literature. Recently a case has been made for exp...
117
click to vote
COLING
1992
15 years 4 months ago
1992
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
134
click to vote
PODS
2000
ACM
15 years 7 months ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...