Sciweavers

1238 search results - page 43 / 248
» View-based query containment
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
ICDT
2005
ACM
130views Database» more  ICDT 2005»
15 years 3 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 3 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu
VLDB
2004
ACM
111views Database» more  VLDB 2004»
15 years 3 months ago
A Framework for Using Materialized XPath Views in XML Query Processing
XML languages, such as XQuery, XSLT and SQL/XML, employ XPath as the search and extraction language. XPath expressions often define complicated navigation, resulting in expensive...
Andrey Balmin, Fatma Özcan, Kevin S. Beyer, R...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
15 years 10 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche