Abstract
Databases today are increasing in both complexity in size and have gained an unprecedented level of importance in commercial and business applications. Of particular interest are the databases based on the client-server model where a centralized database services multiple clients over a network. Clearly, this means that a large number of queries are fired at the central database in a short period of time. Realistically speaking, it is not possible to process the queries in conventional methods and some optimization techniques are used to speed up the entire process. One way to do this optimization is to cache common results of sub-queries to avoid re-computation and redundancy. In the following paper, we demonstrate the use of multiple virtual caches, a novel concept which allows us to practically emulate the optimal caching algorithm with the limited knowledge of the future known by the optimizer. The approach presented significantly speeds up the entire process of query processing and improves both the utilization of the cache and throughput of the CPU. Towards the end of the paper, we will show the results of our performance evaluation, drawing comparisons with the existing approaches that are currently employed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, F., et al.: Decomposition and Common Subexpression Processing in Multiple-Query Processing. Southern Methodist Univ. Technical Report 94-CSE-30 (August 1994)
Sellis, T.K.: Multiple-Query Optimization. ACM Transactions on Database Systems 13(1), 23–52 (1998)
Transaction Processing Performance Council (TPC), TPC Benchmark-H, http://www.tpc.org
Malladi, R., Davis, K.C.: Applying Multiplequery Optimization in Mobile Databases. In: Proceedings of the 36th Hawaii International Conference on System Sciences, vol. 9(1), pp. 294–303. IEEE, Los Alamitos (2003)
Safaeei, A.-A., Kamali, M., Haghjoo, M.S., Izadi, K.: Caching Intermediate Results for Multiple-Query Optimization by Computer. In: Systems and Applications, AICCSA 2007, IEEE/ACS International Conference (2007)
Goh, S.-T., Ooi, B.C., Tan, K.-L., et al.: Demand-Driven Caching in Multiuser Environment. IEEE Computer Society, Los Alamitos
Diwan, A.A., Sudarshan, S., Thomas, D.: Scheduling and Caching in Multi-Query Optimization, www.cse.iitb.ac.in/comad/2006/proceedings/150.pdf
Jarke, M.: Common Subexpression Isolation in Multiplequery Optimization. Query Processing in Database Systems 1(1), 191–205 (1985)
Roy, P., Seshadri, S., Sudarshan, S., Bhobe, S.: Efficient and Extensible Algorithms for Multi Query Optimization. In: SIGMOD 2000 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, A.B., Goyal, S., Gupta, A. (2008). Practical Optimal Caching Using Multiple Virtual Caches in Multiple Query Optimization. In: Hussain, D.M.A., Rajput, A.Q.K., Chowdhry, B.S., Gee, Q. (eds) Wireless Networks, Information Processing and Systems. IMTIC 2008. Communications in Computer and Information Science, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89853-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-89853-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89852-8
Online ISBN: 978-3-540-89853-5
eBook Packages: Computer ScienceComputer Science (R0)