Sciweavers

2850 search results - page 28 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 8 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
CIKM
2005
Springer
14 years 2 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 8 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 9 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
DOLAP
2009
ACM
14 years 3 months ago
View usability and safety for the answering of top-k queries via materialized views
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
Eftychia Baikousi, Panos Vassiliadis