published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy

Report (M.S.)--Virginia Polytechnic Institute and State University. M.S. 1993. / Vita. Abstract. Includes bibliographical references (leaves 81-83). Also available via the Internet.

Thesis (PhD) -- AUT University, 2009. / Includes bibliographical references. Also held in print (xi, 190 leaves : ill. ; 30 cm.) in the Archive at the City Campus (T 005.73 HWA)

Thesis (Ph. D.)--University of Washington, 1990. / Vita. Includes bibliographical references (leaves [159]-165).

Thesis (M. Phil.)--University of Hong Kong, 2000. / Includes bibliographical references (leaves 101-103).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1983. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 94-95).

The problems of implementing a relational database are considered. In part 1, a new class of data structures for processing range queries is described. A member of this class is derived from a data structure which supports random and sequential accessing. We also describe two new data structures with this property that seem to have better performance than the Btree. In part 2, a new design for the physical database is proposed. This design is based on the separation of a relation into two parts: a static "master file" and a dynamic "differential file" which stores updates. Our design includes a new system for recovering from system failures and allows greater concurrency than is possible with existing systems.

No description available.

Relational database systems have successfully solved many business data processing problems. The primary reason of this success is that the relational data model provides a simple, yet flexible view of data as tables. In studying VLSI/CAD data, we noticed that they are often represented in formats similar to relational tuples. Therefore, they can be stored easily in relational tables. However, it is generally agreed that conventional relational database systems are inefficient for VLSI/CAD applications, since such applications often access large amounts of data repetitively. In order to solve this problem, we designed and implemented a data mapping subsystem that converts VLSI/CAD data stored in relational tables into internal data structures so that they can be efficiently manipulated in C. By using our data mapping language, we could reduce the amount of code required by the data-structure construction parts of some real VLSI/ CAD tools to about 1/10 of that required by C implementation. Our data-structure builder consumes several times more CPU cycles. / Graduation date: 1991

Not available / text