Enhanced Distributed Hash Tables for Complex Queries

Pankaj  Garg; Amit  Kumar; Huzur  Saran

1st International ICST Conference on Communication System Software and MiddleWare

Research Article

Enhanced Distributed Hash Tables for Complex Queries

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/COMSWA.2006.1665215,
    author={Pankaj  Garg and Amit  Kumar and Huzur  Saran},
    title={Enhanced Distributed Hash Tables for Complex Queries},
    proceedings={1st International ICST Conference on Communication System Software and MiddleWare},
    publisher={IEEE},
    proceedings_a={COMSWARE},
    year={2006},
    month={8},
    keywords={},
    doi={10.1109/COMSWA.2006.1665215}
}

Pankaj Garg
Amit Kumar
Huzur Saran
Year: 2006
Enhanced Distributed Hash Tables for Complex Queries
COMSWARE
IEEE
DOI: 10.1109/COMSWA.2006.1665215

Pankaj Garg^1,2^,*, Amit Kumar^1,2^,*, Huzur Saran^1,2^,*

1: Dept. of Computer Science and Engg.
2: IIT Delhi, New Delhi { 110016

*Contact email: pankaj@cse.iitd.ac.in, amitk@cse.iitd.ac.in, saran@cse.iitd.ac.in

Abstract

Peer-to-peer file sharing systems have become a very popular way of sharing large number of files over a distributed environment. One of the principal ingredients of such systems is a lookup service which maps a key denoting a file to a location storing the file. Dynamic hash tables (DHT's) were recently proposed as a means of supporting such a lookup service in a completely distributed manner. They have many desirable properties, but suffer from one serious drawback-in order to locate a file, we must have a precise knowledge of the key representing it. In this paper, we propose a lookup service which supports complex queries and has all the advantages of DHT's. We also compare our proposed method with PIER , another recently proposed peer-to-peer system for answering complex queries. Our experiments show that our method results in better utilization of the network than PIER

Published: 2006-08-07
Publisher: IEEE

: http://dx.doi.org/10.1109/COMSWA.2006.1665215