Compressed data structure

Known as: Compressed data structures 
The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2018
051019852018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
High-speed packet classification is crucial to the implementation of several advanced network services and protocols; many QoS… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 5
Is this relevant?
2015
2015
We consider the problem of storing a dynamic string S over an alphabetΣ = { 1, . . . , σ } in compressed form. Our representation… (More)
  • table 1
  • table 2
Is this relevant?
2015
2015
We study the orthogonal range searching problem on points that have a significant number of geometric repetitions, that is… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2012
2012
We describe recent breakthroughs in the field of compressed data structures, in which the data structure is stored in a… (More)
Is this relevant?
2012
2012
Entity relationship search at Web scale depends on adding dozens of entity annotations to each of billions of crawled pages and… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In a variety of applications, ranging from highspeed networks to massive databases, there is a need to maintain histograms and… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2006
2006
We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Consider a sequence <i>S</i> of <i>n</i> symbols drawn from an alphabet <i>A</i> = {1, 2,. . .,σ}, stored as a binary string of… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We design two compressed data structures for the full-text indexing problem that support efficient substring searches using… (More)
  • figure 1
  • figure 4
  • figure 6
Is this relevant?