Sciweavers

654 search results - page 24 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
PODS
2005
ACM
104views Database» more  PODS 2005»
14 years 8 months ago
Views and queries: determinacy and rewriting
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Luc Segoufin, Victor Vianu
EDBT
2000
ACM
14 years 1 days ago
Navigation-Driven Evaluation of Virtual Mediated Views
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...
Bertram Ludäscher, Yannis Papakonstantinou, P...
CIKM
2007
Springer
14 years 2 months ago
SLOQUE: slot-based query expansion for complex questions
Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These qu...
Maggy Anastasia Suryanto, Ee-Peng Lim, Aixin Sun, ...
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
14 years 9 months ago
Cost-Driven General Join View Maintenance over Distributed Data Sources
Maintaining materialized views that have join conditions between arbitrary pairs of data sources possibly with cycles is critical for many applications. In this work, we model vie...
Bin Liu, Elke A. Rundensteiner
JAPLL
2010
179views more  JAPLL 2010»
13 years 6 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...