This week, we continued working on our implementation of the CBJ algorithm. We studied the hierarchy of algorithms based on consistency checks and also nodes visited. We discovered that, overall; FC-CBJ performs the best! We also began studying the similarities and differences between CSP's and Relational Databases. We went through the differences in terminology as well as went through examples of projection, selection, intersection, join, and union. Some of the main differences highlighted were:
CSP's have many relations while databases have only a few relations in a query, databases have a higher arity than CSP's typically, and databases have much larger domains than CSP's (to name a few!).
This week we are planning to finish comparing our implementations of the CBJ algorithm and begin our implementation of the FC-CBJ algorithm (first with static ordering then with dynamic ordering).
-Mary Burke
Mary, actually, this week it is still FC (static and dynamic). After that, we will move to FC-CBJ. Also, don't forget to review the definition of the property of Path Consistency! Let's discuss it, if you wish, @ 6:00 PM?
ReplyDelete