posted on 2015-05-07, 13:20authored byRajeev Raman
In recent years, there has been an explosion of interest in
succinct data structures, which store the given data in compact or compressed
formats and answer queries on the data rapidly while it is still
in its compressed format. Our focus in this talk is to introduce encoding
data structures. Encoding data structures consider the data together
with the queries and aim to store only as much information about the
data as is needed to store the queries. Once this is done, the original data
can be deleted. In many cases, one can obtain space-efficient encoding
data structures even when the original data is incompressible.
History
Citation
Lecture Notes in Computer Science, 2015, 8973, pp. 1-7
Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science
Source
Algorithms and Computation - 9th International Workshop, WALCOM 2015. Dhaka, Bangladesh