DBScholar

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
10246
Venue
VLDB
Year
2010
Pagerank
5.5361352e-05
Overall Rank
7,827 | 46.31%
DOI
10.14778/1920841.1920991

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wu_vldb10,
        title = {{Efficient B-tree Based Indexing for Cloud Data Processing}},
        author = {Wu, Sai and Jiang, Dawei and Ooi, Beng Chin and Wu, Kun-Lung},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        pages = {1207--1218},
        doi = {10.14778/1920841.1920991},
        url = {https://doi.org/10.14778/1920841.1920991},
        year = {2010}
}

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
2,001 A Practical Scalable Distributed B-Tree 2008 VLDB 9.3326014e-05
2,278 BATON: A Balanced Tree Structure for Peer-to-Peer Networks 2005 VLDB 8.8160706e-05
3,187 P-Ring: An Efficient and Robust P2P Range Index Structure 2007 SIGMOD 7.6555242e-05
4,791 Speeding up Search in Peer-to-Peer Networks with A Multi-way Tree Structure 2006 SIGMOD 6.5059395e-05
12,421 Indexing Multi-dimensional Data in a Cloud System 2010 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers