Sciweavers

78 search results - page 2 / 16
» Compressed Index for Dictionary Matching
Sort
View
STACS
2009
Springer
13 years 11 months ago
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. ...
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 5 months ago
Dictionary-based order-preserving string compression for main memory column stores
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...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SPIRE
2007
Springer
13 years 11 months ago
Indexing a Dictionary for Subset Matching Queries
Gad M. Landau, Dekel Tsur, Oren Weimann
LCTRTS
2005
Springer
13 years 10 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...
CPM
2010
Springer
114views Combinatorics» more  CPM 2010»
13 years 9 months ago
Small-Space 2D Compressed Dictionary Matching
Shoshana Neuburger, Dina Sokol