University of Leicester
Browse
invited_paper_3(1).pdf (238.09 kB)

Encoding Data Structures

Download (238.09 kB)
conference contribution
posted on 2015-05-07, 13:20 authored by Rajeev 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

Version

  • AM (Accepted Manuscript)

Published in

Lecture Notes in Computer Science

Publisher

Springer Verlag (Germany)

issn

0302-9743

isbn

978-3-319-15611-8;978-3-319-15612-5

Copyright date

1007

Available date

2016-02-25

Publisher version

http://link.springer.com/chapter/10.1007/978-3-319-15612-5_1

Notes

Abstract of invited talk.

Temporal coverage: start date

2015-02-26

Temporal coverage: end date

2015-02-28

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC