Lecture Notes in Computer Science, 2006, Volume 4012/2006, 169-181, DOI: 10.1007/11780496_20

Efficient Database Analysis Using VSOP Calculator Based on Zero-Suppressed BDDs

Shin-ichi Minato

View Related Documents

Abstract

Manipulation of large-scale combinatorial data is one of the important fundamental technique for web information retrieval, integration, and mining. Recently, we proposed a new approach based on Zero-suppressed BDDs (Binary Decision Diagrams) for efficient database analysis. In this paper, we present VSOP program developed for calculating combinatorial item sets specified by symbolic expressions. Based on ZBDD techniques, VSOP can efficiently handle large-scale sum-of-products expressions with a number of item symbols. VSOP supports not only Boolean set operations but also numerical arithmetic operations based on Valued-Sum-Of-Products algebra, such as addition, subtraction, multiplication, division, numerical comparison, etc. VSOP will facilitate research and development for various database analysis problems.

Fulltext Preview

Image of the first page of the fulltext document