479 search results - page 29 / 96 » Efficient Processing of XML Tree Pattern Queries |
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...
JCSS
2007
13 years 9 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
VLDB
2006
ACM
14 years 9 months ago
2006
ACM
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...