96 search results - page 11 / 20 » PTIME Queries Revisited |
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
WWW
2001
ACM
14 years 8 months ago
2001
ACM
We describe a new paradigm for performing search in context. In the IntelliZap system we developed, search is initiated from a text query marked by the user in a document she view...
DBPL
2007
Springer
13 years 11 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
STACS
2001
Springer
14 years 2 days ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ICDT
1997
ACM
13 years 11 months ago
1997
ACM
The paper introduces a model of the Web as an in nite, semistructured set of objects. We reconsider the classical notions of genericity and computability of queries in this new con...