458 search results - page 10 / 92 » Evaluation of partial path queries on xml data |
165
Voted
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
105
click to vote
PLANX
2007
15 years 1 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
73
Voted
ERCIMDL
2003
Springer
15 years 4 months ago
2003
Springer
As many metadata are encoded in XML, and many digital libraries need to manage XML documents, eļ¬cient techniques for searching in such formatted data are required. In order to eļ...
110
Voted
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
SIGMOD
2002
ACM
15 years 11 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...