1039 search results - page 66 / 208 » Query reformulation with constraints |
160
click to vote
CAISE
2006
Springer
15 years 10 months ago
2006
Springer
Databases are continuously evolving environments, where design constructs are added, removed or updated quite often. Research has extensively dealt with the problem of database evo...
152
click to vote
DLOG
2007
15 years 8 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
259
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
In order to deal with inconsistent databases, a repair semantics defines a set of admissible database instances that restore consistency, while staying close to the original insta...
156
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
193
click to vote
COR
2008
15 years 5 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...