A performance analysis of view materialization strategies for select-project-join expressions
South, Jesse T.
Kamel, Magdi N.
MetadataShow full item record
In conventional relational database systems, a view is a virtual relation whose definition is stored in the systems catalog. When a query is issued on the view, the system retrieves the view from the catalog and modified the query to an equivalent one on the base relations. Recently several approaches have been proposed that store some form of the computed view as a method for improving the performance of queries on relational databases. This thesis develops a computer program to empirically compare and evaluate three view materialization strategies: query modification, semi materialization and full materialization. The program simulates user updates and queries, and measures the cost performance of the three materialization strategies. The strategies are compared for select-project-join expressions under three different view models. The results show that the most efficient view strategy is heavily application dependent. The performance of semi-materialization and full materialization, however, are comparable for most conditions tested, and preferred over the conventional query modification method.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Auguston, Mikhail (ACM, 2000-08);This paper suggests an approach to the development of software testing and debugging automation tools based on precise program behavior models. The program behavior model is defined as a set of events (event trace) with ...
Auguston, Mikhail (Las Cruces, New Mexico, New Mexico State University, 1998);This paper sugests an approach to the development of software testing and debugging automation tools based on precise program behavior models. The program behavior model is defined as a set of events (event trace) with ...
Rowe, Neil C. (Monterey, California. Naval Postgraduate School, 1984-10); NPS52-84-015Sequences of queries to a database system can have structure. Recognizing this structure is a kind of parsing , analogous to the parsing of sentences. We present two rather different approaches to recognition for exploitation. ...