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. © 2014 Springer International Publishing.
CITATION STYLE
Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, S. I., & Sadakane, K. (2014). DenseZDD: A compact and fast index for families of sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8504 LNCS, pp. 187–198). Springer Verlag. https://doi.org/10.1007/978-3-319-07959-2_16
Mendeley helps you to discover research relevant for your work.