Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/15435
Title: Supporting Complex Queries in P2P Networks
Authors: SHU YANFENG
Keywords: Peer-to-Peer (P2P), unstructured systems, structured systems, range searches, similarity searches, efficiency
Issue Date: 31-Jul-2006
Source: SHU YANFENG (2006-07-31). Supporting Complex Queries in P2P Networks. ScholarBank@NUS Repository.
Abstract: Today's P2P systems cannot deal with complex queries well. Though unstructured systems can support arbitrary complex queries, they suffer from search inefficiency; though structured systems are efficient in locating peers and data, they need to be extended for complex query support. In this work, we address the problem of supporting complex queries in P2P networks, especially, range search support and similarity search support. For range search support, we present ZNet. For similarity earch support, we present two frameworks, SummaryIndex and RPCluster. We have done extensive performance studies, and results show the effectiveness of all of them.
URI: http://scholarbank.nus.edu.sg/handle/10635/15435
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis.pdf747.92 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

182
checked on Dec 11, 2017

Download(s)

221
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.