Database Paper Browser

Back to papers

Efficient B-tree Based Indexing for Cloud Data Processing

Summary: Local B+-trees per compute node index data resident on that node, enabling scalable, parallel search. An overlay publishes selected local B+-tree nodes to support cross-node queries, with an adaptive algorithm choosing published nodes by query patterns; EC2 experiments show dynamic, efficient, scalable cloud data processing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10055
Venue
VLDB
Year
2010
Pagerank
4.6155204e-05
Overall Rank
7,923 | 44.89%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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,985 A Practical Scalable Distributed B-Tree 2008 VLDB 9.8569956e-05
2,240 BATON: A Balanced Tree Structure for Peer-to-Peer Networks 2005 VLDB 9.2201128e-05
3,165 P-Ring: An Efficient and Robust P2P Range Index Structure 2007 SIGMOD 7.4539655e-05
4,871 Speeding up Search in Peer-to-Peer Networks with A Multi-way Tree Structure 2006 SIGMOD 5.8613852e-05
12,226 Indexing Multi-dimensional Data in a Cloud System 2010 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers