327 search results - page 33 / 66 » XML Tree Structure Compression |
121
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
158
click to vote
DAGSTUHL
1996
15 years 5 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
189
Voted
DMKD
2004
ACM
15 years 10 months ago
2004
ACM
Data mining has been widely recognized as a powerful tool to explore added value from large-scale databases. One of data mining techniques, generalized association rule mining wit...
150
click to vote
ICDT
2003
ACM
15 years 9 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
139
click to vote
SIS
2004
15 years 5 months ago
2004
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...