This HTML5 document contains 27 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n9	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Compressed_data_structure

rdfs:label

Compressed data structure

rdfs:comment

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.

owl:sameAs

yago-res:Compressed_data_structure freebase:m.0808812

dbp:wikiPageUsesTemplate

dbt:Example_needed dbt:Citation_needed

dct:subject

dbc:Data_structures

prov:wasDerivedFrom

n9:Compressed_data_structure?oldid=1053967243&ns=0

dbo:wikiPageID

24757213

dbo:wikiPageLength

3370

dbo:wikiPageRevisionID

1053967243

dbo:wikiPageWikiLink

dbr:Prediction_by_partial_matching dbr:Compressed_suffix_array dbr:Succinct_data_structure dbr:Suffix_array dbr:Suffix_tree dbr:FM-index dbr:Data_structure dbr:Algorithm dbc:Data_structures dbr:Gzip dbr:Pattern_matching dbr:Computer_science dbr:Inverted_index dbr:Theoretical_computer_science

dbo:abstract

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. Important examples of compressed data structures include the compressed suffix array and the FM-index, both of which can represent an arbitrary text of characters T for pattern matching. Given any input pattern P, they support the operation of finding if and where P appears in T. The search time is proportional to the sum of the length of pattern P, a very slow-growing function of the length of the text T, and the number of reported matches. The space they occupy is roughly equal to the size of the text T in entropy-compressed form, such as that obtained by Prediction by Partial Matching or gzip. Moreover, both data structures are self-indexing, in that they can reconstruct the text T in a random access manner, and thus the underlying text T can be discarded. In other words, they simultaneously provide a compressed and quickly searchable representation of the text T. They represent a substantial space improvement over the conventional suffix tree and suffix array, which occupy many times more space than the size of T. They also support searching for arbitrary patterns, as opposed to the inverted index, which can support only word-based searches. In addition, inverted indexes do not have the self-indexing feature. An important related notion is that of a succinct data structure, which uses space roughly equal to the information-theoretic minimum, which is a worst-case notion of the space needed to represent the data. In contrast, the size of a compressed data structure depends upon the particular data being represented. When the data are compressible, as is often the case in practice for natural language text, the compressed data structure can occupy space very close to the information-theoretic minimum, and significantly less space than most compression schemes.

foaf:isPrimaryTopicOf

n9:Compressed_data_structure