Succinct data structure
id:
succinct-data-structure-312-5030793
title:
Succinct data structure
text:
In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but still allows for efficient query operations. The concept was originally introduced by Jacobson to encode bit vectors, (unlabeled) trees, and planar graphs. Unlike general lossless data compression algorithms, succinct data structures retain the ability to use them in-place, without decompressing them first. A related notion is that of a co
brand slug:
wiki
category slug:
encyclopedia
description:
Data structure which is efficient to both store in memory and query
original url:
https://en.wikipedia.org/wiki/Succinct_data_structure
date created:
date modified:
2024-04-18T02:28:27Z
main entity:
{"identifier":"Q7632678","url":"https://www.wikidata.org/entity/Q7632678"}
image:
fields total:
13
integrity:
14