241 search results - page 35 / 49 » Effective pruning for XML structural match queries |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- We investigate techniques to automatically decompose any XQuery query into subqueries, that can be executed near their data sources; i.e., function-shipping. In this sce...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...