Proceedings ArticleDOI
Space-efficient static trees and graphs
Guy Jacobson
- pp 549-554
Reads0
Chats0
TLDR
Data structures that represent static unlabeled trees and planar graphs are developed, and there is no other structure that encodes n-node trees with fewer bits per node, as N grows without bound.Abstract:
Data structures that represent static unlabeled trees and planar graphs are developed. The structures are more space efficient than conventional pointer-based representations, but (to within a constant factor) they are just as time efficient for traversal operations. For trees, the data structures described are asymptotically optimal: there is no other structure that encodes n-node trees with fewer bits per node, as N grows without bound. For planar graphs (and for all graphs of bounded page number), the data structure described uses linear space: it is within a constant factor of the most succinct representation. >read more
Citations
More filters
Journal ArticleDOI
Compressed full-text indexes
Gonzalo Navarro,Veli Mäkinen +1 more
TL;DR: The relationship between text entropy and regularities that show up in index structures and permit compressing them are explained and the most relevant self-indexes are covered, focusing on how they exploit text compressibility to achieve compact structures that can efficiently solve various search problems.
Proceedings ArticleDOI
High-order entropy-compressed text indexes
TL;DR: A novel implementation of compressed suffix arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of n symbols over an alphabet σ, where each symbol is encoded by lg|σ| bits.
Proceedings ArticleDOI
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks
TL;DR: In this paper, a layered label propagation (LBP) algorithm is proposed to reorder very large graphs (billions of nodes) using task decomposition to perform aggressively on multi-core architecture, making it possible to compress graphs of more than 600 millions nodes in a few hours.
Journal ArticleDOI
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
TL;DR: The result presents for the first time an efficient index whose size is provably linear in the size of the text in the worst case, and for many scenarios, the space is actually sublinear in practice.
Proceedings ArticleDOI
Spectral bloom filters
Saar Cohen,Yossi Matias +1 more
TL;DR: The Spectral Bloom Filter is introduced, an extension of the original Bloom Filter to multi-sets, allowing the filtering of elements whose multiplicities are below a threshold given at query time.
References
More filters
Journal ArticleDOI
The book thickness of a graph
Frank R. Bernhart,Paul C. Kainen +1 more
TL;DR: The book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with other invariants such as thickness, genus, and chromatic number.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Succinct representations of graphs
Hana Galperin,Avi Wigderson +1 more
TL;DR: The main result is characterizing a large class of graph properties for which the respective “succinct problem” is NP-hard, and shows that the succinct versions of polynomially equivalent problems may not be polynomial equivalent.
Journal ArticleDOI
Efficient Storage and Retrieval by Content and Address of Static Files
TL;DR: Firm lower bounds are given to minimax measures of bits stored and bits accessed for each of four retrieval questions, and representations and algorithms for a bit-addressable machine which come within factors of two or three of attaining all four bounds at once for files of any size.
Journal ArticleDOI
On the succinct representation of graphs
TL;DR: It is shown that unlabeledPlanar graphs can be encoded using 12 n bits, and an asymptotically optimal representation is given for labeled planar graphs.