International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 10 | Year 2013 | Article Id. IJCTT-V4I10P119 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I10P119

Execution Planning for Continuous Queries over Dissemination Network of Data Aggregators

M .Naresh Kumar , R.Sailaja

Citation :

M .Naresh Kumar , R.Sailaja, "Execution Planning for Continuous Queries over Dissemination Network of Data Aggregators," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 10, pp. 3476-3484, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I10P119

Abstract

Normally continuous queries are those used, to observe the dynamically changing data and to give results helpful for Online decision making. Generally a user wants to achieve the value of few aggregation functions over shared data items, for example, to regulate when the value of a stock portfolio exceeds a threshold. We focus on approaches and techniques to assign such dynamically changing data to a large number of users with high accuracy, efficiency, and scalability. In these queries a client maintains a consistency requirement as part of the query. We come up with a minimal –cost based approach to answer continuous aggregation queries using a network of aggregators of dynamic data items. In that network of data aggregators, each data aggregator handles a set of data items at definite coherencies. Our technique is splitting a client query into sub-queries and executing sub-queries on properly chosen data aggregators with their respective sub-query incoherency bounds. We give a mechanism for collecting the optimal set of sub-queries with their inconsistency bounds which satisfies client query’s coherency requirement with minimum number of update messages issued from aggregators to the client. We layout a cost based model which can be used to evaluating the number of messages prescribed to satisfy the client specified incoherency bound.

Keywords

Coherency, Continuous queries, Cost, Distributed query processing, Data dissemination, Performance.

References

[1]   Rajeev Gupta, Kirthi Ramamrithm, “Query Planning for Continuous Aggregation Queries Over a Network of data Aggregators “, IEEE 2012 Transactions on Knowledge and Data Engineering, Vol .24, Issue: 6   
[2]   A. Davis, J.Praikh and W.Weihl, “Edge Computing Extending Enterprise Applications to The Edge   Of the Internet”, WWW 2004.         
[3]   D.VanderMeer, A.Datta, K.Dutta, H.Thomas and Ramamritham, Proxy –Based Acceleration of Dynamically Generated Content on the World Wide Web”,  ACM   Transactions on Database Systems (TODS) Vol.29, June 2004.   
[4]  S.Rangarajan, S.Mukerjee and P.Rodriguez, “User Specific Request Redirection in a Content    Delivery network “, 8 Intl .Workshop on Web Content Caching and Distribution (IWCW), 2003.   
[5]   S.Shah, K.Ramamritham, and P.Shenoy, “Maintaining Coherency of Dynamic Data in Cooperating Repositories “, VLDB 2002.   
[6] C.Olston, J.Jiang and  J.Widom ,”Adaptive Filter for Continuous Queries Over Distributed Data Streams”.SIGMOD2003 
[7]  S Shah, K .Ramamritham, and C.Ravishankar   “Client Assignment in Content Dissemination   Networks for Dynamic Data “ , VLDB  2005. 
 [8] R Gupta , A Puri , and  K.Ramamritham ,   “ Executing   Incoherency Bounded Continuous   Queries at Web Data Aggregators”, WWW 2005. 
[9] Y.Zhou, B. Chin Ooi  and Kian-Lean Tan, “Disseminating Streaming Data in a Dynamic Environment: An Adaptive and    Cost Based Approach “, The VLDB Journal, Issue 17, Pg.1465- 1483, 2008         
[10] S.Madden, M.J.Franklin, J.Hellerstein   and W.Hong, “TAG: a Tiny Aggregation Service for   Ad-Hoc Sensor Networks “, Proc. Of  5th  Symposium on Operating Systems Design and Implementation,2002.
[11]   S. Agrawal, K. Ramamritham and S. Shah, “Construction of a Temporal Coherency Preserving   Dynamic Data Dissemination Network “, RTSS 2004. 
[12]  A.Iyenger   and   J.Challenger   , “Improving Web server Performance by Caching Dynamic   Data” . Proceedings of the USENIX Symposium on   Internet Technologies and System (USEITS) 1997. 
[13] R. Srinivasan, C .Liang, K. Ramamritham, “Maintaining temporal coherency of Virtual Datawarehouses.   “, Proceedings of the IEEE –Real time Systems Symposium P.60, December   02-04,1998. 
[14] A Deshpande, C. Guestrin, S .R. Madden, J. M. Hellerstein; and  W. Hong , “Model-Driven Data Acquisition in Sensor Networks “, VLDB 2004. 
[15]   R.Gupta and K.Ramamritham,  “Optimized  Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks “, WWW 2007. 
[16] N .Jain, D. Kit  , P.Mahajan  ,P.Yalagandula , M .Dahlin and  Y.Zhang ,” STAR : Self – Tuning Aggregation for Scalable Monitoring “, VLDB 2007.   
[17] P. Edara, A.Limaye and K.Ramamritham, “Asynchronous Innetwork Prediction 4 ,  :Efficient   Aggregation in Sensor Networks “, ACM  Transactions on Sensor Networks, Volume Number 4 , August 2008.