Open Access Open Access  Restricted Access Subscription or Fee Access

Source Layer Group Aggregation for Balanced Traversing

S.T. Padmapriya, J. Deepika


Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some aggregation function over distributed data items, for example, to know value of portfolio for a client; or the AVG of temperatures sensed by a set of sensors. Resource utilized group aggregation for correlated type validation at client level is the proposed access. Correlated sub query is the query to return the resultant records in partial manner. It means, the query evaluates grouped records and fetches the result until the last group is met. In large data bases there are highly maximized records to meet the groups. This type of query evaluates once and returned to result to parent and continues to fetch the retrieval process. In this paper, Client Framework prepares task and it will be divided into many divisions to start separate way to start the multi connection process using parallel approach. Intelligent Group Service checks the availability of groups and decides percentage level based on the idle resources in network. Percentage tasks decide how many groups can be sent to one available server. The parallel approach starts the retrieval process from the system based on the percentage. After the downloading process, the assembler starts the assembling process. Data producer Service prepares the result and return to Client frame work. After making fast retrieval Assembler assembles it in locally. Population Data are replicated in Mirror Network. Client system finds the availability of available servers and makes the communication in dynamic level. Group based segregated process against servers is started from client process by IGS


Algorithms, Continuous Queries, Distributed Query Processing, Data Dissemination, Coherency, Performance, Parallel Way Source.

Full Text:



A. Davis, J. Parikh, and W. Weihl, “Edge Computing: Extending Enterprise Applications to the Edge of the Internet,” Proc. 13thInt’l World Wide Web Conf. Alternate Track Papers & Posters (WWW),2004.

D. VanderMeer, A. Datta, K. Dutta, H. Thomas, and K.Ramamritham, “Proxy-Based Acceleration of Dynamically Generated Content on the World Wide Web,” ACM Trans. Database Systems, vol. 29, pp. 403-443, June 2004.

J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B.Weihl, “Globally Distributed Content Delivery,” IEEE Internet Computing, vol. 6, no. 5, pp. 50-58, Sept. 2002.

S. Rangarajan, S. Mukerjee, and P. Rodriguez, “User Specific Request Redirection in a Content Delivery Network,” Proc.Eighth Int’l Workshop Web Content Caching and Distribution (IWCW), 2003.

S. Shah, K. Ramamritham, and P. Shenoy, “Maintaining Coher-ency of Dynamic Data in Cooperating Repositories,” Proc. 28th Int’l Conf. Very Large Data Bases (VLDB), 2002.

T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press and McGraw-Hill 2001.

Y. Zhou, B. Chin Ooi, and K.-L. Tan, “Disseminating Streaming Data in a Dynamic Environment: An Adaptive and Cost Based Approach,” The Int’l J. Very Large Data Bases, vol. 17, pp. 1465-1483,2008.

“Query Cost Model Validation for Sensor Data,”, 2011.

R. Gupta, A. Puri, and K. Ramamritham, “Executing Incoherency Bounded Continuous Queries at Web Data Aggregators,” Proc. 14th Int’l Conf. World Wide Web (WWW), 2005.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.