327 search results - page 37 / 66 » XML Tree Structure Compression |
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
APPINF
2003
13 years 9 months ago
2003
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
ICDE
2001
IEEE
14 years 9 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
DEXA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...