Sciweavers

427 search results - page 3 / 86
» Conjunctive Query Answering in EL using a Database System
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 5 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
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 5 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 5 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
DBISP2P
2005
Springer
132views Database» more  DBISP2P 2005»
13 years 7 months ago
Publish/Subscribe with RDF Data over Large Structured Overlay Networks
Abstract. We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queri...
Erietta Liarou, Stratos Idreos, Manolis Koubarakis
VLDB
2001
ACM
157views Database» more  VLDB 2001»
14 years 5 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy