Minutes from the meeting of 7/9

Attending: Serge,Jason,Yue,Vasilis,Janet

Jason and Vasilis presented their view maintainance algorithm in 
pesudocode format and we discussed the cases where the base updates
are 'addedge' and 'deledge'. Here are few points raised:

1. the output of the algorithm is a list of Lorel update statement.
the efficiency of exucuting those statement largely depends on what
kind of job the optimizer can do.

2. the current algorithm generate 'basic' update statements that are
guaranteed to be correct. optimizations could be done later, for
example, pushing some of the conditions from 'where clause' to 'from clause'.

3. the algorithm assumes that it uses the 'current' database: the database
AFTER the one (or a batch) of updates is performed. to process more than
one deletions, the algorithm sometimes needs the before inmage of the 
database: before any update is performed.