Data Structures for Retrieval Problems                      (Computer and Information Science)
{'Code': '05020000', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'IIS', 'LongName': 'Div Of Information & Intelligent Systems'}}
{'SignBlockName': 'MICHELE R. JOHNSON', 'PO_EMAI': None, 'PO_PHON': None}
This project continues research into data structures                  which allow fast searching.  A major area of interest involves                  data structures for rapidly scanning  set of elements to find the               subset that lies in a particular geometric region, and to thereby               develop a better understanding of "range query" costs (from the                 vantage points of current software needs, potential geometric                   query objects, a dynamic setting, a static setting, tradeoffs                   between retrieval time and memory space.)  A second goal is to                  continue research into how to efficiency implement a non-procedu-               ral set-theoretic database query language, similar to the rela-                 tional calculus or SETL, in a main memory database.  Other areas                of study will include possible examinations of dynamimc perfect                 hashing, compact representations of sorted lists and communication              delays inherent in parallel processing.  The importance of this                 research is that geometric region searching has applications into               a wide range of area where the data can be though of as mapped out              in space - VLSI circuit design, graphic-design interfaces, and                  census or statistical database applications based on geographical               regions.  Efficient retrieval, using advanced technology such as                very large main memories for computer, is critical to developing                these applications.
{'FirstName': 'Dan', 'LastName': 'Willard', 'PI_MID_INIT': 'E', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Dan E Willard', 'EmailAddress': 'dew@cs.albany.edu', 'NSF_ID': '000185268', 'StartDate': '08/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'SUNY at Albany', 'CityName': 'Albany', 'ZipCode': '122220100', 'PhoneNumber': '5184374974', 'StreetAddress': '1400 Washington Ave MSC 312', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '20', 'CONGRESS_DISTRICT_ORG': 'NY20', 'ORG_DUNS_NUM': '152652822', 'ORG_LGL_BUS_NAME': 'RESEARCH FOUNDATION FOR THE STATE UNIVERSITY OF NEW YORK, THE', 'ORG_PRNT_DUNS_NUM': '020657151'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '6856', 'Text': 'ARTIFICIAL INTELL & COGNIT SCI'}, {'Code': '9145', 'Text': 'SPECIAL PROGRAMS-RESERVE'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8703430.xml'}