This Blog Provide Topics, Abstracts, Documentations, Slides for various Seminars, Projects, Paper Presentations. After Reading Abstract You Can Download Corresponding Paper By Clicking The Link Given At The Bottom. On The Right Side Bar Select Your Branches CSE, ECE, EEE, IT, MCA, MBA, Civil, Mechanical Departments And More Stuff Will Be Added From Time To Time. So Please Be In Touch With This Blog For More And Apt Information.
|Speech Compression| |Data Security| |Artificial Neural Networks| |Moletronics| |AI Speech Recognition| |ATM| |Blue Eyes| |Brain Computer Interface| |Fuzzy Logic| |Mobile Voting| |Information Security Using Steganography| |Modern Irrigation Systems| |Asynchronous Chip| |Smartphone| |Gizmag|Subtractive Synthesis | Spread Spectrum | Speech Compression | Paper Batteries | Satellite Encryption | Robotics 1 2 | Silicon in Nanotechnology | Renewable Energy Systems | Reed Solomon Code | Vlsi Paper Presentation | Green Nanotechnology | Aerospace Nanotechnology | Nanotechnology | Brain Controlled Car 1 | Bubble Power | Brain Machine Interface | Beam Robotics Nervous Systems | Artificial Photosynthesis | Neural Networks | Adaptive Filtering | Finger Print Recognizer | Vlsi Chip | Digital Water Marking |
Efficient Approximate Query Processing in Peer-to-Peer Networks
Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of P2P databases. In this paper, we present novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer, the data is often highly correlated, and, moreover, even collecting a random sample of the peers is difficult to accomplish. To counter these problems, we have developed an adaptive two-phase sampling approach based on random walks of the P2P graph, as well as block-level sampling techniques. We present extensive experimental evaluations to demonstrate the feasibility of our proposed solution.