479 search results - page 69 / 96 » Efficient Processing of XML Tree Pattern Queries |
121
click to vote
WISE
2006
Springer
15 years 8 months ago
2006
Springer
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, th...
248
click to vote
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
104
click to vote
COLING
1996
15 years 4 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
155
click to vote
JACM
2008
15 years 2 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
230
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...