Efficient Approximate Query Processing in Peer-to-Peer Networks

Abstract 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 ....etc

[:=Read Full Message Here=:]

Index Distribution Technique for Efficient Search on Unstructured Peer-to-Peer Networks
Resource indexing is an effective technique for fast, successful_ search on decentralized, unstructured peer-topeer (P2P) networks. An_ index is a summary of resources owned by a node, and is distributed_ over the P2P network; any node having the index can answer queries on_ the location of the resources. While more thoroughly distributed _ indices can make queries answered more quickly with a small hop count,_ in large-scale networks, such a scheme ....etc

[:=Read Full Message Here=:]

EVOLUTION OF PEER TO PEER DOWNLOADING
PEER TO PEER NETWORK
What is a peer to peer network?
A peer to peer network is a network that relies on the computing power & bandwidth of the participants on the network.
P2p networks are typically used for connecting nodes via largely ad_hoc connections.
Such networks are useful for sharing content files containing audio,video ,data & anything in digital format.


File Download / TransferTraditional Client-Server Downloading

Peer to peer file sharing


Tra ....etc

[:=Read Full Message Here=:]

Inter-query Parallelism
It is a form of parallelism where many different Queries or Transactions are executed in parallel with one another on many processors.
Advantages
It increases Transaction Throughput. That is, number of transactions executed in a given time can be increased.
It scales up the Transaction processing system. Hence, best suited for On-Line Transaction Processing (OLTP) systems.
Supported Parallel Database Architectures
It is easy to implement in Shared Memory Parallel System. Lock tables and Log information are maintained in ....etc

[:=Read Full Message Here=:]

Abstract In unstructured peer-to-peer networks, the average response latency and traffic cost of a query are two main performance metrics. Controlled-flooding resource query algorithms are widely used in unstructured networks such as peer-to-peer networks. In this paper, we propose a novel algorithm named Selective Dynamic Query (SDQ). Based on mathematical programming, SDQ calculates the optimal combination of an integer TTL value and a set of neighbors to control the scope of the next query. Our results demonstrate that SDQ provides finer gr ....etc

[:=Read Full Message Here=:]

Spatial Data Query Support in Peer-to-Peer Systems



Motivation

Spatial data sets are used for many applications, e.g., GIS, CAD,
P2P systems provide a distributed platform that is very scalable.
Pros:
Scalability, no central point of failure
Cons:
Very dynamic (unreliable), topology maintenance required

Distributed Hash Tables (DHT)

DHT systems: Content Addressable Network (CAN), Chord, Pastry, etc.
Using DHT to allocate large data sets to many nodes with no ....etc

[:=Read Full Message Here=:]

Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems JAVA

ABSTRACT
Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the
identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers
have to pre-construct an anonymous path before transmission. The overhead of maintaining and updating such
paths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity
protocol for ....etc

[:=Read Full Message Here=:]

Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems



INTRODUCTION

PEER-TO-PEER systems have emerged as cost-effective alternatives
for scalable data sharing, backup, and archival
storage , . Peers contribute data and storage and, in
return, gain access to data at other peers. Effective storage
management is an important issue in the deployment of such
systems. Data replication and caching are key enabling
techniques for scalability, perform ....etc

[:=Read Full Message Here=:]

This article is presented by: Bin Cui, Senior Member, IEE, Lijiang Chen, Student Member, IEE, Linhao Xu,
Hua Lu, Member, IEE, Guojie Song, and Quanqing Xu



ABSTRACT


PEER-TO-PEER (P2P) computing systems have been thought of as a powerful paradigm for data sharing, and peerbased data management has attracted increasing interest from the database and information retrieval communities recently. Due to its desirable features like low depl ....etc

[:=Read Full Message Here=:]

EFFECTIVE AND EFFICIENT QUERY PROCESSING FOR VIDEO SUBSEQUENCE IDENTIFICATION

ABSTRACT

This paper presents a graph transformation and matching approach to identify the occurrence of potentially different ordering or length due to content editing. With a novel batch query algorithm to retrieve similar frames, the mapping relationship between the query and database video is first represented by a bipartite graph. The densely matched parts along the long sequence are then extracted, followed by a filt ....etc

[:=Read Full Message Here=:]