{"public_id":"co_4014f7d5b76824e83b7a1135fc59ca94","status":"active","merged_into_public_id":null,"resolved_public_id":"co_4014f7d5b76824e83b7a1135fc59ca94","name":"extendible hashing","description":"A dynamic hashing access technique for retrieving data by key.","aliases":["extendible hash"],"types":["method"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"concept","status":"active","confidence":null,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","concept.status"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"papers":[{"corpus_id":2723596,"title":"Extendible hashing—a fast access method for dynamic files","citation_count":774,"url":"https://sah.borca.ai/papers/2723596"}],"claims":[{"public_id":"cl_18ef143c0d514b110711d0b80ac60c45","text":"Analysis and simulation indicate that extendible hashing is an attractive alternative to balanced trees and other access methods.","corpus_id":2723596,"url":"https://sah.borca.ai/claims/cl_18ef143c0d514b110711d0b80ac60c45"},{"public_id":"cl_6d9445055c6b67e17b74436a2db1107a","text":"No more than two page faults are required to locate the data associated with a given key.","corpus_id":2723596,"url":"https://sah.borca.ai/claims/cl_6d9445055c6b67e17b74436a2db1107a"},{"public_id":"cl_87c30894a0795138fe3e9602604ef410","text":"The structure grows and shrinks gracefully as the database grows and shrinks.","corpus_id":2723596,"url":"https://sah.borca.ai/claims/cl_87c30894a0795138fe3e9602604ef410"},{"public_id":"cl_8bd04cad6f25dace03b4656936b33a9f","text":"Extendible hashing simultaneously solves the problem of making hash tables extendible and radix search trees balanced.","corpus_id":2723596,"url":"https://sah.borca.ai/claims/cl_8bd04cad6f25dace03b4656936b33a9f"}],"related_concepts":[],"resolved_url":"https://sah.borca.ai/concepts/co_4014f7d5b76824e83b7a1135fc59ca94","url":"https://sah.borca.ai/concepts/co_4014f7d5b76824e83b7a1135fc59ca94"}