| dbo:abstract
|
- El hashing lineal (en inglés, linear hashing) es un algoritmo dinámico de tabla hash inventado por (1980), y más tarde popularizado por Paul Larson. El hashing lineal permite la expansión de la tabla hash un espacio a la vez. La frecuente expansión de solo un espacio puede controlar de manera muy eficaz la cantidad de colisión de cadenas. El costo de la expansión de una tabla hash se propaga por cada operación de inserción en la tabla hash, en lugar de ser incurridos todos a la vez, por lo tanto, el hashing' lineal es muy adecuado para aplicaciones interactivas. (es)
- Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980. It has been analyzed by Baeza-Yates and Soza-Pollman. It is the first in a number of schemes known as dynamic hashing such as Larson's Linear Hashing with Partial Extensions, Linear Hashing with Priority Splitting,Linear Hashing with Partial Expansions and Priority Splitting,or Recursive Linear Hashing. The file structure of a dynamic hashing data structure adapts itself to changes in the size of the file, so expensive periodic file reorganization is avoided. A Linear Hashing file expands by splittinga pre-determined bucket into two and contracts by merging two predetermined buckets into one. The trigger for a reconstruction depends on the flavor of the scheme; it could be an overflow at a bucket or load factor (number of records divided by the number of buckets) moving outside of a predetermined range.In Linear Hashing there are two types of buckets, those that are to be split and those already split. While extendible hashing splits only overflowing buckets,spiral hashing (a.k.a. spiral storage) distributes records unevenly over the buckets suchthat buckets with high costs of insertion, deletion, or retrieval are earliest in linefor a split. Linear Hashing has also been made into a scalable distributed data structure, LH*. In LH*, each bucket resides at a different server. LH* itself has been expanded to provide data availability in the presence offailed buckets. Key based operations (inserts, deletes, updates, reads) in LH and LH* take maximum constant time independent of the number of buckets and hence of records. (en)
- 线性散列是由Witold Litwin（1980） 发明并被Paul Larson推广的一种动态散列（dynamic hash）算法。线性散列表的每次扩张仅增加一个槽（slot、bucket），频繁的单槽扩张可以非常有效控制的冲突链的长度，从而哈希表扩展的代价摊还在每一次插入操作中。 因此非常适合用于交互式应用程序。 (zh)
|
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 11276 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| gold:hypernym
| |
| rdf:type
| |
| rdfs:comment
|
- El hashing lineal (en inglés, linear hashing) es un algoritmo dinámico de tabla hash inventado por (1980), y más tarde popularizado por Paul Larson. El hashing lineal permite la expansión de la tabla hash un espacio a la vez. La frecuente expansión de solo un espacio puede controlar de manera muy eficaz la cantidad de colisión de cadenas. El costo de la expansión de una tabla hash se propaga por cada operación de inserción en la tabla hash, en lugar de ser incurridos todos a la vez, por lo tanto, el hashing' lineal es muy adecuado para aplicaciones interactivas. (es)
- 线性散列是由Witold Litwin（1980） 发明并被Paul Larson推广的一种动态散列（dynamic hash）算法。线性散列表的每次扩张仅增加一个槽（slot、bucket），频繁的单槽扩张可以非常有效控制的冲突链的长度，从而哈希表扩展的代价摊还在每一次插入操作中。 因此非常适合用于交互式应用程序。 (zh)
- Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980. It has been analyzed by Baeza-Yates and Soza-Pollman. It is the first in a number of schemes known as dynamic hashing such as Larson's Linear Hashing with Partial Extensions, Linear Hashing with Priority Splitting,Linear Hashing with Partial Expansions and Priority Splitting,or Recursive Linear Hashing. (en)
|
| rdfs:label
|
- Hashing lineal (es)
- Linear hashing (en)
- 线性散列 (zh)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
