Compressed data structure
The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure whose operations are roughly as fast as those of a conventional data structure for the problem, but whose size can be substantially smaller. The size of the compressed data structure is typically highly dependent upon the entropy of the data being represented.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Compressed data structure
The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure whose operations are roughly as fast as those of a conventional data structure for the problem, but whose size can be substantially smaller. The size of the compressed data structure is typically highly dependent upon the entropy of the data being represented.
has abstract
Le terme structure de données ...... pie des données à représenter.
@fr
The term compressed data struc ...... than most compression schemes.
@en
Wikipage page ID
24,757,213
page length (characters) of wiki page
Wikipage revision ID
872,665,479
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
Le terme structure de données ...... pie des données à représenter.
@fr
The term compressed data struc ...... of the data being represented.
@en
label
Compressed data structure
@en
Structure de données compressée
@fr