SIDI: A Scalable in-Memory Density-based Index for Spatial Databases

D. Nguyen, K. Doan, T. Pham
{"title":"SIDI: A Scalable in-Memory Density-based Index for Spatial Databases","authors":"D. Nguyen, K. Doan, T. Pham","doi":"10.1145/2912152.2912158","DOIUrl":null,"url":null,"abstract":"With wide-spread use of location-based services, spatial data is becoming popular. As the data is usually huge in volume and continuously arriving to the storage in real-time, designing systems for efficiently storing this type of data is challenging. Two major issues that make building such system become complicated are the skewed distribution of data and the need of scaling the storage on multiple machines. In this paper, we propose a novel scalable in-memory density-based index for spatial databases. The key principle underlying our design is the exploitation of the stable spatial distribution of the datasets to deploy a simple but efficient index structure. We used information extracted from data in the past to split the entire space into independent pieces with similar density to ensure load-balancing and scalability. Experimental results show that the proposed solution scales well in distributed environment and outperforms common indexes in many cases.","PeriodicalId":443897,"journal":{"name":"Proceedings of the ACM International Workshop on Data-Intensive Distributed Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM International Workshop on Data-Intensive Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2912152.2912158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

With wide-spread use of location-based services, spatial data is becoming popular. As the data is usually huge in volume and continuously arriving to the storage in real-time, designing systems for efficiently storing this type of data is challenging. Two major issues that make building such system become complicated are the skewed distribution of data and the need of scaling the storage on multiple machines. In this paper, we propose a novel scalable in-memory density-based index for spatial databases. The key principle underlying our design is the exploitation of the stable spatial distribution of the datasets to deploy a simple but efficient index structure. We used information extracted from data in the past to split the entire space into independent pieces with similar density to ensure load-balancing and scalability. Experimental results show that the proposed solution scales well in distributed environment and outperforms common indexes in many cases.
基于内存密度的可扩展空间数据库索引
随着基于位置的服务的广泛使用,空间数据变得越来越流行。由于数据量通常很大,并且不断地实时到达存储,因此设计有效存储此类数据的系统具有挑战性。使构建这样的系统变得复杂的两个主要问题是数据的倾斜分布和需要在多台机器上扩展存储。本文提出了一种新的基于内存密度的可扩展空间数据库索引。我们设计的关键原则是利用数据集的稳定空间分布来部署一个简单但有效的索引结构。我们使用过去从数据中提取的信息将整个空间分割成具有相似密度的独立块,以确保负载平衡和可伸缩性。实验结果表明,该方法在分布式环境下具有良好的可扩展性,在许多情况下优于常用指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信