Skip to main content

Engineering Hybrid DenseZDDs

  • Conference paper
  • First Online:
Experimental Algorithms (SEA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9685))

Included in the following conference series:

  • 1117 Accesses

Abstract

ZDDs (Zero-suppressed Binary Decision Diagrams) [Minato 93] have been proposed to store set families compactly. Though more compact than other representations, they still use large amount of memory to support dynamic operations such as taking union and intersection of set families. DenseZDDs and Hybrid DenseZDDs [Denzumi et al. 2014] have been proposed to compress the size of static and dynamic ZDDs, respectively. There exist however no implementations of Hybrid DenseZDDs and their practical performance is unknown. This paper engineers a practical implementation of Hybrid DenseZDDs. Because of our new compression algorithm, our new Hybrid DenseZDDs run in reasonable time using little working memory. Experimental results on the frequent itemset mining problem show that our algorithm uses 33 % of memory compared with a standard ZDD at the cost of 40 % increase in running time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://fimi.ua.ac.be/data/.

  2. 2.

    http://ddd.fit.cvut.cz/prj/Benchmarks/.

References

  1. Arroyuelo, D., Cánovas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 84–97. SIAM Press (2010)

    Google Scholar 

  2. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C–35(8), 677–691 (1986)

    Article  MATH  Google Scholar 

  3. Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, S.-I., Sadakane, K.: DenseZDD: a compact and fast index for families of sets. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 187–198. Springer, Heidelberg (2014)

    Google Scholar 

  4. Hansen, E.R., Rao, S.S., Tiedemann, P.: Compressing binary decision diagrams. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 799–800. ACM (2008)

    Google Scholar 

  5. Joannou, S., Raman, R.: Dynamizing succinct tree representations. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 224–235. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Minato, S.: Fast factorization method for implicit cube set representation. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 15(4), 377–384 (1996)

    Article  MathSciNet  Google Scholar 

  7. Minato, S.-I.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceeding of Design Automation Conference (DAC 1993), pp. 272–277. IEEE (1993)

    Google Scholar 

  8. Minato, S.-I.: Zero-suppressed BDDs and their applications. J. Softw. Tools Technol. Transf. 3(2), 156–170 (2001)

    MATH  Google Scholar 

  9. Minato, S.-I.: SAPPORO BDD package. Hokkaido University (2011). unreleased

    Google Scholar 

  10. Minato, S.-I., Arimura, H.: Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs. In: Džeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol. 4747, pp. 152–169. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Minato, S.-I., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient boolean function manipulation. In: Proceedings of the 27th Design Automation Conference (DAC 1990), pp. 52–57. IEEE (1990)

    Google Scholar 

  12. Minato, S.-I., 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)

    Chapter  Google Scholar 

  13. Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. ACM Trans. Algorithms, 10(3) (2014). Article No. 16. doi:10.1145/2601073

    Google Scholar 

  14. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Taito Lee , Shuhei Denzumi or Kunihiko Sadakane .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Lee, T., Denzumi, S., Sadakane, K. (2016). Engineering Hybrid DenseZDDs. In: Goldberg, A., Kulikov, A. (eds) Experimental Algorithms. SEA 2016. Lecture Notes in Computer Science(), vol 9685. Springer, Cham. https://doi.org/10.1007/978-3-319-38851-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-38851-9_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-38850-2

  • Online ISBN: 978-3-319-38851-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics