74 search results - page 2 / 15 » Index Structures for Matching XML Twigs Using Relational Que... |
ADC
2008
Springer
13 years 6 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...
DATESO
2008
13 years 6 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
IDEAS
2010
IEEE
13 years 3 months ago
2010
IEEE
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...
DASFAA
2004
IEEE
13 years 8 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
DEXA
2006
Springer
13 years 8 months ago
2006
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...