Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

QUERY PLANNING FOR CONTINUOUS AGGREGATION QUERIES OVER A NETWORK OF DATA AGGREGATOR

Platform : DOT NET

IEEE Projects Years : 2012 - 13

QUERY PLANNING FOR CONTINUOUS AGGREGATION QUERIES OVER A NETWORK OF DATA AGGREGATOR

ABSTRACT:

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. In these queries a client specifies a coherency requirement as part of the query. We present a low-cost, scalable technique to answer continuous aggregation queries using a network of aggregators of dynamic data items. In such a network of data aggregators, each data aggregator serves a set of data items at specific coherencies. Just as various fragments of a dynamic web-page are served by one or more nodes of a content distribution network, our technique involves decomposing a client query into sub-queries and executing sub-queries on judiciously chosen data aggregators with their individual sub-query incoherency bounds.

 

We provide a technique for getting the optimal set of sub-queries with their incoherency bounds which satisfies client query’s coherency requirement with least number of refresh messages sent from aggregators to the client. For estimating the number of refresh messages, we build a query cost model which can be used to estimate the number of messages required to satisfy the client specified incoherency bound. Performance results using real-world traces show that our cost based query planning leads to queries being executed using less than one third the number of messages required by existing schemes.


 

The Greedy algorithm for query plan selection

Result ï Ø

While A Ø

Choose a sub-query a Ñ A with criteria ψ

Result ïResult υ a

A ï A-{a}

For each data element e Ñ a

For each b Ñ A

b ï b-{e}

If b = Ø

A ï A-{b}

Else

Calculate sumdiff for modified b

Return Result


 

EXISTING SYSTEM:

 

Many data intensive applications delivered over the Web suffer from performance and scalability issues. Content distribution networks (CDNs) solved the problem for static content using caches at the edge nodes of the networks. CDNs continue to evolve to serve more and more dynamic applications. The static fragments are served from the local caches whereas dynamic fragments are created either by using the cached data or by fetching the data items from the origin data sources. One important question for satisfying client requests through a network of nodes is how to select the best node(s) to satisfy the request. For static pages content requested, proximity to the client and load on the nodes are the parameters generally used to select the appropriate node.

 

Disadvantage:

 

1. For data item which needs to be refreshed at an incoherency.

2. The exact data value at the corresponding data source need not be reported as long as the query result satisfies user specified accuracy requirements.


 

PROPOSED SYSTEM:

 

Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. This paper we present a low-cost, scalable technique to answer continuous aggregation queries using a content distribution network of dynamic data items.

 

Advantage:

 

1. It saves the time and the user spending low cost.

2. A continuous query cost model which can be used to estimate the number of messages required to satisfy the client specified incoherency bound.

3. We present to implementations of Continuous Aggregation in optimized query.


 

SYSTEM SPECIFICATION:

 

HARDWARE REQUIREMENTS:

 

• System                      :           Pentium IV 2.4 GHz.

• Hard Disk                 :           40 GB.

• Monitor                     :           14’ Colour Monitor.

• Mouse                       :           Optical Mouse.

• Ram                          :           512 Mb.

• Keyboard                  :           101 Keyboard.

 

SOFTWARE REQUIREMENTS:

• Operating system      :           Windows XP.

• Coding Language     :           ASP.Net with C#

• Data Base                 :           SQL Server 2005.


 

MODULES:

1. Security Module

2. Flow chat Module

3. Update Module

4. Client/Server Module

 

SECURITY MODULE:

 

This module is used to help the user to provide the security of access. Because once the user to logout or leave our account automatically user password is changed and server to send the password in our mail ID. Whenever the user to logout the account automatically the security key is changed based on the random function.

 

FLOW CHAT MODULE:

 

This module is used to help the user to view the BSE and NSE value in bar flow chat based on the date. This chat to display the aggregated value based on the companies sharing values continuously. The companies value is changed automatically chat value is changed.

 

UPDATE MODULE:

 

This module is used to help the user to view the BSE and NSE value to update in every minute. So the user waiting time is reduced and sees the updated value in every minute the server to set the time when our form is updated.

 

CLIENT/SERVER MODULE:

 

This module is used to help the client and server interaction to the database. This module is used to dynamically create the table based on the server entering value. These values are assigning to the chat x and y position and display the client. These values are changed in dynamically based on the server entering values.



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1