{"title":"一个使用动态递归空间分区的空间索引结构","authors":"A. Al-Badarneh, Abdullah Al-Alaj","doi":"10.1109/INNOVATIONS.2011.5893828","DOIUrl":null,"url":null,"abstract":"Generally, one spatial index structure (called Single Big Index SBI) is built for the whole data space; therefore most of the index nodes are prone to be checked during query execution. In this paper, we proposed a technique to partition the space into groups and construct a set of small indices (called Multi Small-Index MSI), one for each group. Such that we can quickly access query-relevant objects through their corresponding small index in the MSI and ignore irrelevant ones. Experimental results showed that, for small query regions, MSI structure outperforms the SBI structure.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A spatial index structure using dynamic recursive space partitioning\",\"authors\":\"A. Al-Badarneh, Abdullah Al-Alaj\",\"doi\":\"10.1109/INNOVATIONS.2011.5893828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generally, one spatial index structure (called Single Big Index SBI) is built for the whole data space; therefore most of the index nodes are prone to be checked during query execution. In this paper, we proposed a technique to partition the space into groups and construct a set of small indices (called Multi Small-Index MSI), one for each group. Such that we can quickly access query-relevant objects through their corresponding small index in the MSI and ignore irrelevant ones. Experimental results showed that, for small query regions, MSI structure outperforms the SBI structure.\",\"PeriodicalId\":173102,\"journal\":{\"name\":\"2011 International Conference on Innovations in Information Technology\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Innovations in Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INNOVATIONS.2011.5893828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Innovations in Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INNOVATIONS.2011.5893828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
摘要
一般为整个数据空间构建一个空间索引结构(Single Big index SBI);因此,在查询执行期间,大多数索引节点都容易被检查。在本文中,我们提出了一种技术,将空间划分为组,并构造一组小指标(称为多小指标MSI),每组一个。这样我们可以通过MSI中相应的小索引快速访问与查询相关的对象,而忽略不相关的对象。实验结果表明,对于较小的查询区域,MSI结构优于SBI结构。
A spatial index structure using dynamic recursive space partitioning
Generally, one spatial index structure (called Single Big Index SBI) is built for the whole data space; therefore most of the index nodes are prone to be checked during query execution. In this paper, we proposed a technique to partition the space into groups and construct a set of small indices (called Multi Small-Index MSI), one for each group. Such that we can quickly access query-relevant objects through their corresponding small index in the MSI and ignore irrelevant ones. Experimental results showed that, for small query regions, MSI structure outperforms the SBI structure.