Sciweavers

365 search results - page 8 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
176
Voted
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 9 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
BTW
2007
Springer
136views Database» more  BTW 2007»
15 years 3 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
CORR
2002
Springer
187views Education» more  CORR 2002»
14 years 9 months ago
Answer Sets for Consistent Query Answering in Inconsistent Databases
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
SSDBM
2008
IEEE
90views Database» more  SSDBM 2008»
15 years 3 months ago
Ontology Database: A New Method for Semantic Modeling and an Application to Brainwave Data
We propose an automatic method for modeling a relational database that uses SQL triggers and foreign-keys to efficiently answer positive semantic queries about ground instances for...
Paea LePendu, Dejing Dou, Gwen A. Frishkoff, Jiawe...
WAIM
2010
Springer
14 years 7 months ago
Query Processing with Materialized Views in a Traceable P2P Record Exchange Framework
Materialized views which are derived from base relations and stored in the database are often used to speed up query processing. In this paper, we leverage them in a traceable peer...
Fengrong Li, Yoshiharu Ishikawa