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.
- Tweet
Details 詳細情報について
-
- CRID
- 1050577309353008896
-
- NII Article ID
- 120006659589
-
- ISSN
- 03029743
-
- HANDLE
- 10061/11191
-
- Text Lang
- en
-
- Article Type
- conference paper
-
- Data Source
-
- IRDB
- CiNii Articles