DeepRead
Cover of Compact Data Structures

Compact Data Structures

Gonzalo Navarro · 2016

Programming and computer science › Databases and distributed data

#6,596 most recommended

About the book

This book covers compact data structures, which store data in space close to its information-theoretic minimum while still supporting efficient queries. Its scope runs from bitvectors and rank/select primitives to sequences, trees, graphs, and compressed full-text indexes. Subjects include the algorithms and data structures used to build and analyze these representations. Compact structures can match the query speed of classic pointer-based structures while using far less space, often approaching the entropy of the data. Many structures can be built from a few primitives, chiefly rank, select, and access, so one toolkit serves many problems. Compression and indexing can also be combined, so data can be searched without first being decompressed.

Written by Claude from what it knows of this book.

What Hacker News says 60% recommend · 0% critical

0242017201820202022202420252022 peak · 2
This bookAverage book in Databases and distributed data

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 2 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2016
ISBN
9781107152380
Editions known
6 at Open Library
Open Library
OL21134208W

Computer algorithmsData structures (Computer science)Data structures (computer science)

Explore in the mosaic

Read next: its neighbours on the mosaic