M.A. Nascimento and M. H. Dunham. Indexing valid time databases via B + - trees -- the MAP21 approach. Technical Report CSE-97-08, School of Engineering and Applied Sciences, Southern Methodist University, 1997. Available at URL  Home/Search   Document Details and Download   Summary   Related Articles

....spatial data. Secondly, centering our discussion on the inclusion type of query, we provide a simple yet competitive way (when compared to the R tree) of using two B trees (possibly but not necessarily hosted under distinct disks) to process such type of queries. In our previous work [ND97] we designed an indexing approach, built on top of a B tree, which allows the indexing of temporal ranges. Such an approach, named MAP21, is based on mapping the two end points of a range to a single point and using this as the indexing value for the range. We have shown that under simple ....

....simple formula for 2dMAP21 s expected query processing time. Finally, in [ND96] only synthetic data sets were used, in this paper we explore 2dMAP21 s performance using real data sets. In the next Section we present a review of the MAP21 approach (for a thorough introduction we refer the reader to [ND97]) In Section 3, we present the 2dMAP21 approach, focusing on the inclusion type of query (notice that others can be processed as well) Section 4 presents a performance analysis, using both synthetic and real data. We conclude the paper in Section 5. 2 Review of the MAP21 Approach MAP21 maps the ....

[Article contains additional citation context not shown here]

M.A. Nascimento and M. H. Dunham. Indexing valid time databases via B + - trees -- the MAP21 approach. Technical Report CSE-97-08, School of Engineering and Applied Sciences, Southern Methodist University, 1997. Available at URL

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC