Parallel Processing of Multi-Directory Hashing
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
The basic assumption in past research on hashing for external files was         that the database is disk-resident and the records are processed in a           single processor environment.  This work focuses on parallel processing         of hashed files in main memory databases.  We will focus on some                fundamental design issues, particularly the handling of overflow                buckets, bounds on the main memory access time, concurrent accesses to          databases, and processor memory interconnection architecture.  A new            hashing technique called multi-directory hashing is the primary focus           of the first phase of this research.  Multi-directory hashing is a              generalization of extendible hashing with parallel processing                   capability.  Initial research shows that multi-directory hashing                achieves the lower bound on main memory access time and maintains close         to 100% storage utilization.  The long range goals of this research             are:  (1)  Develop algorithms for parallel main memory databases that           are alternative to B-trees, digital search trees, and hashing; (2)              Develop and analyze processor-memory architectures suitable for these           algorithms; (3)  Develop an efficient parallel main memory database             management system.
{'FirstName': 'Sakti', 'LastName': 'Pramanik', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Sakti Pramanik', 'EmailAddress': 'sakti.pramanik@gmail.com', 'NSF_ID': '000117124', 'StartDate': '01/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Michigan State University', 'CityName': 'EAST LANSING', 'ZipCode': '488242600', 'PhoneNumber': '5173555040', 'StreetAddress': '426 AUDITORIUM RD RM 2', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Michigan', 'StateCode': 'MI', 'CONGRESSDISTRICT': '07', 'CONGRESS_DISTRICT_ORG': 'MI07', 'ORG_UEI_NUM': 'R28EKN92ZTZ9', 'ORG_LGL_BUS_NAME': 'MICHIGAN STATE UNIVERSITY', 'ORG_PRNT_UEI_NUM': 'VJKZC4D1JN36'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '2875', 'Text': 'SYSTEM SOFTWARE'}, {'Code': '9120', 'Text': 'CROSS-DIRECTORATE PROGRAMS'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8706069.xml'}