![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Regular Papers 2 The tableau construct plays a very important role in relational database theory. It is shown how this construct can be extended for tuple-timestamped relations. The expressive power of temporal tableau queries is compared with that of a temporal algebra. A temporal extension of the Homomorphism Theorem is given. ![]() DiSC'02 © 2003 Association for Computing Machinery |