UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Efficient Representation and Encoding of Distributive Lattices

Thumbnail Image

Files

Sinnamon_Corwin.pdf (377.43 KB)

Date

2018-08-20

Authors

Sinnamon, Corwin

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a well-known class of partially-ordered sets having two natural operations called meet and join. Improving on all previous results, we develop an efficient data structure for distributive lattices that supports meet and join operations in O(log n) time, where n is the size of the lattice. The structure occupies O(n log n) bits of space, which is as compact as any known data structure and within a logarithmic factor of the information-theoretic lower bound by enumeration. The second representation is a bitstring encoding of a distributive lattice that uses approximately 1.26n bits. This is within a small constant factor of the best known upper and lower bounds for this problem. A lattice can be encoded or decoded in O(n log n) time.

Description

Keywords

succinct data structure, compact data structure, lattice, distributive lattice, partially-ordered set, persistence

LC Keywords

Citation

URI

http://hdl.handle.net/10012/13609

Collections

Theses
Computer Science