Paper Info
Title
Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets.
Abstract
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 Z-Skip-Links to accelerate ZDD traversals for manipulating large-scale sparse datasets. 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 datasets including thousands of items.
Year
DOI
Venue
2013
10.1007/978-3-642-40450-4_62
ALGORITHMS - ESA 2013
Field
DocType
Volume
Discrete mathematics,Average-case complexity,Data structure,Tree traversal,Computer science,Binary decision diagram,Algorithm,Acceleration
Conference
8125
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
1
1
Name
Order
Citations
PageRank
Shin-ichi Minato172584.72