210 search results - page 40 / 42 » On Efficient Part-match Querying of XML Data |
DEBU
2008
13 years 7 months ago
2008
The Pathfinder project makes inventive use of relational database technology--originally developed to process data of strictly tabular shape--to construct efficient database-suppo...
JACM
2008
13 years 7 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
SIGMOD
2007
ACM
14 years 7 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
2007
IEEE
14 years 9 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...