P-tree

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

P-tree: a p2p index for resource discovery applications

Full text

Pdf (111 KB)

Source

International World Wide Web Conference archive
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters table of contents

New York, NY, USA

POSTER SESSION: Posters table of contents

Pages: 390 - 391

Year of Publication: 2004

ISBN:1-58113-912-8

Authors

Adina Crainiceanu	Cornell University, Ithaca, NY
Prakash Linga	Cornell University, Ithaca, NY
Johannes Gehrke	Cornell University, Ithaca, NY
Jayavel Shanmugasundaram	Cornell University, Ithaca, NY

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 33, Citation Count: 4

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1013367.1013490 What is a DOI?

ABSTRACT

We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree. P-trees efficiently support range queries in addition to equality queries.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Karl Aberer, P-Grid: A Self-Organizing Access Structure for P2P Information Systems, Proceedings of the 9th International Conference on Cooperative Information Systems, p.179-194, September 05-07, 2001
	2	James Aspnes , Gauri Shah, Skip graphs, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	3	Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979 [doi>10.1145/356770.356776]
	4	A. Crainiceanu et al. Querying peer-to-peer networks using p-trees. In Cornell University TR 2004-1926, 2004.
	5	A. Daskos et al. Peper: A distributed range addressing space for p2p systems. In DBISP2P, 2003.
	6	A. Gupta et al. Approximate range selection queries in peer-to-peer systems. In CIDR, 2003.
	7	David Lomet, Replicated indexes for distributed data, Proceedings of the fourth international conference on on Parallel and distributed information systems, p.108-119, December 18-20, 1996, Miami Beach, Florida, United States
	8	Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Schenker, A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.161-172, August 2001, San Diego, California, United States
	9	A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, 2001.
	10	Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.149-160, August 2001, San Diego, California, United States

CITED BY 4

	Spyros A. Sioutas, NBDT: an efficient P2P indexing scheme for web service discovery, International Journal of Web Engineering and Technology, v.4 n.1, p.95-113, December 2008
	Christos Doulkeridis , Akrivi Vlachou , Yannis Kotidis , Michalis Vazirgiannis, Peer-to-peer similarity search in metric spaces, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	Moreno Marzolla , Matteo Mordacchini , Salvatore Orlando, Peer-to-peer systems for discovering resources in a dynamic grid, Parallel Computing, v.33 n.4-5, p.339-358, May, 2007
	S. Sioutas , E. Sakkopoulos , Ch. Makris , B. Vassiliadis , A. Tsakalidis , P. Triantafillou, Dynamic Web Service discovery architecture based on a novel peer based overlay network, Journal of Systems and Software, v.82 n.5, p.809-824, May, 2009