Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, S., Sadakane, K.: A compact and fast index structure for families of sets. Tech. rep., TCS Technical Report Series A, TCS-TR-A-14-71, Division of Computer Science, Hokkaido University (2014), http://www-alg.ist.hokudai.ac.jp/tra.html
Denzumi, S., Yoshinaka, R., Arimura, H., Minato, S.: Notes on sequence binary decision diagrams: Relationship to acyclic automata and complexities of binary set operations. In: Prague Stringology Conference 2011, Prague, pp. 147–161 (2011)
Elias, P.: Universal codeword sets and representation of the integers. IEEE Transactions on Information Theory IT-21(2), 194–203 (1975)
Hansen, E.R., Rao, S.S., Tiedemann, P.: Compressing binary decision diagrams. In: 18th European Conference on Artificial Intelligence, pp. 799–800 (2008)
Knuth, D.E.: Combinatorial Algorithms, part 1, 1st edn. The Art of Computer Programming, vol. 4A. Addison-Wesley Professional, Boston (2011)
Maruyama, S., Nakahara, M., Kishiue, N., Sakamoto, H.: ESP-index: A compressed index based on edit-sensitive parsing. Journal of Discrete Algorithms (2013)
Mateu-Villarroya, P., Prades-Nebot, J.: Lossless image compression using ordered binary-decision diagrams. Electronics Letters 37, 162–163 (2001)
Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th International Design Automation Conference, pp. 272–277 (1993)
Minato, S.: SAPPORO BDD package. Division of Computer Science, Hokkaido University (2012) (to be released)
Minato, S.: Z-skip-links for fast traversal of zdds representing large-scale sparse datasets. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 731–742. Springer, Heidelberg (2013)
Minato, S., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient Boolean function manipulation. In: 27th International Design Automation Conference, pp. 52–57 (1990)
Minato, S., Uno, T., Arimura, H.: LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 234–246. Springer, Heidelberg (2008)
Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Ninth Workshop on Algorithm Engineering and Experiments, pp. 60–70 (2007)
Starkey, M., Bryant, R.: Using ordered binary-decision diagrams for compressing images and image sequences. Tech. Rep. CMU-CS-95-105, Carnegie Mellon University (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, Si., Sadakane, K. (2014). DenseZDD: A Compact and Fast Index for Families of Sets. In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-07959-2_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07958-5
Online ISBN: 978-3-319-07959-2
eBook Packages: Computer ScienceComputer Science (R0)