Compressed data structure

Known as: Compressed data structures

The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

We address the problem of positional indexing in the natural language domain. The positional inverted index contains the…

2016

Karp et al. (1988) described Deferred Data Structures for Multisets as "lazy" data structures which partially sort data, so that…

2015

For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed…

2015

Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main…

2013

The biggest cost of computing with large matrices in any modern computer is related to memory latency and bandwidth. The average…

2013

mining, term frequent pattern extraction is largely used for finding out association rules. Generally association rule mining…

2012

In this thesis we address the problem of the efficiency in Information Retrieval by presenting new compressed data structures and…

2010

We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They…

2006

We introduce two transformations T e x t 2 P o i n t s and P o i n t s 2 T e x t that, respectively, convert text to points in…

2006

Wireless networks have long ago surpassed their infancy, becoming eligible for sophisticated applications beyond common Web…