A Database Query Processing Model in Peer-To-Peer Network

Peer-to-peer databases are becoming more prevalent on the internet for sharing and distributing applications, documents, files, and other digital media. The problem associated with answering large-scale ad hoc analysis queries, aggregation queries, on these databases poses unique challenges. This paper presents an extensive evaluation of database query processing model in peer-to-peer networks using top-k query processing technique and implemented by Java,and MySql.Keywords: Peer-To-Peer Network; Database Query; Query Processing; Object-Oriented System

Delay-bounded range queries in DHT-based peer-to-peer systems

2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

A Database Query Processing Model in Peer-To-Peer Network

Peer-to-peer databases are becoming more prevalent on the internet for sharing and distributing applications, documents, files, and other digital media. The problem associated with answering large-scale ad hoc analysis queries, aggregation queries, on these databases poses unique challenges. This paper presents an extensive evaluation of database query processing model in peer-to-peer networks using top-k query processing technique and implemented by Java, and MySql

BATON: A Balanced Tree Structure for Peer-to-Peer Networks

We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes at different levels in the tree, we show that the load at each node is approximately equal. In spite of the tree structure providing precisely one path between any pair of nodes, we show that sideways routing tables maintained at each node provide sufficient fault tolerance to permit efficient repair. Specifically, in a network with N nodes, we guarantee that both exact queries and range queries can be answered in O(logN) steps and also that update operations (to both data and network) have an amortized cost of O(logN). An experimental assessment validates the practicality of our proposal.Singapore-MIT Alliance (SMA

Efficient Peer-to-Peer Content Sharing for Learning in Virtual Worlds

Virtual world technologies provide new and immersive space for learning, training, and education. They are enabled by the content creation and content sharing function for allowing users to create and interoperate various learning objects. Unfortunately, virtual world content sharing based on persistent virtual world content storage, to the best of our knowledge, does not exist. In this paper, we address this problem by proposing a content sharing scheme based on Virtual Net, a virtual world persistency framework. For efficient content retrieval, three strategies have been proposed to reduce communication overhead and content load delay.By integrating these strategies, a virtual world content search and retrieval algorithm has been devised. The experiment results verify the effectiveness of the algorithm