東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Attribute-based data access over P2P...

Gupta, Abhishek.

FindBook

Google Book

Amazon

博客來

Attribute-based data access over P2P systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Attribute-based data access over P2P systems./
作者:	Gupta, Abhishek.
面頁冊數:	158 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4106.
Contained By:	Dissertation Abstracts International65-08B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143797
ISBN:	0496017020

Attribute-based data access over P2P systems.
Gupta, Abhishek.

Attribute-based data access over P2P systems. - 158 p.

Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4106.

Thesis (Ph.D.)--University of California, Santa Barbara, 2004.

Peer-to-peer (P2P) systems provide a distributed and scalable alternative to access services and data over the network which is in contrast to the traditional client-server model. The basic idea in these systems is to harness the collective storage resources available at the large number of peers, obviating the need for a few servers with large storage. In recent years, P2P computing has emerged as a powerful distributed computing model for large scale systems. P2P systems have been widely used for large scale file sharing and instant messaging applications. The initial P2P designs could either not scale to match their popularity or caused a lot of overhead on the networks. More recently Distributed Hash Table based structured designs for P2P systems have been proposed that exhibit excellent scalability and routing and lookup performance. These designs are however limited in the kind of applications they can support because of the simple hash table interface they provide. DHT systems simply rely on the names of the data objects to distribute, index and locate them. In this thesis, we present designs of DHT based P2P systems that extend the interface to support attribute based data access by extracting semantic information from the queries. We describe solutions for approximate as well as exact answers to range queries. We apply the designs to support Select, Project, and Join based SQL queries and also present an application to Publish/Subscribe systems. We have also developed a prototype system for the proposed Publish/Subscribe system and evaluated its performance on PlanetLab machines distributed across the world.

ISBN: 0496017020Subjects--Topical Terms:

626642
Computer Science.

Attribute-based data access over P2P systems.
LDR:02554nmm 2200277 4500 001 1846787
005 20051103093547.5
008 130614s2004 eng d
020 $a 0496017020
035 $a (UnM)AAI3143797
035 $a AAI3143797
040 $a UnM $c UnM
100 1 $a Gupta, Abhishek. $3 1271328
245 1 0 $a Attribute-based data access over P2P systems.
300 $a 158 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4106.
500 $a Chairs: Divyakant Agrawal; Amr El Abbadi.
502 $a Thesis (Ph.D.)--University of California, Santa Barbara, 2004.
520 $a Peer-to-peer (P2P) systems provide a distributed and scalable alternative to access services and data over the network which is in contrast to the traditional client-server model. The basic idea in these systems is to harness the collective storage resources available at the large number of peers, obviating the need for a few servers with large storage. In recent years, P2P computing has emerged as a powerful distributed computing model for large scale systems. P2P systems have been widely used for large scale file sharing and instant messaging applications. The initial P2P designs could either not scale to match their popularity or caused a lot of overhead on the networks. More recently Distributed Hash Table based structured designs for P2P systems have been proposed that exhibit excellent scalability and routing and lookup performance. These designs are however limited in the kind of applications they can support because of the simple hash table interface they provide. DHT systems simply rely on the names of the data objects to distribute, index and locate them. In this thesis, we present designs of DHT based P2P systems that extend the interface to support attribute based data access by extracting semantic information from the queries. We describe solutions for approximate as well as exact answers to range queries. We apply the designs to support Select, Project, and Join based SQL queries and also present an application to Publish/Subscribe systems. We have also developed a prototype system for the proposed Publish/Subscribe system and evaluated its performance on PlanetLab machines distributed across the world.
590 $a School code: 0035.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of California, Santa Barbara. $3 1017586
773 0 $t Dissertation Abstracts International $g 65-08B.
790 1 0 $a Agrawal, Divyakant, $e advisor
790 1 0 $a El Abbadi, Amr, $e advisor
790 $a 0035
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143797