Sciweavers

1039 search results - page 84 / 208
» Query reformulation with constraints
Sort
View
DLOG
2011
14 years 8 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
JCSS
2000
71views more  JCSS 2000»
15 years 4 months ago
Path Constraints in Semistructured Databases
We investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically ...
Peter Buneman, Wenfei Fan, Scott Weinstein
257
Voted
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 6 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
SAC
2010
ACM
15 years 5 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
ACTA
2002
111views more  ACTA 2002»
15 years 5 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht