43 search results - page 1 / 9 » Efficient vectorial operators for processing xml twig querie... |
WWW
2008
ACM
14 years 7 months ago
2008
ACM
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
DEXA
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...
DEXA
2005
Springer
14 years 3 days ago
2005
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
WWW
2005
ACM
14 years 7 months ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
ADC
2008
Springer
13 years 8 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...