Show simple item record

Multiple-Query Optimization.

dc.contributor.authorSellis, T.K.en_US
dc.date.accessioned2007-05-23T09:36:49Z
dc.date.available2007-05-23T09:36:49Z
dc.date.issued1987en_US
dc.identifier.urihttp://hdl.handle.net/1903/4543
dc.description.abstractSome recently proposed extensions to relational database systems as well as deductive database systems, require support for processing multiple queries. For example, in a database system enhanced with inference capabilities, a simple query involving a rule with multiple definitions, may expand to more than one actual query that has to be run over the database. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time. The main motivation for performing such an interquery optimization lies in the fact that queries may share common data. We examine the problem of multiple-query optimization in this paper. The first major contribution of this paper is a systematic look at the problem and the presentation and analysis of algorithms that can be used for multiple query optimization. The second contribution lies in the presentation of experimental results. Our results show that using multiple-query processing algorithms may reduce execution cost considerably.en_US
dc.format.extent1614836 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1987-34en_US
dc.titleMultiple-Query Optimization.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record