{"title":"TI/R—树:一个时间—空间访问结构","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":"{\"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}","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
摘要
在本文中,我们提出一个新的索引结构,称为TI / r - tree,技术相结合用于时间访问结构与技术用于空间访问结构提供一个合适的方法来维护和检索的历史地理数据。TI/R-tree使用了时间索引[ElWK90, Kour94]和R-tree [Gutt84]的特征。它具有类似于时间索引的树状结构，并在时间维度上维护一组线性有序的索引点。TI/ r树的叶节点指的是被组织成增量r树的逻辑桶;也就是说，在特定的时间点只保留增量。这允许通过使用多个逻辑桶在任何时间点重构r树。
The TI/R--Tree: a temporal--spatial access structure
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
