extendable hashing?

lxfjsks 2010-07-24 08:01:54
看了一下午extendable hashing, 还是没看懂原理。 谁了解的，能不能用通俗的语言介绍下。先谢了！
...全文
231 4 打赏 收藏 转发到动态 举报
AI 作业
写回复
用AI写文章
4 条回复
切换为时间正序
请发表友善的回复…
发表回复
ljia0 2010-07-27
  • 打赏
  • 举报
 回复
它是传统哈希技术和树结合的变形产物，相对于拥有固定slot（桶）数的静态哈希表，它可以在发生冲突后slot数量动态增长。具体的做法有很多种。
fanster28_ 2010-07-26
  • 打赏
  • 举报
 回复
http://donghao.org/doc/dhash.pdf
lxfjsks 2010-07-25
  • 打赏
  • 举报
 回复
LS，知道的话就介绍一下。
fanster28_ 2010-07-24
  • 打赏
  • 举报
 回复
动态hash,方法太多,去找论文看看
Python Data Structures and Algorithms [2017]
Python Data Structures and Algorithms by Benjamin Baka English | 30 May 2017 | ASIN: B01IF7NLM8 | 310 Pages | AZW3 | 6.63 MB Key Features A step by step guide, which will provide you with a thorough discussion on the analysis and design of fundamental Python data structures. Get a better understanding of advanced Python concepts such as big-o notation, dynamic programming, and functional data structures. Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner. Book Description Data structures allow you to organize data in a particular way efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. In this book, you will learn the essential Python data structures and the most common algorithms. With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. You will be able to create complex data structures such as graphs, stacks and queues. We will explore the application of binary searches and binary search trees. You will learn the common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. We will also discuss how to organize your code in a manageable, consistent, and extendable way. The book will explore in detail sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort. By the end of the book, you will learn how to build components that are easy to understand, debug, and use in different applications. What you will learn Gain a solid understanding of Python data structures. Build sophisticated data applications. Understand the common programming patterns and algorithms used in Python data science. Write efficient robust code. About the Author Benjamin Baka works as a software developer and has over 10 years, experience in programming. He is a graduate of Kwame Nkrumah University of Science and Technology and a member of the Linux Accra User Group. Notable in his language toolset are C, C++, Java, Python, and Ruby. He has a huge interest in algorithms and finds them a good intellectual exercise. He is a technology strategist and software engineer at mPedigree Network, weaving together a dizzying array of technologies in combating counterfeiting activities, empowering consumers in Ghana, Nigeria, and Kenya to name a few. In his spare time, he enjoys playing the bass guitar and listening to silence. You can find him on his blog. Table of Contents Python objects, types and expressions Python data types and structures Principles of data structure design Lists and pointer structures Stacks and Queues Trees Hashing and symbol tables Graphs and other algorithms Searching Sorting Selction Algorithms Design Ttechniques and Sstrategies Implementations, applications and tools
可扩充散列、可扩充哈希、可扩展散列、可扩展哈希 (Extendable Hashing)
文章目录1.背景知识2.图解可扩充散列3.可扩充散列的代码实现 1.背景知识 不知道，大家听没听说过”知识图谱“？ 嘿嘿，没听说过也不要紧，但你一定听说过”思维导图“吧？ ”知识图谱“实际上是用图的形式把知识体系描绘出来，以梳理知识与知识之间的关联。 这里给出一个知识图谱的图片 ”知识图谱“现已被广泛应用于各个领域，包括人工智能领域。 为什么有”知识图谱“的产生？ 尤其是现在，处于一个知识和信息...
数据库——可拓展哈希（Extendable Hashing）
干什么用的 首先明确这是一种【存数据】的方法。比如有100个文件，有方法的找肯定比一个一个找要快。聪明的前辈们想出很多方法，有二分法，B-Tree，Hash等等。这些方法也被叫做“索引”（Index）。 怎么用 从一个栗子入手。 拓展 可拓展哈希到这里就讲完了。另外说下Hash在MySQL里的应用。 ...
extendible Hash
原理 静态散列要求桶的数目始终固定，那么在确定桶数目和选择散列函数时，如果桶数目过小，随着数据量增加，性能会降低；如果留一定余量，又会带来空间的浪费；或者定期重组散列索引结构，但这是一项开销大且耗时的工作。为了应对这些问题，为此提出了几种动态散列(dynamic hashing)技术，可扩展动态散列(extendable hashing)便是其一。 一、可扩展动态散列 A)用一个数组来存储桶指针...
数据库可扩展散列索引
数据库中可扩展散列索引 可扩展散列索引 为桶引入一间接层，即用一个指向块的指针数组来表示桶，而不是用数据块本身组成的数组来表示桶 指针数组能增长，其长度总是2的幂。因而数组每增长一次，桶的数目就翻倍。不过，并非每个桶都有一个数据块；如果某些桶中的所有记录可以放在一个块中，则这些桶可能共享一个块。 散列函数h为每个键计算出一个K位二进制序列，该K足够大，比如32。但是桶的数目总是使用从序列第一位或...
数据结构与算法

33,027

社区成员

35,336

社区内容

发帖
与我相关
我的任务
社区描述
数据结构与算法相关内容讨论专区
社区管理员
  • 数据结构与算法社区
加入社区
  • 近7日
  • 近30日
  • 至今

加载中

查看更多榜单
社区公告
暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章