Approved for public release; distribution in unlimited. / The relational database model has become the most popular and widespread database model. Most current database systems are based upon or related to -he relational model. However, the relational model is beset with significant limitations, pitfalls and deficiencies. The relational model can be substantially improved with graphical interfaces. To this end, the Graphics Language for Accessing Database (GLAD) can provide easy to use and learn graphics interfaces for the relational model. Data structures and algorithms for GLAD will be presented to extend the relational model. / http://archive.org/details/datastructuresal00gren / Captain, United States Marine Corps

A materialized view is a derived data collecton stored in a database. When the source data for a materialized view is updated, the materialized view also needs to be updated. The process of updating a materialized view in response to changes in the source data is called view maintenance. There are two methods for maintaining a materialized view - recomputation and incremental computation. Recomputation computes the new view instance from scratch using the updated sources data. Incremental computation on the other hand, computes the new view instance by using the update to the source data, the old view instance, and possibly some source data. Incremental computation is widely accepted as a less expensive mathod of maintaining a view when the size of the update to the source data is small in relation to the size of the source data. / thesis (PhD)--University of South Australia, 2000

In relational algebra, a recursive relation R is defined by an equation of the form R = f(R), where f(R) is a positive relational algebra expression. Such an equation can be solved by applying a general closure operator. Although some optimization is possible, the performance obtained using this approach is very dependent on the form of the equation which defines R. Principally for this reason, we have developed specialized closure operators for relations which are solutions to problems of practical importance such as transitive closure, accessibility, shortest path, bill-of-materials, and deductions by containment comparisons. / This approach has led to the following general results: (1) design, classification, and analysis of many iterative methods for evaluating recursive relations, as well as analysis of experimental results; (2) formalization of the concept of iterative evaluation of a relation; (3) demonstration that domain algebra can be used to solve problems of concatenation and aggregation of the information associated with a recursive structure; (4) proof that relational division and general containment joins are left-monotone. / More specific results consist of a collection of original algorithms which run well on secondary storage, as shown by simulations. Among them, we wish to emphasize the differencing logarithmic transitive closure (TC) algorithms, which are superior to the previously known relational TC algorithms, and the shortest path algorithms, which are in fact generic algorithms for path algebra problems.

No description available.

A materialized view is a derived data collecton stored in a database. When the source data for a materialized view is updated, the materialized view also needs to be updated. The process of updating a materialized view in response to changes in the source data is called view maintenance. There are two methods for maintaining a materialized view - recomputation and incremental computation. Recomputation computes the new view instance from scratch using the updated sources data. Incremental computation on the other hand, computes the new view instance by using the update to the source data, the old view instance, and possibly some source data. Incremental computation is widely accepted as a less expensive mathod of maintaining a view when the size of the update to the source data is small in relation to the size of the source data. / Thesis (PhD)--University of South Australia, 2000

Project report (M.S.)--Virginia Polytechnic Institute and State University, 1990. / Vita. Abstract. Includes bibliographical references (leaves 85-90). Also available via the Internet.

Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2008. / Includes bibliographical references (p. 95-101).

Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2006. / Title from PDF title page (viewed on Dec. 13, 2006). Includes bibliographical references.

Thesis (Ph. D.)--Virginia Commonwealth University, 2006. / Prepared for: Dept. of Information Systems. Bibliography: leaves 142-148. Also available online.

Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2006. / Title from PDF title page (viewed on Sept. 7, 2006). Includes bibliographical references.