<--- Back to Details
First PageDocument Content
Computing / Computer programming / Suffix tree / Succinct data structure / Rope / Entropy / Information theory / Koorde / Segment tree / Data structures / Binary trees / Information
Date: 2006-02-14 10:47:14
Computing
Computer programming
Suffix tree
Succinct data structure
Rope
Entropy
Information theory
Koorde
Segment tree
Data structures
Binary trees
Information

Add to Reading List

Source URL: www.dmi.unisa.it

Download Document from Source Website

File Size: 215,09 KB

Share Document on Facebook

Similar Documents

Data management / Computing / Data / Structured storage / NoSQL / Database management systems / Distributed computing architecture / Wavelet Tree / Compressed suffix array / MongoDB / Apache Cassandra / Compressed data structure

Succinct: Enabling Queries on Compressed Data Rachit Agarwal, Anurag Khandelwal, and Ion Stoica, University of California, Berkeley https://www.usenix.org/conference/nsdi15/technical-sessions/presentation/agarwal This pa

DocID: 1mlRY - View Document

A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets Prayaag Venkat∗ Abstract A data structure is said to be succinct if it uses an

DocID: 18FmH - View Document

Entropy / Information theory / Randomness / Succinct data structure / Linguistics / String / Mathematics / Computing / Philosophy of thermal and statistical physics / Data structures / Statistical theory

Outline Statistical Encoding of Succinct Data Structures ´ 1 Rodrigo Gonzalez

DocID: 15J38 - View Document

Searching / Indexing / Search engine indexing / Succinct data structure / Information science / Data structures / Information retrieval

Outline Dynamic Entropy-Compressed Sequences and Full-Text Indexes ¨ Veli Makinen

DocID: 15GgP - View Document