327 search results - page 46 / 66 » XML Tree Structure Compression |
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
The XML support in relational databases and the SQL/XML language are still relatively new as compared to purely relational databases and traditional SQL. Today, most database user...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...