Add to ORKGPath constraints have been studied in [3, 8, 9] for semi-structured data. In this paper, we investigate path constraints for structured data. We show that there is interaction between path constraints and type constraints. In other words, results on path constraint implication in semistructured databases may no longer hold in the presence of types. We also investigate the class of word constraints for databases of two practical object-oriented data models. In particular, we present an abstraction of the databases in these models in terms of first-order logic, and establish the decidability of word constraint implication in these models
International audienceWe consider semistructured data as rooted edge-labeled directed graphs, and pa...
As a generalization of inclusion dependencies that are found in relational databases, word constrain...
International audienceWe consider semistructured data as multirooted edge-labelled directed graphs, ...
Path constraints have been studied in [3, 8, 9] for semi-structured data. In this paper, we investig...
Path constraints have been studied in [3, 8, 9] for semi-structured data. In this paper, we investig...
AbstractWe investigate a class of path constraints that is of interest in connection with both semis...
This dissertation introduces a path constraint language and investigates its associated implication ...
We present a class of path constraints of interest in connection with both structured and semistruct...
In [10], we introduced a path constraint language and established the undecidability of its associat...
This dissertation introduces a path constraint language and investigates its associated implication ...
We present a class of path constraints of interest in connection with both structured and semi-struc...
In [10], we introduced a path constraint language and established the undecidability of its associat...
As a generalization of inclusion dependencies that are found in relational databases, word constrain...
AbstractWe consider semistructured data as multirooted edge-labelled directed graphs, and path inclu...
We present a class of path constraints of interest in connection with both structured and semistruct...
International audienceWe consider semistructured data as rooted edge-labeled directed graphs, and pa...
As a generalization of inclusion dependencies that are found in relational databases, word constrain...
International audienceWe consider semistructured data as multirooted edge-labelled directed graphs, ...
Path constraints have been studied in [3, 8, 9] for semi-structured data. In this paper, we investig...
Path constraints have been studied in [3, 8, 9] for semi-structured data. In this paper, we investig...
AbstractWe investigate a class of path constraints that is of interest in connection with both semis...
This dissertation introduces a path constraint language and investigates its associated implication ...
We present a class of path constraints of interest in connection with both structured and semistruct...
In [10], we introduced a path constraint language and established the undecidability of its associat...
This dissertation introduces a path constraint language and investigates its associated implication ...
We present a class of path constraints of interest in connection with both structured and semi-struc...
In [10], we introduced a path constraint language and established the undecidability of its associat...
As a generalization of inclusion dependencies that are found in relational databases, word constrain...
AbstractWe consider semistructured data as multirooted edge-labelled directed graphs, and path inclu...
We present a class of path constraints of interest in connection with both structured and semistruct...
International audienceWe consider semistructured data as rooted edge-labeled directed graphs, and pa...
As a generalization of inclusion dependencies that are found in relational databases, word constrain...
International audienceWe consider semistructured data as multirooted edge-labelled directed graphs, ...