DenseZDD: A Compact and Fast Index for Families of Sets

In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set families is one of the important fundamental techniques for web information retrieval, integration, and mining. For this purpose, a special type of binary decision diagrams (BDDs), called Zero-suppressed BDDs (ZDDs), is used. However, current techniques for storing ZDDs require a huge amount of memory and membership operations are slow. This paper introduces DenseZDD, a compressed index for static ZDDs. Our technique not only indexes set families compactly but also executes fast member membership operations. We also propose a hybrid method of DenseZDD and ordinary ZDDs to allow for dynamic indices.

[1]  Hiroshi Sakamoto,et al.  ESP-index: A compressed index based on edit-sensitive parsing , 2011, J. Discrete Algorithms.

[2]  Shin-ichi Minato.  Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets , 2013, ESA.

[3]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[4]  Randy Bryant,et al.  Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences. , 1995 .

[5]  S. Srinivasa Rao,et al.  Compressing Binary Decision Diagrams , 2008, ECAI.

[6]  Masaaki Nagata,et al.  Zero-Suppressed Sentential Decision Diagrams , 2016, AAAI.

[7]  Kunihiko Sadakane,et al.  Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.

[8]  James Bailey,et al.  A binary decision diagram based approach for mining frequent subsequences , 2010, Knowledge and Information Systems.

[9]  Hiroki Arimura,et al.  LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation , 2008, PAKDD.

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[12]  Hiroki Arimura,et al.  Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations , 2016, Discret. Appl. Math..

[13]  J. Prades-Nebot,et al.  Lossless image compression using ordered binary-decision diagrams , 2001 .

[14]  Hiroki Arimura,et al.  Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations , 2011, Stringology.

[15]  Kunihiko Sadakane,et al.  Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.

[16]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[17]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[18]  Takeru Inoue,et al.  Graphillion: software library for very large sets of labeled graphs , 2014, International Journal on Software Tools for Technology Transfer.

[19]  Hiroki Arimura,et al.  Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs , 2006, KDID.

[20]  Nagisa Ishiura,et al.  Shared binary decision diagram with attributed edges for efficient Boolean function manipulation , 1990, 27th ACM/IEEE Design Automation Conference.