| 2/2010 - 14 |
Cache Pattern with Multi-QueriesTUDOR, N. L.   |
View the paper record and citations in  |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (635 KB) | Citation | Downloads: 1,367 | Views: 4,787 |
Author keywords
equivalence class of queries from the cache, multiple queries optimization, multi-query caching, set of cache patterns, the heuristic of pair queries
References keywords
query(8), optimization(8), database(8), data(6), sudarshan(5), sigmod(5), naughton(4), databases(4), caching(4)
No common words between the references section and the paper title.
About this article
Date of Publication: 2010-05-31
Volume 10, Issue 2, Year 2010, On page(s): 82 - 86
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2010.02014
Web of Science Accession Number: 000280312600014
SCOPUS ID: 77954652006
Abstract
This article proposes a cache pattern with multi-queries and describes the multi-query optimization with scheduling, caching and pipelining. A set of cache patterns is derived from a set of class of multi-queries that are loaded into the cache. Each cache pattern represents a unique equivalence class in the set of patterns. The multi-query optimization with scheduling, caching and pipelining provides efficient heuristics, for a good queries ordering using a single invocation on the entire batch of queries. Multi-query optimization chooses the results of sub-expression that should be admitted to or discarded from cache, when it executes queries. We introduce the heuristic of pair queries and define the equivalence class of multi-queries from cache pattern. We show that the union of all equivalence classes of queries from the cache patterns is the set of cache patterns. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] A.A. Diwan, S. Sudarshan, D. Thomas, "Scheduling and Caching in Multi-Query Optimization", International Conference on Management of Data COMAD, Delhi, India, 2006.
[2] P. Roy, "MultiQuery Optimization and Applications", PhD thesis, IIT Bombay, 2000. [3] S. N. Subramanian, S. Venkataraman, "Cost based optimization of decision support queries using transient views", In ACM SIGMOD Intl. Conf. Management of Data, Seattle, WA, 1998. [CrossRef] [4] H. Mistry, P. Roy, S. Sudarshan, K. Ramamritham, "Materialized view selection and maintenance using multi-query optimization", In ACM SIGMOD Intl. Conf. Management of Data, 2001. [CrossRef] [SCOPUS Times Cited 89] [5] J. Shanmugasundaram, G. He, K. Tufte, C. Zhang, D. De-Witt, J. Naughton, "Relational databases for querying XML documents: Limitations and opportunities", In Intl. Conf. Very Large Databases, 1999. [6] J. Chen, D. J. DeWitt, J. F. Naughton, "Design and evaluation of alternative selection placement strategies in optimizing continuous queries", IEEE Intl. Conf. Data Engineering, 2002. [CrossRef] [Web of Science Times Cited 21] [7] Sellis, T.K.: Multiple-Query Optimization, ACM Trans. Database Syst. 13(1), pp. 23-52, 1988. [CrossRef] [Web of Science Times Cited 324] [SCOPUS Times Cited 530] [8] Roy, P., Seshadri, S., Sudarshan, S., Bhobe, S., "Efficient and Extensible Algorithms for Multi Query Optimization", SIGMOD, 2000. [CrossRef] [SCOPUS Times Cited 337] [9] X. Wang, T. Malik, R. Burns, S. Papadomanolakis, A. Ailamaki, "A Workload-Driven Unit of Cache Replacement for Mid-Tier Database Caching", SIGMOD, 2002. [10] A. Gupta, S. Sudarshan, S. Viswanathan, "Query scheduling in multiquery optimization", In IDEAS, pp. 11-19, 2001. [11] N. N. Dalvi, S. K. Sanghai, P. Roy, and S. Sudarshan, "Pipelining in multiquery optimization", ACM Symp. Principles of Database Systems, 2001. [CrossRef] [SCOPUS Times Cited 56] [12] K.-L. Tan, H. Lu, "Workload scheduling for multiple query processing", Information Processing Letters, 555, pp. 251-257, 1995. [CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 16] [13] Q.Luo, J. F. Naughton, R. Krishnamurthy, P. Cao, Y. Li, "Active Query Caching for Database Web Servers", ACM SIGMOD Workshop on the Web and Databases, WebDB, 2000. [CrossRef] [SCOPUS Times Cited 15] [14] Q. Luo, J. F Naughton, "Form-Based Proxy Caching for Database-Backed Web Sites", VLDB Conference, Rome 2001. [15] Sophie Cluet, Olga Kapitskaia, Divesh Srivastava, "Using LDAP Directory Caches", Proc. ACM Principles of Database Systems,1999. [16] Olga Kapitskaia, Raymond T Ng, Divesh Srivastava, "Evolution and revolutions in LDAP directory caches", Proceedings of the International Conference on Extending Database Technology (EDBT), pp. 202-216, 2000. [CrossRef] [SCOPUS Times Cited 8] [17] Papadomanolakis, S., Ailamaki, A., "AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning", SSDBM, 2004. [18] Nastasescu C., Nita C., Vraciu C., Bazele algebrei, vol I, Editura Academiei Romaniei, Bucuresti, 1986. [19] G. Graefe, W. J. McKenna, "Extensibility and Search Efficiency in the Volcano Optimizer Generator", In IEEE Intl. Conf. Data Engineering, 1993. [CrossRef] [20] J. Flum, M. Frick, M. Grohe, "Query Evaluation via Tree-Decompositions", Proc. of the 8th International Conference on Database Theory (ICDT'01), volume 1973 of Lecture Notes in Computer Science, pp. 22-38, UK, 2001, Springer. [CrossRef] [SCOPUS Times Cited 22] Web of Science® Citations for all references: 355 TCR SCOPUS® Citations for all references: 1,073 TCR Web of Science® Average Citations per reference: 18 ACR SCOPUS® Average Citations per reference: 54 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-04-19 00:47 in 68 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
