Compact Data Structures with Fast Queries

DMCA

Compact Data Structures with Fast Queries (2005)

Cached

Save to List
Add to Collection
Correct Errors
Monitor Changes

by Daniel K. Blandford , Christos Faloutsos , Danny Sleator

Citations:

4 - 0 self

BibTeX

@TECHREPORT{Blandford05compactdata,
    author = {Daniel K. Blandford and Christos Faloutsos and Danny Sleator},
    title = {Compact Data Structures with Fast Queries},
    institution = {},
    year = {2005}
}

OpenURL

Abstract

Many applications dealing with large data structures can benefit from keeping them in compressed form. Compression has many benefits: it can allow a representation to fit in main memory rather than swapping out to disk, and it improves cache performance since it allows more data to fit into the cache. However, a data structure is only useful if it allows the application to perform fast queries (and updates) to the data.

Keyphrases

fast query compact data structure many benefit large data structure many application cache performance main memory compressed form data structure

DMCA