Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 1.102
JCR 5-Year IF: 0.734
Issues per year: 4
Current issue: Feb 2021
Next issue: May 2021
Avg review time: 55 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

2,771,374 unique visits
701,615 downloads
Since November 1, 2009



Robots online now
Googlebot


SJR SCImago RANK

SCImago Journal & Country Rank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 21 (2021)
 
     »   Issue 1 / 2021
 
 
 Volume 20 (2020)
 
     »   Issue 4 / 2020
 
     »   Issue 3 / 2020
 
     »   Issue 2 / 2020
 
     »   Issue 1 / 2020
 
 
 Volume 19 (2019)
 
     »   Issue 4 / 2019
 
     »   Issue 3 / 2019
 
     »   Issue 2 / 2019
 
     »   Issue 1 / 2019
 
 
 Volume 18 (2018)
 
     »   Issue 4 / 2018
 
     »   Issue 3 / 2018
 
     »   Issue 2 / 2018
 
     »   Issue 1 / 2018
 
 
 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
  View all issues  








LATEST NEWS

2020-Jun-29
Clarivate Analytics published the InCites Journal Citations Report for 2019. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 1.102 (1.023 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.734.

2020-Jun-11
Starting on the 15th of June 2020 we wiil introduce a new policy for reviewers. Reviewers who provide timely and substantial comments will receive a discount voucher entitling them to an APC reduction. Vouchers (worth of 25 EUR or 50 EUR, depending on the review quality) will be assigned to reviewers after the final decision of the reviewed paper is given. Vouchers issued to specific individuals are not transferable.

2019-Dec-16
Starting on the 15th of December 2019 all paper authors are required to enter their SCOPUS IDs. You may use the free SCOPUS ID lookup form to find yours in case you don't remember it.

2019-Jun-20
Clarivate Analytics published the InCites Journal Citations Report for 2018. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.650, and the JCR 5-Year Impact Factor is 0.639.

2018-May-31
Starting today, the minimum number a pages for a paper is 8, so all submitted papers should have 8, 10 or 12 pages. No exceptions will be accepted.

Read More »


    
 

  2/2010 - 14

Cache Pattern with Multi-Queries

TUDOR, N. L. See more information about TUDOR, N. L. on SCOPUS See more information about TUDOR, N. L. on IEEExplore See more information about TUDOR, N. L. on Web of Science
 
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (635 KB) | Citation | Downloads: 818 | Views: 3,806

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
Quick view
Full text preview
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]


[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 20]


[7] Sellis, T.K.: Multiple-Query Optimization, ACM Trans. Database Syst. 13(1), pp. 23-52, 1988.
[CrossRef] [Web of Science Times Cited 279]


[8] Roy, P., Seshadri, S., Sudarshan, S., Bhobe, S., "Efficient and Extensible Algorithms for Multi Query Optimization", SIGMOD, 2000.
[CrossRef]


[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]


[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]


[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]


[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]


[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]


References Weight

Web of Science® Citations for all references: 309 TCR
SCOPUS® Citations for all references: 0

Web of Science® Average Citations per reference: 15 ACR
SCOPUS® Average Citations per reference: 0

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 2021-02-28 08:36 in 73 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-2021
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.




Website loading speed and performance optimization powered by: