Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Succinct_data_structure> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Succinct_data_structure abstract "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 (unlike other compressed representations) 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 compressed data structure, in which the size of the data structure depends upon the particular data being represented.Suppose that is the information-theoretical optimal number of bits needed to store some data. A representation of this data is called implicit if it takes bits of space, succinct if it takes bits of space, and compact if it takes bits of space.Implicit structures are thus usually reduced to storing information using some permutation of the input data; the most well-known example of this is the heap.".
- Succinct_data_structure wikiPageID "10122951".
- Succinct_data_structure wikiPageRevisionID "595175141".
- Succinct_data_structure hasPhotoCollection Succinct_data_structure.
- Succinct_data_structure subject Category:Data_structures.
- Succinct_data_structure type Abstraction100002137.
- Succinct_data_structure type Arrangement105726596.
- Succinct_data_structure type Cognition100023271.
- Succinct_data_structure type DataStructure105728493.
- Succinct_data_structure type DataStructures.
- Succinct_data_structure type PsychologicalFeature100023100.
- Succinct_data_structure type Structure105726345.
- Succinct_data_structure comment "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 (unlike other compressed representations) still allows for efficient query operations. The concept was originally introduced by Jacobson to encode bit vectors, (unlabeled) trees, and planar graphs.".
- Succinct_data_structure label "Succinct data structure".
- Succinct_data_structure label "簡潔データ構造".
- Succinct_data_structure sameAs 簡潔データ構造.
- Succinct_data_structure sameAs m.02q2jd4.
- Succinct_data_structure sameAs Q7632678.
- Succinct_data_structure sameAs Q7632678.
- Succinct_data_structure sameAs Succinct_data_structure.
- Succinct_data_structure wasDerivedFrom Succinct_data_structure?oldid=595175141.
- Succinct_data_structure isPrimaryTopicOf Succinct_data_structure.