Location:
Search - Hashing Method
Search list
Description: 雜湊法(Hashing)的搜尋與一般的搜尋法(searching)是不一樣的。在雜湊法中，鍵值(key value)或識別字(identifier)在記憶體的位址是經由函數(function)轉換而得的。此種函數，一般稱之為雜湊函數(Hashing function)或鍵值對應位址轉換(key to address transformation)。對於有限的儲存空間，能夠有效使用且在加入或刪除時也能快的完成，利用雜湊法是最適當不過了。因為雜湊表搜尋在沒有碰撞(collision)及溢位(overflow)的情況下，只要一次就可擷取到。
-hash (Hashing) search and search for a general law (searching) is not the same. The hash law, the pair (key value) or identification characters (identifier) in the memory address of the sender is by function (function) generated from the conversion. Such functions, commonly known as hash functions (Hashing function) keys corresponding addresses or conversion (key to address transformation). For the limited storage space, which can be effectively used in acceding to or deleted can be completed faster, using hash method is the most appropriate. Because hash table search in the absence of collisions (collision) and overflow (overflow) circumstances, as long as one can capture that.
Platform: |
Size: 24590 |
Author: HCJ |
Hits:
Description: A C++ Program to show an example of Hashing using Mid-Square Method.
应用Mid-Square理论的哈希算法
Platform: |
Size: 1187 |
Author: 李丽 |
Hits:
Description: Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
-Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
Platform: |
Size: 2267136 |
Author: hu |
Hits:
Description: 雜湊法(Hashing)的搜尋與一般的搜尋法(searching)是不一樣的。在雜湊法中，鍵值(key value)或識別字(identifier)在記憶體的位址是經由函數(function)轉換而得的。此種函數，一般稱之為雜湊函數(Hashing function)或鍵值對應位址轉換(key to address transformation)。對於有限的儲存空間，能夠有效使用且在加入或刪除時也能快的完成，利用雜湊法是最適當不過了。因為雜湊表搜尋在沒有碰撞(collision)及溢位(overflow)的情況下，只要一次就可擷取到。
-hash (Hashing) search and search for a general law (searching) is not the same. The hash law, the pair (key value) or identification characters (identifier) in the memory address of the sender is by function (function) generated from the conversion. Such functions, commonly known as hash functions (Hashing function) keys corresponding addresses or conversion (key to address transformation). For the limited storage space, which can be effectively used in acceding to or deleted can be completed faster, using hash method is the most appropriate. Because hash table search in the absence of collisions (collision) and overflow (overflow) circumstances, as long as one can capture that.
Platform: |
Size: 24576 |
Author: HCJ |
Hits:
Description: 雜湊法(Hashing)的搜尋與一般的搜尋法(searching)是不一樣的。在雜湊法中，鍵值(key value)或識別字(identifier)在記憶體的位址是經由函數(function)轉換而得的。此種函數，一般稱之為雜湊函數(Hashing function)或鍵值對應位址轉換(key to address transformation)。對於有限的儲存空間，能夠有效使用且在加入或刪除時也能快的完成，利用雜湊法是最適當不過了。因為雜湊表搜尋在沒有碰撞(collision)及溢位(overflow)的情況下，只要一次就可擷取到。-Hash method (Hashing) search and general search method (searching) is not the same. In the hash law, the key (key value) or identifier (identifier) address in memory by the function (function) derived from the conversion. Such a function, commonly known as hash function (Hashing function) or key corresponds to the address converter (key to address transformation). For a limited storage space, can be used effectively and in time to add or delete can be completed faster, the use of hash is the most appropriate of all. Because the hash table search in the absence of a collision (collision) and overflow (overflow) circumstances, as long as one can be retrieved.
Platform: |
Size: 35840 |
Author: 張建良 |
Hits:
Description: 1. 本程序是针对我们班级中“人名”设计的哈希表，平均查找长度不超过R。
2. 程序中人名为汉语拼音形式，共30个我周围较熟悉的同学，取平均查找长度的上限为2.哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。
3. 人名的长度均不超过19个字符，测试数据为查找“hanbiao”。
本程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”之后，由用户在键盘上输入程序中规定的运算命令；相应的输入数据（滤去输入中的非法字符）和运算结果显示在其后。
-1. This procedure is for our classes, name designed hash table, the average length of no more than to find R. 2. Procedure human form known as Hanyu Pinyin, a total of 30 around me who are more familiar with the students, taking the average to find the length of the upper limit of 2. Hash function used in addition to stay more than a few law structure, with pseudo-random hashing method to detect and then deal with the conflict. 3. The names of persons not of the length of more than 19 characters, the test data to find hanbiao . The procedures to users and the computer implementation of dialogue, that is displayed on computer terminals in the message after, by the user at the keyboard, enter the procedure provided for computing the order corresponding input data (least squares input of illegal characters) and The results showed that in subsequent operations.
Platform: |
Size: 198656 |
Author: ck |
Hits:
Description: 假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。-The assumption that the names of people known as China s Hanyu Pinyin form. Hash table to be populated with the names of a total of 30, taking the average to find the length of the upper limit of 2. Hash function used to stay more than a few laws in addition to construction, using pseudo-random hashing method to detect and then deal with the conflict.
Platform: |
Size: 2048 |
Author: yintao |
Hits:
Description: A C++ Program to show an example of Hashing using Mid-Square Method.
应用Mid-Square理论的哈希算法-A C++ Program to show an example of Hashing using Mid-Square Method. Application of Mid-Square Hash Algorithm Theory
Platform: |
Size: 1024 |
Author: 李丽 |
Hits:
Description: 1、设每个记录有下列数据项：电话号码、用户名、地址；
2、从键盘输入各记录，分别以电话号码和用户名为关键字建立哈希表；
3、采用再哈希法解决冲突；
4、查找并显示给定电话号码的记录；
5、查找并显示给定用户名的记录。
6、在哈希函数确定的前提下，尝试各种不同类型处理冲突的方法（至少两种），考察平均查找长度的变化。
-1, for each record the following data items: telephone numbers, user name, address 2, from the keyboard input of the records, respectively, telephone number and user name to establish Hashtable keywords 3, re-hashing method used to solve conflict 4, find and display a given telephone number of record 5, find and display a given user name records. 6, in the hash function to determine, under the premise of trying to deal with different types of conflict (at least two), visit Find the length of the average change.
Platform: |
Size: 35840 |
Author: 迟浩东 |
Hits:
Description: This an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.-This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.
Platform: |
Size: 34816 |
Author: lucoy |
Hits:
Description: 1. 本程序是针对“人名”设计的哈希表。 2. 程序中人名为汉语拼音形式，共30个人名，取平均查找长度的上限为2.哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 3. 本程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”之后，由用户在键盘上输入程序中规定的运算命令；相应的输入数据（滤去输入中的非法字符）和运算结果显示在其后。4.本程序是清华严蔚敏配套哈希表程序-1. This program is for " names" design of the hash table. 2. Program human form, called pinyin, a total of 30 names, taking the average search length of the upper limit of 2. Hash function to remain with the addition of more than a few law structure, with the pseudo-random hashing method to detect and then deal with conflict. 3. The procedure for the user and the computer implementation of dialogue, that is displayed on the computer terminal, " tips" after the keyboard input by the user specified in the computing process orders the corresponding input data (filtered input of illegal characters ) and the results showed that in a subsequent operation. 4. This procedure is Tsinghua Yan Wei-min matching hash table program
Platform: |
Size: 7168 |
Author: lt |
Hits:
Description: 1．定义哈希表数据结构。
2．除留余数法做为哈希函数、
H(key) = key P
用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。
3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).
Platform: |
Size: 1024 |
Author: Yvonne |
Hits:
Description: CryptoAPI（一个应用程序编程接口）目的就是提供开发者在Windows 下使用PKI 的编
程接口。CryptoAPI 提供了很多函数，包括编码、解码、加密、解密、哈希、数字证书、
证书管理和证书存储等功能。对于加密和解密，CryptoAPI 同时提供基于会话密钥和公
钥/私钥对的方法。-CryptoAPI (an application programming interface) is designed for a developer to use PKI in the Windows programming interface. CryptoAPI provides many functions, including encoding, decoding, encryption, decryption, hashing, digital certificates, certificate management and certificate storage and other functions. For encryption and decryption, CryptoAPI also provides session-based key and public/private key pair method.
Platform: |
Size: 311296 |
Author: Infosecer |
Hits:
Description: 为班级30个人的姓名设计一个哈希表，假设姓名用汉语拼音表示。要求用除留余数法构造哈希函数，用线性探测再散列法处理冲突，平均查找长度上限为2.-The names of 30 people for the class to design a hash table, assuming that the name in pinyin. Required to remain with the addition of more than a few method to construct hash functions, hashing by linear probing further conflict, the average search length limit to 2.
Platform: |
Size: 14336 |
Author: sammie |
Hits:
Description: 本中文文档详细说明CryptoAPI（一个应用程序编程接口）（带目录方便查询），目的就是提供开发者在Windows 下使用PKI 的编
程接口。CryptoAPI 提供了很多函数，包括编码、解码、加密、解密、哈希、数字证书、
证书管理和证书存储等功能。对于加密和解密，CryptoAPI 同时提供基于会话密钥和公
钥/私钥对的方法。-The Chinese document details CryptoAPI (an application programming interface) (with a convenient directory inquiries), the purpose is to provide developers use PKI in Windows programming interface. CryptoAPI provides many functions, including encoding, decoding, encryption, decryption, hashing, digital certificates, certificate management and certificate storage and other functions. For encryption and decryption, CryptoAPI also provides session-based key and public/private key pair method.
Platform: |
Size: 313344 |
Author: 朱跃文 |
Hits:
Description: c++ program for hashing using quadratic probing method
Platform: |
Size: 1024 |
Author: jigar |
Hits:
Description: 散列查找法范例，当你需要的时候，可以适当修改下，就可以用，fortran语言-Hashing method to find an example, when you need it, can, under appropriate modifications, you can use, fortran language
Platform: |
Size: 1024 |
Author: liuxiaoyan |
Hits:
Description: 在计算机内部排序的各种算法中 ,用比较大小的方法进行排序时间耗费的最好特性为 O(nlog2 n) ,最坏情况下还会上升到 O(n2 ) [1] 。要达到其理论下界log2 n1≈ nlog2 n- 1.4 4 n是非常困难的。Hashsort 一种散列排序方法-The best features of the computer' s internal sorting algorithm, the sort of time-consuming method of comparative size O (nlog2 n), the worst case will rise to the O (n2) [1]. To achieve its theoretical Lower Bound log2 N1 ≈ nlog2 N-1.4 4 n is very difficult. The Hashsort sort of a hashing method
Platform: |
Size: 1024 |
Author: liming |
Hits:
Description: combined hashing and watermarking
Platform: |
Size: 505856 |
Author: neha |
Hits:
Description: 多实例hash检索方法，一种可以检索多个目标的哈希方法(deep multi-instance hashing)
Platform: |
Size: 1794048 |
Author: walker_zhao |
Hits: