Skip to main content
SpringerLink
Log in

A General Framework for Parallel Unary Operations on ZDDs

  • Conference paper
  • First Online:
Trends and Applications in Knowledge Discovery and Data Mining (PAKDD 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8643))

Included in the following conference series:

  • 2202 Accesses

Abstract

A zero-suppressed binary decision diagram is a compressed data structure that represents families of sets. There are various basic operations to manipulate families of sets over ZDDs such as union, intersection, and difference. They can be efficiently computed without decompressing ZDDs. Among them, there are many important unary operations such as computing the ZDD for all extremal sets (maximal sets or minimal sets) from an input ZDD. Unary operations are useful in various fields such as constraint programming, data mining, and artificial intelligence. Therefore, they must be efficiently computed. In this paper, we propose a general framework for parallel unary operations on ZDDs. We analyze the computational complexity and evaluate the effectiveness of our method by performing computational experiments.

Takahisa Toda – This work was supported by JSPS KAKENHI Grant Number 26870011.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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://research.nii.ac.jp/~uno/dualization.html, accessed on 14 Jan. 2014.

References

  1. Coudert, O.: Solving graph optimization problems with ZBDDs. In: The 1997 European Conference on Design and Test, Paris, France, pp. 224–228, March 1997

    Google Scholar 

  2. Knuth, D.: The Art of Computer Programming, vol. 4a. Addison-Wesley Professional, New Jersey (2011)

    Google Scholar 

  3. Sekine, K., Imai, H.: Counting the number of paths in a graph via BDDs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E80-A, 682–688 (1997)

    Google Scholar 

  4. Hardy, G., Lucet, C., Limnios, N.: K-terminal network reliability measures with binary decision diagrams. IEEE Trans. Reliab. 56(3), 506–515 (2007)

    Article  Google Scholar 

  5. Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., Tsuda, K., Minato, S.I., Hayashi, Y.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid 5(1), 102–111 (2014)

    Article  Google Scholar 

  6. Minato, S., Arimura, H.: Frequent closed item set mining based on zero-suppressed BDDs. Trans. Jpn. Soc. Artif. Intell. 22, 165–172 (2007)

    Article  Google Scholar 

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

  8. 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)

    Chapter  Google Scholar 

  9. Loekito, E., Bailey, J., Pei, J.: A binary decision diagram based approach for mining frequent subsequences. Knowl. Inf. Syst. 24(2), 235–268 (2010)

    Article  Google Scholar 

  10. van Dijk, T., Laarman, A., van de Pol, J.: Multi-core BDD operations for symbolic reachability. Electron. Notes Theor. Comput. Sci. 296, 127–143 (2013)

    Article  Google Scholar 

  11. Elbayoumi, M., Hsiao, M.S., ElNainay, M.: A novel concurrent cache-friendly binary decision diagram construction for multi-core platforms. In: Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1427–1430, March 2013

    Google Scholar 

  12. Toda, T.: Hypergraph transversal computation with binary decision diagrams. In: 12th International Symposium on Experimental Algorithms, Rome, Italy, June 2013

    Google Scholar 

  13. Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th ACM/IEEE Design Autiomation Conference (DAC-93), Dallas, Texas, USA, pp. 272–277, Jun 1993

    Google Scholar 

  14. Schröer, O., Wegener, I.: The theory of zero-suppressed BDDs and the number of knight’s tours. Formal Meth. Syst. Des. 13(3), 235–253 (1998)

    Article  Google Scholar 

  15. Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ERATO MINATO Discrete Structure Manipulation System Project, Japan Science and Technology Agency, Hokkaido University, Sapporo, 060-0814, Japan

    Shogo Takeuchi & Shin-ichi Minato

  2. Graduate School of Information Systems, The University of Electro-Communications, Chofu, Tokyo, 182-8585, Japan

    Takahisa Toda

  3. Graduate School of Information Science and Technology, Hokkaido University, Sapporo, 060-0814, Japan

    Shin-ichi Minato

Authors
  1. Shogo Takeuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takahisa Toda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shin-ichi Minato
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shogo Takeuchi .

Editor information

Editors and Affiliations

  1. National Chiao Tung University, Hsinchu, Taiwan

    Wen-Chih Peng

  2. Google Research, Mountain View, California, USA

    Haixun Wang

  3. University of Melbourne, Melbourne, Victoria, Australia

    James Bailey

  4. National Cheng Kung University, Tainan, Taiwan

    Vincent S. Tseng

  5. Japan Advanced Institute of Science and Technology, Nomi City, Japan

    Tu Bao Ho

  6. Nanjing University, Nanjing, China

    Zhi-Hua Zhou

  7. National Chengchi University, Taipei, Taiwan

    Arbee L.P. Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Takeuchi, S., Toda, T., Minato, Si. (2014). A General Framework for Parallel Unary Operations on ZDDs. In: Peng, WC., et al. Trends and Applications in Knowledge Discovery and Data Mining. PAKDD 2014. Lecture Notes in Computer Science(), vol 8643. Springer, Cham. https://doi.org/10.1007/978-3-319-13186-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13186-3_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13185-6

  • Online ISBN: 978-3-319-13186-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation