Sciweavers

1125 search results - page 47 / 225
» Query Answering in Inconsistent Databases
Sort
View
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 10 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ICDE
2004
IEEE
118views Database» more  ICDE 2004»
14 years 10 months ago
A Peer-to-peer Framework for Caching Range Queries
Peer-to-peer systems are mainly used for object sharing although they can provide the infrastructure for many other applications. In this paper, we extend the idea of object shari...
Ozgur D. Sahin, Abhishek Gupta, Divyakant Agrawal,...
SAC
2006
ACM
14 years 2 months ago
Ontology-based integration for relational databases
In this paper, we show that representation and reasoning techniques used in traditional knowledge engineering and the emerging Semantic Web can play an important role for heteroge...
Dejing Dou, Paea LePendu
GPC
2010
Springer
14 years 3 months ago
Distributed Island-Based Query Answering for Expressive Ontologies
Scalability of reasoning systems is one of the main criteria which will determine the success of Semantic Web systems in the future. The focus of recent work is either on (a) expre...
Sebastian Wandelt, Ralf Möller
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher