35 search results - page 4 / 7 » Containment of Conjunctive Queries over Conceptual Schemata |
ALT
2000
Springer
13 years 12 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
PODS
2010
ACM
14 years 20 days ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
PODS
2010
ACM
14 years 20 days ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
JCSS
2008
13 years 7 months ago
2008
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
JODS
2006
13 years 7 months ago
2006
While providing a uniform syntax and a semistructured data model, XML does not express semantics but only structure such as nesting information. In this paper, we consider the prob...