Sciweavers

710 search results - page 7 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
AVI
1998
13 years 9 months ago
Kaleidoquery: a visual query language for object databases
In this paper we describe Kaleidoquery, a visual query language for object databases with the same expressive power as OQL. We will describe the design philosophy behind the filte...
Norman Murray, Norman W. Paton, Carole A. Goble
CSL
2003
Springer
14 years 26 days ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
CDB
2004
Springer
158views Database» more  CDB 2004»
13 years 11 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
FOSSACS
2006
Springer
13 years 11 months ago
On the Relative Expressive Power of Asynchronous Communication Primitives
In this paper, we study eight asynchronous communication primitives, arising from the combination of three features: arity (monadic vs polyadic data), communication medium (messag...
Daniele Gorla
IANDC
2008
95views more  IANDC 2008»
13 years 7 months ago
Comparing communication primitives via their relative expressive power
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
Daniele Gorla