Peer-to-peer (P2P) databases are turning into prevalent on the Internet for distribution and sharing of documents, applications, and different digital media. The problem of answering massive-scale unexpected analysis queries, as an example, aggregation queries, on these databases poses distinctive challenges. Exact solutions can be time consuming and tough to implement, given the distributed and dynamic nature of P2P databases. In this paper, we have a tendency to present novel sampling-primarily based techniques for approximate answering of impromptu aggregation queries in such databases. Computing a high-quality random sample of the database efficiently within the P2P setting is difficult due to several factors: the information is distributed (typically in uneven quantities) across many peers, at intervals every peer, the data is usually highly correlated, and, moreover, even collecting a random sample of the peers is troublesome to accomplish. To counter these problems, we have developed an adaptive 2-part sampling approach based mostly on random walks of the P2P graph, and block-level sampling techniques. We have a tendency to present extensive experimental evaluations to demonstrate the feasibility of our proposed resolution.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Efficient Secure Outsourcing of Large-Scale Sparse Linear Systems of Equations - 2018ABSTRACT:Solving large-scale sparse linear systems of equations (SLSEs) is one in all the foremost common and basic problems in
PROJECT TITLE :Distributed Feature Selection for Efficient Economic Big Data Analysis - 2018ABSTRACT:With the rapidly increasing popularity of economic activities, a large amount of economic data is being collected. Although
PROJECT TITLE :Efficient Wideband DOA Estimation Through Function Evaluation Techniques - 2018ABSTRACT:This Project presents an economical analysis methodology for the functions involved within the computation of direction-of-arrival
PROJECT TITLE :Efficient System Tracking With Decomposable Graph-Structured Inputs and Application to Adaptive Equalization With Cyclostationary Inputs - 2018ABSTRACT:This Project introduces the graph-structured recursive least
PROJECT TITLE :Efficient Partial-Sum Network Architectures for List Successive-Cancellation Decoding of Polar Codes - 2018ABSTRACT:List successive cancellation decoder (LSCD) architectures have been recently proposed for the decoding

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry