Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential tools for efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed
Compact data structures: a practical approach
โ Scribed by Navarro, Gonzalo
- Publisher
- University of Cambridge
- Year
- 2016
- Tongue
- English
- Leaves
- 576
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential tools for efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed deployments and make better use of the limited memory in low-end devices. The field has developed rapidly, reaching a level of maturity that allows practitioners and researchers in application areas to benefit from the use of compact data structures. This first comprehensive book on the topic focuses on the structures that are most relevant for practical use. Readers will learn how the structures work, how to choose the right ones for their application scenario, and how to implement them. Researchers and students in the area will find in the book a definitive guide to the state of the art in compact data structures. -- Provided by publisher.;Introduction -- Entropy and coding -- Arrays -- Bitvectors -- Permutations -- Sequences -- Parentheses -- Trees -- Graphs -- Grids -- Texts -- Dynamic structures -- Recent trends.
โฆ Table of Contents
Introduction --
Entropy and coding --
Arrays --
Bitvectors --
Permutations --
Sequences --
Parentheses --
Trees --
Graphs --
Grids --
Texts --
Dynamic structures --
Recent trends.
โฆ Subjects
Computer algorithms;Data structures (Computer science);Electronic books
๐ SIMILAR VOLUMES
<p>The data structure is a set of specially organized data elements and functions, which are defined to store, retrieve, remove and search for individual data elements. <b><i>Data Structures using C: A Practical Approach for Beginners</i></b> covers all issues related to the amount of storage needed
<p>Much of current programming practice is basically empirical and ad hoc in approach. Each problem is tackled without relation to those that have gone before; experiences are made and stored as a series of fragments. Now, under the pressure of events, this unsatisfactory state of affairs is coming