Sciweavers

213 search results - page 8 / 43
» Querying Partially Sound and Complete Data Sources
Sort
View
DLOG
2011
12 years 11 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
AAAI
2007
13 years 10 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
CIKM
2001
Springer
14 years 1 days ago
Joint Optimization of Cost and Coverage of Query Plans in Data Integration
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
Zaiqing Nie, Subbarao Kambhampati
RR
2009
Springer
14 years 2 months ago
Distributed Resolution for Expressive Ontology Networks
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
Anne Schlicht, Heiner Stuckenschmidt
LPNMR
2005
Springer
14 years 1 months ago
Data Integration: a Challenging ASP Application
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
Nicola Leone, Thomas Eiter, Wolfgang Faber, Michae...