64 search results - page 1 / 13 » Compression of Partially Ordered Strings |
CONCUR
2003
Springer
13 years 10 months ago
2003
Springer
VLDB
1993
ACM
13 years 9 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
ORDER
2010
13 years 3 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...