Sciweavers

Share
PVLDB
2010

Efficient B-tree Based Indexing for Cloud Data Processing

9 years 11 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. To fully harness the power of the Cloud, efficient data management is needed to handle huge volumes of data and support a large number of concurrent end users. To achieve that, a scalable and high-throughput indexing scheme is generally required. Such an indexing scheme must not only incur a low maintenance cost but also support parallel search to improve scalability. In this paper, we present a novel, scalable B+ -tree based indexing scheme for efficient data processing in the Cloud. Our approach can be summarized as follows. First, we build a local B+ -tree index for each compute node which only indexes data residing on the node. Second, we organize the compute nodes as a structured overlay and publish a portion of the local B+ -tree nodes to the overlay for efficient query processing. Finally, we propose an...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
Added 20 May 2011
Updated 20 May 2011
Type Journal
Year 2010
Where PVLDB
Authors Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
Comments (0)
books