MLB+-tree: A Multi-level B+-tree Index for Multidimensional Range Query on Seismic Data

Seismic processing is an important technology in petroleum industry. Processing results are usually observed and analyzed by petroleum scientists via interactive applications. In these applications, multidimensional range queries are frequently executed to fetch the data that users are interested in. The traditional B+-tree index does not work well for these queries because considerable index data has to be scanned from storage devices during the query execution. In this paper, we present MLB +-tree, a multi-level B+-tree index to accelerate multidimensional range queries on seismic data. Thinner index slices will be accessed by using MLB +-tree and query latency is reduced accordingly. An adaptive index selection method is also introduced to find the best index for various queries. Our experiments show that MLB +-tree outperforms B+-tree in most multidimensional range queries on different datasets. Since most queries are ad-hoc, fast index construction is desirable in seismic processing. To cope with this problem, we present a distributed index construction algorithm based on the map-reduce programming model. Our implementation of this index construction algorithm gains approximately linear speedup on a 64-nodes high-performance cluster in our experiment.

[1]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[2]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[3]  Marcos K. Aguilera,et al.  A practical scalable distributed B-tree , 2008, Proc. VLDB Endow..

[4]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[5]  Wei Zhou,et al.  SNB-index: a SkipNet and B+ tree based auxiliary Cloud index , 2014, Cluster Computing.

[6]  Kenneth A. Ross,et al.  Cache Conscious Indexing for Decision-Support in Main Memory , 1999, VLDB.

[7]  Peiquan Jin,et al.  Optimizing B+-tree for hybrid storage systems , 2014, Distributed and Parallel Databases.

[8]  Pradeep Dubey,et al.  FAST: fast architecture sensitive tree search on modern CPUs and GPUs , 2010, SIGMOD Conference.

[9]  Tapio Lahdenmäki,et al.  Relational Database Index Design and the Optimizers: DB2, Oracle, SQL Server, et al. , 2005 .

[10]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[11]  David Wai-Lok Cheung,et al.  Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index , 2010, IEEE Transactions on Knowledge and Data Engineering.

[12]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[13]  Wolfgang Lehner,et al.  k-ary search on modern processors , 2009, DaMoN '09.

[14]  Beng Chin Ooi,et al.  Efficient B-tree based indexing for cloud data processing , 2010, Proc. VLDB Endow..

[15]  Kenneth A. Ross,et al.  Making B+- trees cache conscious in main memory , 2000, SIGMOD '00.