200 search results - page 29 / 40 » Datalog Queries of Set Constraint Databases |
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
ICDE
2010
IEEE
13 years 7 months ago
2010
IEEE
— Autonomous index management in native XML DBMSs has to address XML’s flexibility and storage mapping features, which provide a rich set of indexing options. Change of worklo...
ICDT
2010
ACM
14 years 4 months ago
2010
ACM
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
DAWAK
2001
Springer
13 years 12 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...