552 search results - page 6 / 111 » Efficient Algorithms for Processing XPath Queries |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
167
click to vote
ICDE
2008
IEEE
15 years 10 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...
159
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
TDM
2004
14 years 10 months ago
2004
This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how extending the Te...
169
click to vote
ICDE
2005
IEEE
15 years 10 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...