Cost Estimation for Queries Experiencing Multiple Contention States in Dynamic Multidatabase Environments
dc.contributor.author | Sun, Yu | en_US |
dc.contributor.author | Motheramgari, Satyanarayana | en_US |
dc.contributor.author | Zhu, Qiang | en_US |
dc.date.accessioned | 2006-09-08T19:43:26Z | |
dc.date.available | 2006-09-08T19:43:26Z | |
dc.date.issued | 2003-02 | en_US |
dc.identifier.citation | Zhu, Qiang; Motheramgari, Satyanarayana; Sun, Yu; (2003). "Cost Estimation for Queries Experiencing Multiple Contention States in Dynamic Multidatabase Environments." Knowledge and Information Systems 5(1): 26-49. <http://hdl.handle.net/2027.42/41868> | en_US |
dc.identifier.issn | 0219-1377 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/41868 | |
dc.description.abstract | Accurate query cost estimation is crucial to query optimization in a multidatabase system. Several estimation techniques for a static environment have been suggested in the literature. To develop a cost model for a dynamic environment, we recently introduced a multistate query-sampling method. It has been shown that this technique is promising in estimating the cost ofa query run in any given contention state for a dynamic environment. In this paper, we study a new problem on how to estimate the cost of a large query that may experience multiple contention states. Following the discussion of limitations for two simple approaches, i.e., single state analysis and average cost analysis, we propose two novel techniques to tackle this challenge. The first one, called fractional analysis, is suitable for a gradually and smoothly changing environment, while the second one, called the probabilistic approach, is developed for a rapidly and randomly changing environment. The former estimates a query cost by analyzing its fractions, and the latter estimates a query cost based on Markov chain theory. The related issues including cost formula development, error analysis, and comparison among different approaches are discussed. Experiments demonstrate that the proposed techniques are quite promising in solving the new problem. | en_US |
dc.format.extent | 237461 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 London Limited | en_US |
dc.subject.other | Legacy | en_US |
dc.subject.other | Keywords: Cost Estimation; Dynamic Environment; Multidatabase; Query Optimization | en_US |
dc.title | Cost Estimation for Queries Experiencing Multiple Contention States in Dynamic Multidatabase Environments | 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 ofComputer and Information Science, The University of Michigan – Dearborn, Dearborn, MI, USA, US | en_US |
dc.contributor.affiliationum | Department ofComputer and Information Science, The University of Michigan – Dearborn, Dearborn, MI, USA, US | en_US |
dc.contributor.affiliationum | Department ofComputer and Information Science, The University of Michigan – Dearborn, Dearborn, MI, USA, US | 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/41868/1/30050026.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s10115-002-0070-9 | en_US |
dc.identifier.source | Knowledge and Information Systems | 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.