{"title":"The TI/R--Tree: a temporal--spatial access structure","authors":"V. Kouramajian, R. Elmasri","doi":"10.1145/1122018.1122061","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new indexing structure, called the TI/R-tree, which combines techniques used in temporal access structures with techniques used in spatial access structures to provide a suitable means for maintaining and retrieving the history of geographic data.The TI/R-tree uses features from both the time index [ElWK90, Kour94] and the R-tree [Gutt84]. It has a tree structure similar to the time index and maintains a set of linearly ordered indexing points on the time dimension. The leaf nodes of the TI/R-tree refer to logical buckets which are organized as incremental R-trees; that is, at certain time points only deltas are kept. This permits the reconstruction of R-trees at any time point by using a number of logical buckets.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"131 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 33","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1122018.1122061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we propose a new indexing structure, called the TI/R-tree, which combines techniques used in temporal access structures with techniques used in spatial access structures to provide a suitable means for maintaining and retrieving the history of geographic data.The TI/R-tree uses features from both the time index [ElWK90, Kour94] and the R-tree [Gutt84]. It has a tree structure similar to the time index and maintains a set of linearly ordered indexing points on the time dimension. The leaf nodes of the TI/R-tree refer to logical buckets which are organized as incremental R-trees; that is, at certain time points only deltas are kept. This permits the reconstruction of R-trees at any time point by using a number of logical buckets.