Sciweavers

525 search results - page 3 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
ICDT
2009
ACM
108views Database» more  ICDT 2009»
14 years 7 months ago
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
Christoph Koch
SIGMOD
2008
ACM
119views Database» more  SIGMOD 2008»
14 years 6 months ago
Modeling and querying probabilistic XML data
Benny Kimelfeld, Yehoshua Sagiv
SIGMOD
2005
ACM
88views Database» more  SIGMOD 2005»
14 years 6 months ago
Foundations of probabilistic answers to queries
Dan Suciu, Nilesh N. Dalvi
DBPL
2007
Springer
91views Database» more  DBPL 2007»
14 years 13 days ago
Relational Completeness of Query Languages for Annotated Databases
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
Floris Geerts, Jan Van den Bussche
ICDE
2004
IEEE
89views Database» more  ICDE 2004»
14 years 7 months ago
Nested Queries and Quantifiers in an Ordered Context
We present algebraic equivalences that allow to unnest nested algebraic expressions for order-preserving algebraic operators. We illustrate how these equivalences can be applied s...
Norman May, Sven Helmer, Guido Moerkotte