96 search results - page 3 / 20 » PTIME Queries Revisited |
ADBIS
2005
Springer
13 years 11 months ago
2005
Springer
We present a query language called MDatalog, which is an extension of Datalog for multimodal deductive databases. We define modal relational algebras and give the seminaive evalua...
IDEAS
2007
IEEE
14 years 2 days ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
PKC
2012
Springer
11 years 8 months ago
2012
Springer
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established de...
NAACL
2010
13 years 3 months ago
2010
Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
ACTA
2002
13 years 5 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...