861 search results - page 1 / 173 » Relational Completeness of Query Languages for Annotated Dat... |
DBPL
2007
Springer
14 years 5 months ago
2007
Springer
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 ...
JAPLL
2010
13 years 9 months ago
2010
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 ...
PODS
2009
ACM
14 years 11 months ago
2009
ACM
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 ...
SIGMOD
2007
ACM
14 years 11 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
GVD
2009
13 years 8 months ago
2009
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...