@prefix dbo:	<http://dbpedia.org/ontology/> .
@prefix dbr:	<http://dbpedia.org/resource/> .
dbr:Hash_table	dbo:wikiPageWikiLink	dbr:Linear_hashing .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix wikipedia-en:	<http://en.wikipedia.org/wiki/> .
wikipedia-en:Linear_hashing	foaf:primaryTopic	dbr:Linear_hashing .
dbr:Consistent_hashing	dbo:wikiPageWikiLink	dbr:Linear_hashing .
dbr:Extendible_hashing	dbo:wikiPageWikiLink	dbr:Linear_hashing .
dbr:Linear_hash	dbo:wikiPageWikiLink	dbr:Linear_hashing ;
	dbo:wikiPageRedirects	dbr:Linear_hashing .
dbr:Paris_Dauphine_University	dbo:wikiPageWikiLink	dbr:Linear_hashing .
@prefix rdf:	<http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix yago:	<http://dbpedia.org/class/yago/> .
dbr:Linear_hashing	rdf:type	yago:Act100030358 ,
		yago:PsychologicalFeature100023100 ,
		yago:Rule105846932 ,
		yago:YagoPermanentlyLocatedEntity ,
		yago:Abstraction100002137 ,
		yago:WikicatSearchAlgorithms ,
		dbo:Software ,
		yago:Event100029378 ,
		yago:Activity100407535 ,
		yago:Procedure101023820 ,
		yago:Algorithm105847438 .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbr:Linear_hashing	rdfs:label	"Hashing lineal"@es ,
		"\u7EBF\u6027\u6563\u5217"@zh ,
		"Linear hashing"@en ;
	rdfs:comment	"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 ,
		"\u7EBF\u6027\u6563\u5217\u662F\u7531Witold Litwin\uFF081980\uFF09 \u53D1\u660E\u5E76\u88ABPaul Larson\u63A8\u5E7F\u7684\u4E00\u79CD\u52A8\u6001\u6563\u5217\uFF08dynamic hash\uFF09\u7B97\u6CD5\u3002\u7EBF\u6027\u6563\u5217\u8868\u7684\u6BCF\u6B21\u6269\u5F20\u4EC5\u589E\u52A0\u4E00\u4E2A\u69FD\uFF08slot\u3001bucket\uFF09\uFF0C\u9891\u7E41\u7684\u5355\u69FD\u6269\u5F20\u53EF\u4EE5\u975E\u5E38\u6709\u6548\u63A7\u5236\u7684\u51B2\u7A81\u94FE\u7684\u957F\u5EA6\uFF0C\u4ECE\u800C\u54C8\u5E0C\u8868\u6269\u5C55\u7684\u4EE3\u4EF7\u644A\u8FD8\u5728\u6BCF\u4E00\u6B21\u63D2\u5165\u64CD\u4F5C\u4E2D\u3002 \u56E0\u6B64\u975E\u5E38\u9002\u5408\u7528\u4E8E\u4EA4\u4E92\u5F0F\u5E94\u7528\u7A0B\u5E8F\u3002"@zh ,
		"El hashing lineal (en ingl\u00E9s, linear hashing) es un algoritmo din\u00E1mico de tabla hash inventado por (1980),\u200B\u200B y m\u00E1s tarde popularizado por Paul Larson. El hashing lineal permite la expansi\u00F3n de la tabla hash un espacio a la vez. La frecuente expansi\u00F3n de solo un espacio puede controlar de manera muy eficaz la cantidad de colisi\u00F3n de cadenas. El costo de la expansi\u00F3n de una tabla hash se propaga por cada operaci\u00F3n de inserci\u00F3n en la tabla hash, en lugar de ser incurridos todos a la vez,\u200B por lo tanto, el hashing' lineal es muy adecuado para aplicaciones interactivas."@es .
@prefix dcterms:	<http://purl.org/dc/terms/> .
@prefix dbc:	<http://dbpedia.org/resource/Category:> .
dbr:Linear_hashing	dcterms:subject	dbc:Search_algorithms ,
		dbc:Hashing ;
	dbo:abstract	"\u7EBF\u6027\u6563\u5217\u662F\u7531Witold Litwin\uFF081980\uFF09 \u53D1\u660E\u5E76\u88ABPaul Larson\u63A8\u5E7F\u7684\u4E00\u79CD\u52A8\u6001\u6563\u5217\uFF08dynamic hash\uFF09\u7B97\u6CD5\u3002\u7EBF\u6027\u6563\u5217\u8868\u7684\u6BCF\u6B21\u6269\u5F20\u4EC5\u589E\u52A0\u4E00\u4E2A\u69FD\uFF08slot\u3001bucket\uFF09\uFF0C\u9891\u7E41\u7684\u5355\u69FD\u6269\u5F20\u53EF\u4EE5\u975E\u5E38\u6709\u6548\u63A7\u5236\u7684\u51B2\u7A81\u94FE\u7684\u957F\u5EA6\uFF0C\u4ECE\u800C\u54C8\u5E0C\u8868\u6269\u5C55\u7684\u4EE3\u4EF7\u644A\u8FD8\u5728\u6BCF\u4E00\u6B21\u63D2\u5165\u64CD\u4F5C\u4E2D\u3002 \u56E0\u6B64\u975E\u5E38\u9002\u5408\u7528\u4E8E\u4EA4\u4E92\u5F0F\u5E94\u7528\u7A0B\u5E8F\u3002"@zh ,
		"El hashing lineal (en ingl\u00E9s, linear hashing) es un algoritmo din\u00E1mico de tabla hash inventado por (1980),\u200B\u200B y m\u00E1s tarde popularizado por Paul Larson. El hashing lineal permite la expansi\u00F3n de la tabla hash un espacio a la vez. La frecuente expansi\u00F3n de solo un espacio puede controlar de manera muy eficaz la cantidad de colisi\u00F3n de cadenas. El costo de la expansi\u00F3n de una tabla hash se propaga por cada operaci\u00F3n de inserci\u00F3n en la tabla hash, en lugar de ser incurridos todos a la vez,\u200B 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 ;
	dbo:wikiPageWikiLink	dbr:Berkeley_DB ,
		dbr:Dynamic_array ,
		dbr:Hash_table ,
		dbr:Icon_language ,
		dbr:Spiral_Hashing ,
		<http://dbpedia.org/resource/Load_factor_(computer_science)> ,
		dbr:Consistent_hashing ,
		dbc:Search_algorithms ,
		dbr:Communications_of_the_ACM ,
		dbc:Hashing ,
		dbr:Extendible_hashing .
@prefix dbp:	<http://dbpedia.org/property/> .
@prefix dbt:	<http://dbpedia.org/resource/Template:> .
dbr:Linear_hashing	dbp:wikiPageUsesTemplate	dbt:Reflist ;
	dbo:wikiPageRevisionID	1100501392 ;
	dbo:wikiPageExternalLink	<http://hackthology.com/an-in-memory-go-implementation-of-linear-hashing.html> ,
		<http://tommyds.sourceforge.net/> ,
		<https://github.com/KevinStern/index-cpp/blob/master/src/linear_hashing_table.h> .
@prefix xsd:	<http://www.w3.org/2001/XMLSchema#> .
dbr:Linear_hashing	dbo:wikiPageLength	"11276"^^xsd:nonNegativeInteger ;
	dbo:wikiPageID	2981764 .
@prefix owl:	<http://www.w3.org/2002/07/owl#> .
dbr:Linear_hashing	owl:sameAs	<http://zh.dbpedia.org/resource/\u7EBF\u6027\u6563\u5217> .
@prefix wikidata:	<http://www.wikidata.org/entity/> .
dbr:Linear_hashing	owl:sameAs	wikidata:Q6553456 .
@prefix dbpedia-es:	<http://es.dbpedia.org/resource/> .
dbr:Linear_hashing	owl:sameAs	dbpedia-es:Hashing_lineal ,
		dbr:Linear_hashing ,
		<https://global.dbpedia.org/id/4qb2X> ,
		<http://rdf.freebase.com/ns/m.08hkpd> ,
		<http://sr.dbpedia.org/resource/\u041B\u0438\u043D\u0435\u0430\u0440\u043D\u043E_\u0445\u0435\u0448\u0438\u0440\u0430\u045A\u0435> .
@prefix yago-res:	<http://yago-knowledge.org/resource/> .
dbr:Linear_hashing	owl:sameAs	yago-res:Linear_hashing .
@prefix gold:	<http://purl.org/linguistics/gold/> .
dbr:Linear_hashing	gold:hypernym	dbr:Algorithm .
@prefix prov:	<http://www.w3.org/ns/prov#> .
dbr:Linear_hashing	prov:wasDerivedFrom	<http://en.wikipedia.org/wiki/Linear_hashing?oldid=1100501392&ns=0> ;
	foaf:isPrimaryTopicOf	wikipedia-en:Linear_hashing .
dbr:Paul_Larson	dbo:wikiPageWikiLink	dbr:Linear_hashing .
dbr:Hash_function	dbo:wikiPageWikiLink	dbr:Linear_hashing .
dbr:Spiral_hashing	dbo:wikiPageWikiLink	dbr:Linear_hashing .  <script>parent.window.postMessage('ixistenz.url:http://dbpedia.org/data/Linear_hashing.ttl', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid122' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:122', '*');; return false;" style='text-decoration: none; '>todo </a> <a style='color: white;' href='#diffid122'><sup>2</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>