.png){kind=icon}
.png){kind=icon}
Return
Indexing valid time databases via B+-trees
.png){kind=icon}
PRE
AI
DOI：10.1109/69.824609.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an approach, named MAP21, which uses standard B+-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 R*-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 R*-tree's and much smaller than the Time Index's. The main contribution of this paper though, is to show that standard B+-trees, available in virtually any DBMS, can be used to provide an efficient temporal index.
Keywords:
temporal databases
access structures
indexing
B+-trees
R-trees
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W
Organization
No organization information available