Sciweavers

861 search results - page 1 / 173
» Relational Completeness of Query Languages for Annotated Dat...
Sort
View
DBPL
2007
Springer
91views Database» more  DBPL 2007»
13 years 9 months 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
JAPLL
2010
98views more  JAPLL 2010»
13 years 2 months ago
On database query languages for K-relations
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
Floris Geerts, Antonella Poggi
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 4 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 3 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
GVD
2009
125views Database» more  GVD 2009»
13 years 1 months ago
A quantum logic-based query processing approach for extending relational query languages
Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an eva...
Sebastian Lehrack