NDLI: Distribution-dependent hashing functions and their characteristics

Please wait, while we are loading the content...

File structure design to facilitate on-line instantaneous updating

Implementation of a structured English query language

Implementation of a prototype generalized file translator

Data base standardization: a status report

Automatic generation of physical data base structures

Finding candidate keys for relational data bases

A data base management system design philosophy

Computing joins of relations

CONVERT: a high level translation definition language for data conversion

A preliminary system for the design of DBTG data structures

On the semantics of the relational data model

An authorization model for a shared data base

Optimizing the performance of a relational algebra data base interface

A logical-level approach to data base conversion

Quantitative data description

Distribution-dependent hashing functions and their characteristics

File-level operations on network data structures

Implementation of integrity constraints and views by query modification

Investigations into the application of the relational model to data translation

Secondary index optimization

A unified approach to functional dependencies and relations

Data base decomposition in a hierarchical computer system

Performing inferences over relation data bases

DSCL: a Data Specification and Conversion Language for networks

Data description for computer-aided design

Information retrieval in files described using sets

Distribution-dependent hashing functions and their characteristics

Content Provider	ACM Digital Library
Author	Deutscher, R. F. Tremblay, J. P. Sorenson, P. G.
Abstract	In this paper procedures are studied for storing, accessing, updating, and reorganizing data in large files whose organization is direct, an organization used when a fast response time is required. "Distribution-dependent" hashing functions and the division method are compared as methods of indirect addressing."Distribution-dependent" hashing functions are characterized. These hashing functions generate addresses from a set of keys by using knowledge of the distribution of that key set within the key space or range of keys. A study of the performance measures obtained during tests of these functions on several key sets indicates that in certain cases, distribution-dependent methods perform better than the division method. This result is extended by a demonstration that distribution-dependent hashing functions can accommodate a change in the distribution of keys without being redefined. A number of insertions to and deletions from the key set can be made before a distribution-dependent hashing function gives poorer performance than the division method under identical circumstances.If many additions are made to a set of keys, it becomes necessary to reorganize, in a larger storage area, the direct file of records identified by that key set. Although processor time must be sacrificed in order to redefine a distribution-dependent hashing function, the division method requires substantially greater access time in a reorganizational situation.
Starting Page	224
Ending Page	236
Page Count	13
File Format	PDF
DOI	10.1145/500080.500111
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1975-05-14
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Data base design Hashing functions Data base reorganization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Data-dependent Hashing Based on p-Stable Distribution (2014)

Optimum data base reorganization points

Adaptive hashing based multiple variable length pattern search algorithm for large data sets

Efficient Learning for Hashing Proportional Data

Collections of Functions for Perfect Hashing

Security of graph data: hashing schemes and definitions

Synthesizing hashing circuits

1Data-dependent Hashing Based on p-Stable Distribution

Refractive index dependent bidirectional scattering distribution functions

Distribution-dependent hashing functions and their characteristics

Similar Documents

Data-dependent Hashing Based on p-Stable Distribution (2014)

Optimum data base reorganization points

Adaptive hashing based multiple variable length pattern search algorithm for large data sets

Efficient Learning for Hashing Proportional Data

Collections of Functions for Perfect Hashing

Security of graph data: hashing schemes and definitions

Synthesizing hashing circuits

1Data-dependent Hashing Based on p-Stable Distribution

Refractive index dependent bidirectional scattering distribution functions

Distribution-dependent hashing functions and their characteristics