News (2004)

News (2004)

CDB'04

• 1. Bart Kuijpers, Peter Revesz:

  2. Preface.

  3. CDB 2004 (LNCS 3074):

  4. V-VIII (June 2004)

     1. Applications. Looking at specific applications is important for two reasons. First, they reveal the possibilities of constraint database applications, often applications that could not be done in relational database systems. Second, they test the limits of the current constraint data model and query language proposals and thereby stimulate their further extensions. The following specific applications raise important issues and provide big challenges to researchers for the future.

        • Carson Kai-Sang Leung proposes a new dynamic FP-Tree mining algorithm to mine frequent itemsets satisfying succinct constraints. The proposed algorithm is dynamic, such that the constraints can be changed during the mining process. Based on a classification of constraints this paper describes the cases of relaxing and tightening constraints and evaluation results show the effectiveness of this approach.

• 1. Bart Kuijpers, Peter Revesz:

  2. Report on the 1st International Symposium on the Applications of Constraint Databases (CDB'04)

  3. ACM SIGMOD Record 34(2):

  4. 62-64 (June 2005)

     1. 3 Contributed papers

     2. 3.2 Applications of constraint databases

     3. Carson Kai-Sang Leung proposes, in the paper "Dynamic FP-Tree Based Mining of Frequent Patterns Satisfying Succinct Constraints," a new dynamic FP-Tree mining algorithm to mine frequent itemsets satisfying succinct constraints. The proposed algorithm is dynamic, that is, the constraints can be changed during the mining process. Based on a classification of constraints he describes the cases of relaxing and tightening constraints and extensive evaluation results showing the effectiveness of the new approach.