Sciweavers

710 search results - page 20 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
RTA
2000
Springer
13 years 11 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 7 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
SOFSEM
2009
Springer
14 years 4 months ago
Expressiveness of Multiple Heads in CHR
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiar...
CIKM
2006
Springer
13 years 11 months ago
A data stream language and system designed for power and extensibility
By providing an integrated and optimized support for user-defined aggregates (UDAs), data stream management systems (DSMS) can achieve superior power and generality while preservi...
Yijian Bai, Hetal Thakkar, Haixun Wang, Chang Luo,...
SP
1997
IEEE
134views Security Privacy» more  SP 1997»
13 years 12 months ago
A Logical Language for Expressing Authorizations
A major drawback of existing access control systems is that they have all been developed with a specific access control policy in mind. This means that all protection requirement...
Sushil Jajodia, Pierangela Samarati, V. S. Subrahm...