Sciweavers

200 search results - page 1 / 40
» Datalog Queries of Set Constraint Databases
Sort
View
ICDT
1995
ACM
105views Database» more  ICDT 1995»
13 years 8 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 8 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 8 months ago
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
Georg Gottlob, Thomas Schwentick
JAPLL
2010
179views more  JAPLL 2010»
13 years 3 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
DKE
2010
167views more  DKE 2010»
13 years 4 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....