Light-Weight Indexing of General Bitemporal Data

• Authors: Rasa Bliujute;Christian S. Jensen;Simonas "altenis;Giedrius Slivinskas
• Venue: SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
• Year: 2000

Most data managed by existing, real-world database applications is time referenced. Often, two temporal aspects of data are of interest, namely valid time, when data is true in the mini-world, and transaction time, when data is current in the database, resulting in so-called bitemporal data. Like spatial data, bitemporal data thus has associated two-dimensional regions. Such data is in part naturally now relative: some data is true until the current time, and some data is part of the current database state. Therefore, unlike for spatial data, bitemporal data regions may grow continuously. Existing indices, e.g., B+- and R-trees, typically do not contend well with even small amounts of now-relative data.In contrast, the 4-R index presented in the paper is capable of indexing general bitemporal data efficiently. The different kinds of growing data regions are transformed into stationary regions, which are then indexed by R*-trees. Queries are also transformed to counter the data transformations, yielding a technique with perfect precision and recall. Performance studies indicate that the technique is competitive with the best existing index; and unlike this existing index, the new technique does not require extension of the DBMS kernel.