150 search results - page 26 / 30 » Counting Results in Weak Formalisms |
LATA
2009
Springer
14 years 3 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
ICDT
2010
ACM
14 years 3 days ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
ICDT
2010
ACM
13 years 11 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
SACMAT
2009
ACM
14 years 3 months ago
2009
ACM
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...