紧凑数据结构综述——一种实用的方法,作者:Gonzalo Navarro

L. Kozma
{"title":"紧凑数据结构综述——一种实用的方法,作者:Gonzalo Navarro","authors":"L. Kozma","doi":"10.1145/3289137.3289140","DOIUrl":null,"url":null,"abstract":"The book studies fundamental data structures and representations of combinatorial objects, including arrays, bitvectors, permutations, trees, graphs, etc. There are, of course, a great number of existing textbooks and lecture notes about data structures. The perspective of this book is, however, different from the usual presentations. In some sense, this book starts exactly where others leave off saying \"we omit the low-level details of representation\", and concerns itself mostly with the low-level representation. Specifically, it looks at how to organize and store data structures using as little space as possible while supporting efficient queries and operations. For the considered structures, the book explores the trade-off between reduced space and speed of operation. The analyses of the presented solutions go beyond the usual asymptotics, and also consider exact constant factors (particularly for the leading term of the space complexity); useful practical considerations are also discussed.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Review of Compact Data Structures - a practical approach by Gonzalo Navarro\",\"authors\":\"L. Kozma\",\"doi\":\"10.1145/3289137.3289140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The book studies fundamental data structures and representations of combinatorial objects, including arrays, bitvectors, permutations, trees, graphs, etc. There are, of course, a great number of existing textbooks and lecture notes about data structures. The perspective of this book is, however, different from the usual presentations. In some sense, this book starts exactly where others leave off saying \\\"we omit the low-level details of representation\\\", and concerns itself mostly with the low-level representation. Specifically, it looks at how to organize and store data structures using as little space as possible while supporting efficient queries and operations. For the considered structures, the book explores the trade-off between reduced space and speed of operation. The analyses of the presented solutions go beyond the usual asymptotics, and also consider exact constant factors (particularly for the leading term of the space complexity); useful practical considerations are also discussed.\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3289137.3289140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3289137.3289140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本书研究了基本的数据结构和组合对象的表示,包括数组、位向量、排列、树、图等。当然,有大量关于数据结构的现有教科书和课堂笔记。然而,这本书的观点与通常的陈述不同。从某种意义上说,这本书正是在其他人说“我们忽略了表征的底层细节”的地方开始的,它主要关注的是底层表征。具体来说,它着眼于如何使用尽可能少的空间组织和存储数据结构,同时支持高效的查询和操作。对于考虑的结构,本书探讨了减少空间和操作速度之间的权衡。所提出的解的分析超越了通常的渐近性,并且还考虑了精确的常数因子(特别是对于空间复杂度的前一项);还讨论了有用的实际考虑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Review of Compact Data Structures - a practical approach by Gonzalo Navarro
The book studies fundamental data structures and representations of combinatorial objects, including arrays, bitvectors, permutations, trees, graphs, etc. There are, of course, a great number of existing textbooks and lecture notes about data structures. The perspective of this book is, however, different from the usual presentations. In some sense, this book starts exactly where others leave off saying "we omit the low-level details of representation", and concerns itself mostly with the low-level representation. Specifically, it looks at how to organize and store data structures using as little space as possible while supporting efficient queries and operations. For the considered structures, the book explores the trade-off between reduced space and speed of operation. The analyses of the presented solutions go beyond the usual asymptotics, and also consider exact constant factors (particularly for the leading term of the space complexity); useful practical considerations are also discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Technical Report Column Open Problems Column Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds The Book Review Column Recent Advances in Multi-Pass Graph Streaming Lower Bounds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1