Sciweavers

1933 search results - page 6 / 387
» Query Containment Using Views
Sort
View
95
Voted
DATESO
2007
103views Database» more  DATESO 2007»
14 years 11 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
VLDB
2005
ACM
105views Database» more  VLDB 2005»
15 years 2 months ago
View Matching for Outer-Join Views
Prior work on computing queries from materialized views has focused on views defined by expressions consisting of selection, projection, and inner joins, with an optional aggrega...
Per-Åke Larson, Jingren Zhou
ERSHOV
2009
Springer
15 years 4 months ago
On the Containment Problem for Queries in Conjunctive Form with Negation
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
Victor Felea
VLDB
2007
ACM
152views Database» more  VLDB 2007»
15 years 9 months ago
Structured Materialized Views for XML Queries
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
Andrei Arion, Ioana Manolescu, Véronique Be...
VLDB
2007
ACM
118views Database» more  VLDB 2007»
15 years 9 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu