加权元素的隐式数据结构

Q4 Mathematics
Greg N. Frederickson
{"title":"加权元素的隐式数据结构","authors":"Greg N. Frederickson","doi":"10.1016/S0019-9958(85)80013-9","DOIUrl":null,"url":null,"abstract":"<div><p>Several new data structures are presented for dictionaries containing elements with different weights (access probabilities). The structures use just one location in addition to those required for the values of the elements. The first structure supports a worst-case search time that is within a constant multiplicative factor of optimal, in terms of the rank of the weight of the desired element with respect to the multiset of weights. If the values of the elements that comprise the dictionary have been drawn from a uniform distribution, then a variation of this structure achieves average search times that are asymptotically very good. Similar results are established for data structures which handle the case in which the intervals between consecutive dictionary values also have access probabilities. Lower bounds are presented for the worst-case search complexity.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80013-9","citationCount":"7","resultStr":"{\"title\":\"Implicit data structures for weighted elements\",\"authors\":\"Greg N. Frederickson\",\"doi\":\"10.1016/S0019-9958(85)80013-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Several new data structures are presented for dictionaries containing elements with different weights (access probabilities). The structures use just one location in addition to those required for the values of the elements. The first structure supports a worst-case search time that is within a constant multiplicative factor of optimal, in terms of the rank of the weight of the desired element with respect to the multiset of weights. If the values of the elements that comprise the dictionary have been drawn from a uniform distribution, then a variation of this structure achieves average search times that are asymptotically very good. Similar results are established for data structures which handle the case in which the intervals between consecutive dictionary values also have access probabilities. Lower bounds are presented for the worst-case search complexity.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80013-9\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 7

摘要

对于包含不同权值(访问概率)元素的字典,提出了几种新的数据结构。除了元素值所需的位置外,结构体只使用一个位置。第一个结构支持最坏情况下的搜索时间,该时间在最优的常数乘因子内,根据期望元素的权重相对于多权重集的排名。如果组成字典的元素的值是从均匀分布中提取的,那么这种结构的一种变体可以实现渐近非常好的平均搜索时间。对于处理连续字典值之间的间隔也具有访问概率的情况的数据结构,也建立了类似的结果。给出了最坏情况下搜索复杂度的下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Implicit data structures for weighted elements

Several new data structures are presented for dictionaries containing elements with different weights (access probabilities). The structures use just one location in addition to those required for the values of the elements. The first structure supports a worst-case search time that is within a constant multiplicative factor of optimal, in terms of the rank of the weight of the desired element with respect to the multiset of weights. If the values of the elements that comprise the dictionary have been drawn from a uniform distribution, then a variation of this structure achieves average search times that are asymptotically very good. Similar results are established for data structures which handle the case in which the intervals between consecutive dictionary values also have access probabilities. Lower bounds are presented for the worst-case search complexity.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
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学术官方微信