利用2-3个杜鹃哈希过滤器回答空间多集交集查询

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-08-29 DOI:10.1145/3139958.3140021

M. Goodrich

{"title":"利用2-3个杜鹃哈希过滤器回答空间多集交集查询","authors":"M. Goodrich","doi":"10.1145/3139958.3140021","DOIUrl":null,"url":null,"abstract":"We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t ≤ wc sets involved in the query, w is the number of bits in a memory word, k is the output size, and c ≥ 1 is any fixed constant.","PeriodicalId":270649,"journal":{"name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters\",\"authors\":\"M. Goodrich\",\"doi\":\"10.1145/3139958.3140021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t ≤ wc sets involved in the query, w is the number of bits in a memory word, k is the output size, and c ≥ 1 is any fixed constant.\",\"PeriodicalId\":270649,\"journal\":{\"name\":\"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3139958.3140021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3139958.3140021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们展示了如何在O(n(log w)/w + kt)期望时间内回答空间多集交集查询，其中n是查询中涉及的t≤wc集的总大小，w是存储字的位数，k是输出大小，c≥1是任意固定常数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters

We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t ≤ wc sets involved in the query, w is the number of bits in a memory word, k is the output size, and c ≥ 1 is any fixed constant.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

自引率

0.00%

发文量