Sciweavers

327 search results - page 33 / 66
» XML Tree Structure Compression
Sort
View
SPIRE
2009
Springer
14 years 2 months ago
Directly Addressable Variable-Length Codes
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...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
DAGSTUHL
1996
13 years 9 months ago
Self-Organizing Data Structures
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...
Susanne Albers, Jeffery Westbrook
DMKD
2004
ACM
167views Data Mining» more  DMKD 2004»
14 years 1 months ago
FP-tax: tree structure based generalized association rule mining
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...
Iko Pramudiono, Masaru Kitsuregawa
ICDT
2003
ACM
126views Database» more  ICDT 2003»
14 years 1 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
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...
Wim Martens, Frank Neven
SIS
2004
13 years 9 months ago
Efficient Tree Search in Encrypted Data
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 ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...