Solving Intersection Searching problem for spatial data using bloom filters

Prerna Budhkar
{"title":"Solving Intersection Searching problem for spatial data using bloom filters","authors":"Prerna Budhkar","doi":"10.1109/CONECCT.2013.6469310","DOIUrl":null,"url":null,"abstract":"In a generalized Intersection Searching problem, a set S of spatial objects is pre-processed so that for a given a query object q, the question that whether q intersects with any object of S can be answered efficiently. A technique to solve Intersection Searching problem on spatial data using bloom filter is presented. Bloom filter on conventional data has been proved to be one of the most successful technique for solving set-membership problem. The presented method applies space filling curves on spatial objects to fetch appropriate information about these divisions. It then converts this information into a bloom filter which can be used for addressing intersection searching problem. The technique performs the intersection search query in O(1) amortized time. The space required to store the pre-processed spatial data set is linear to number of objects in the dataset.","PeriodicalId":374175,"journal":{"name":"2013 IEEE International Conference on Electronics, Computing and Communication Technologies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Electronics, Computing and Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONECCT.2013.6469310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In a generalized Intersection Searching problem, a set S of spatial objects is pre-processed so that for a given a query object q, the question that whether q intersects with any object of S can be answered efficiently. A technique to solve Intersection Searching problem on spatial data using bloom filter is presented. Bloom filter on conventional data has been proved to be one of the most successful technique for solving set-membership problem. The presented method applies space filling curves on spatial objects to fetch appropriate information about these divisions. It then converts this information into a bloom filter which can be used for addressing intersection searching problem. The technique performs the intersection search query in O(1) amortized time. The space required to store the pre-processed spatial data set is linear to number of objects in the dataset.
利用布隆滤波器求解空间数据的交集搜索问题
在广义相交搜索问题中,对空间对象集合S进行预处理,使得对于给定的查询对象q,可以有效地回答q是否与S中的任意对象相交的问题。提出了一种利用布隆滤波器解决空间数据相交搜索问题的方法。对常规数据进行布隆滤波已被证明是解决集隶属性问题最成功的技术之一。该方法利用空间对象的空间填充曲线来获取这些划分的适当信息。然后将这些信息转换成一个布隆过滤器,用于解决交叉搜索问题。该技术在O(1)平摊时间内执行交集搜索查询。存储预处理的空间数据集所需的空间与数据集中对象的数量成线性关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信