Data Structures for Retrieval Problems (Computer and Information Science)

该项目继续研究允许快速搜索的数据结构。一个主要感兴趣的领域涉及用于快速扫描元素集以找到位于特定几何区域中的子集的数据结构，从而更好地理解(从当前软件需求、潜在几何查询对象、动态设置、静态设置、检索时间和存储空间之间的折衷)的“范围查询”成本。第二个目标是继续研究如何在内存数据库中高效地实现类似于关系演算或SETL的非过程性集合论数据库查询语言。其他研究领域将包括动态完美散列的可能检查、排序列表的紧凑表示以及并行处理中固有的通信延迟。这项研究的重要性在于，几何区域搜索的应用范围很广，数据可以被认为是空间中的地图-VLSI电路设计、图形设计接口以及基于地理区域的普查或统计数据库应用程序。高效的检索，使用先进的技术，如非常大的计算机主存储器，是开发这些应用程序的关键。

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.