DBScholar

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
3797
Venue
SIGMOD
Year
2006
Pagerank
6.5059395e-05
Overall Rank
4,791 | 67.14%
DOI
10.1145/1142473.1142475

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jagadish_sigmod06,
        title = {{Speeding up Search in Peer-to-Peer Networks with A Multi-way Tree Structure}},
        author = {Jagadish, H. V. and Ooi, Beng Chin and Tan, Kian-Lee and Vu, Quang Hieu and Zhang, Rong},
        series = {{SIGMOD} '06},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1142473.1142475},
        url = {https://dl.acm.org/doi/10.1145/1142473.1142475},
        year = {2006}
}

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
2,237 Approximate Range Selection Queries in Peer-to-Peer Systems 2003 CIDR 8.8901709e-05
2,278 BATON: A Balanced Tree Structure for Peer-to-Peer Networks 2005 VLDB 8.8160706e-05
Previous Page 1 / 1 Next

Semantically Similar Papers