Presentation 2013/3/11
Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate Large-Scale Sparse Matrices
Shin-ichi MINATO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) ZDD (Zero-suppressed Binary Decision Diagram) is known as an efficient data structure for representing and manipulating large-scale sets of combinations. In this article, we propose a method of using skip links to accelerate ZDD traversals for manipulating large-scale sparse matrices. We discuss average case complexity analysis of our method, and present the optimal parameter setting. Our method can be easily implemented into the existing ZDD packages just by adding one link per ZDD node. Experimental results show that we obtained dozens of acceleration ratio for the instances of the large-scale sparse matrices including thousands of items.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) ZDD / large-scale sparse matrix / skip link / set of combinations / average case complexity analysis / frequent itemset
Paper # C0MP2012-55
Date of Issue

Conference Information
Committee COMP
Conference Date 2013/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate Large-Scale Sparse Matrices
Sub Title (in English)
Keyword(1) ZDD
Keyword(2) large-scale sparse matrix
Keyword(3) skip link
Keyword(4) set of combinations
Keyword(5) average case complexity analysis
Keyword(6) frequent itemset
1st Author's Name Shin-ichi MINATO
1st Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University:JST ERATO MINATO Discrete Structure Manipulation System Project()
Date 2013/3/11
Paper # C0MP2012-55
Volume (vol) vol.112
Number (no) 498
Page pp.pp.-
#Pages 8
Date of Issue