2026-07-24T18:02:31Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12080 2024-03-06T10:49:18Z ddc:004 open_access

Storing Set Families More Compactly with Top ZDDs Matsuda, Kotaro Denzumi, Shuhei Sadakane, Kunihiko top tree Zero-suppressed Decision Diagram space-efficient data structure Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size. In some cases, however, the size of ZDDs for representing large set families becomes too huge to store them in the main memory. This paper proposes top ZDD, a novel representation of ZDDs which uses less space than existing ones. The top ZDD is an extension of top tree, which compresses trees, to compress directed acyclic graphs by sharing identical subgraphs. We prove that navigational operations on ZDDs can be done in time poly-logarithmic in ZDD size, and show that there exist set families for which the size of the top ZDD is exponentially smaller than that of the ZDD. We also show experimentally that our top ZDDs have smaller size than ZDDs for real data. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kotaro Matsuda and Shuhei Denzumi and Kunihiko Sadakane 2020 Is Part Of LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2020.6 urn:nbn:de:0030-drops-120809 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.6 eng https://creativecommons.org/licenses/by/3.0/legalcode