479 search results - page 61 / 96 » Efficient Processing of XML Tree Pattern Queries |
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
WWW
2005
ACM
14 years 10 months ago
2005
ACM
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...