Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-07959-2_16 | SEA |
Field | DocType | Volume |
Boolean function,Data mining,Computer science,Binary decision diagram,Theoretical computer science,Web information | Conference | 11 |
Issue | ISSN | Citations |
8 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 9 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuhei Denzumi | 1 | 13 | 3.01 |
| Jun Kawahara | 2 | 20 | 3.39 |
| Koji Tsuda | 3 | 1664 | 122.25 |
| Hiroki Arimura | 4 | 1130 | 92.90 |
| Shin-ichi Minato | 5 | 725 | 84.72 |
| Kunihiko Sadakane | 6 | 1776 | 128.47 |