Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/38943
Title: Efficient btree based indexing for cloud data processing
Authors: Wu, S. 
Jiang, D. 
Ooi, B.C. 
Wu, K.
Issue Date: 2010
Source: Wu, S.,Jiang, D.,Ooi, B.C.,Wu, K. (2010). Efficient btree based indexing for cloud data processing. Proceedings of the VLDB Endowment 3 (1) : 1207-1218. ScholarBank@NUS Repository.
Abstract: 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 adaptive algorithm to select the published B +-tree nodes according to query patterns. We conduct extensive experiments on Amazon's EC2, and the results demonstrate that our indexing scheme is dynamic, efficient and scalable. © 2010 VLDB Endowment.
Source Title: Proceedings of the VLDB Endowment
URI: http://scholarbank.nus.edu.sg/handle/10635/38943
ISSN: 21508097
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

67
checked on Dec 15, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.