Database Paper Browser

Back to papers

Speeding up Search in Peer-to-Peer Networks with A Multi-way Tree Structure

Summary: BATON*, a multi-way tree P2P search structure, achieves O(log_m N) search with fanout m; update cost is linear in m. Experimental analysis shows the trade-off between search and update costs, and BATON* adds multi-attribute query support. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3735
Venue
SIGMOD
Year
2006
Pagerank
5.8613852e-05
Overall Rank
4,871 | 66.12%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,680 Approximate Range Selection Queries in Peer-to-Peer Systems 2003 CIDR 0.00010931115
2,240 BATON: A Balanced Tree Structure for Peer-to-Peer Networks 2005 VLDB 9.2201128e-05
Previous Page 1 / 1 Next

Semantically Similar Papers