Merging Complete and Incomplete IP-Tables

There might be a situation that several types of IP-tables are used within a temporal database. In this case, one can expect complete and incomplete IP-tables to be merged at some stage. This cannot be done by using one of the algorithms that have been discussed in sections 7.5.1 and 7.5.2 but by a hybrid one that uses parts of both. Figure 7.19 shows the algorithm for the case that a complete IP-table I(R) is merged with an incomplete IP-table I'(Q,b). The result is necessarily an incomplete IP-table because the information of I'(Q,b) is already incomplete. Therefore notations like , and N' are used rather than , or N. The algorithm is structured similarly to the ones in figures 7.17 and 7.18 and applies (7.17) only to I'(Q,b).