Issue No. 06 - November/December (1999 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.824609
<p><b>Abstract</b>—We present an approach, named MAP21, which uses standard <tmath>$\rm B^+$</tmath>-trees to provide efficient indexing of valid time ranges. The MAP21 approach is based on mapping one dimensional ranges to one dimensional points where the lexicographical order among the ranges is preserved. The proposed approach may employ more than one tree, each indexing a disjoint subset of the indexed data. When compared to the Time Index and the <tmath>$\rm R^*$</tmath>-tree we show that MAP21's performance is comparable to or better than those, depending on the type of query. In terms of storage, MAP21's structure was less than 10 percent larger than the <tmath>$\rm R^*$</tmath>-tree's and much smaller than the Time Index's. The main contribution of this paper though, is to show that standard <tmath>$\rm B^+$</tmath>-trees, available in virtually any DBMS, can be used to provide an efficient temporal index.</p>
Temporal databases, access structures, indexing, $\rm B^+$-trees, R-trees.
Mario A. Nascimento, Margaret H. Dunham, "Indexing Valid Time Databases via B+-Trees", IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. , pp. 929-947, November/December 1999, doi:10.1109/69.824609