Evolutionary techniques for updating query cost models in a dynamic multidatabase environment
dc.contributor.author | Larson, Per-Åke | en_US |
dc.contributor.author | Zhu, Qiang | en_US |
dc.contributor.author | Rahal, Amira | en_US |
dc.date.accessioned | 2006-09-11T19:29:08Z | |
dc.date.available | 2006-09-11T19:29:08Z | |
dc.date.issued | 2004-05 | en_US |
dc.identifier.citation | Rahal, Amira; Zhu, Qiang; Larson, Per-Åke; (2004). "Evolutionary techniques for updating query cost models in a dynamic multidatabase environment." The VLDB Journal 13(2): 162-176. <http://hdl.handle.net/2027.42/47868> | en_US |
dc.identifier.issn | 1066-8888 | en_US |
dc.identifier.issn | 0949-877X | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47868 | |
dc.description.abstract | Deriving local cost models for query optimization in a dynamic multidatabase system (MDBS) is a challenging issue. In this paper, we study how to evolve a query cost model to capture a slowly-changing dynamic MDBS environment so that the cost model is kept up-to-date all the time. Two novel evolutionary techniques, i.e., the shifting method and the block-moving method, are proposed. The former updates a cost model by taking up-to-date information from a new sample query into consideration at each step, while the latter considers a block (batch) of new sample queries at each step. The relevant issues, including derivation of recurrence updating formulas, development of efficient algorithms, analysis and comparison of complexities, and design of an integrated scheme to apply the two methods adaptively, are studied. Our theoretical and experimental results demonstrate that the proposed techniques are quite promising in maintaining accurate cost models efficiently for a slowly changing dynamic MDBS environment. Besides the application to MDBSs, the proposed techniques can also be applied to the automatic maintenance of cost models in self-managing database systems. | en_US |
dc.format.extent | 304633 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.subject.other | ComputerScience | en_US |
dc.subject.other | Multidatabase | en_US |
dc.subject.other | Cost Model | en_US |
dc.subject.other | Query Optimization | en_US |
dc.subject.other | Self-managing Database | en_US |
dc.subject.other | Evolutionary Technique | en_US |
dc.title | Evolutionary techniques for updating query cost models in a dynamic multidatabase environment | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Computer and Information Science, The University of Michigan - Dearborn, MI 48128, Dearborn, USA | en_US |
dc.contributor.affiliationum | Department of Computer and Information Science, The University of Michigan - Dearborn, MI 48128, Dearborn, USA | en_US |
dc.contributor.affiliationother | Microsoft Research, One Microsoft Way, WA 98052, Redmond, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.contributor.affiliationumcampus | Dearborn | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47868/1/778_2003_Article_110.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s00778-003-0110-4 | en_US |
dc.identifier.source | The VLDB Journal | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.