14 search results - page 3 / 3 » The Data Complexity of Consistent Query Answering for Self-J... |
PVLDB
2010
13 years 3 months ago
2010
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
PODS
2008
ACM
14 years 4 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...