Abstract
Marine data is a typical big data that features multi-source, multi-class, multi-dimension and massiveness. Rapid query to big marine data is the fundamental request in vast marine applications. To improve query performance, we should devise a complete index structure. In this paper we propose a multi-layer index (ML-index, for short) with regarding to Time Interval B+-tree and Hybrid Space Partition Tree (HSP-tree, for short). It employs Marine data value function that consists of data time length, data access frequency etc. to optimize the primary key index (i.e. B+-tree). Moreover, we propose an adaptive space partition method on the basis of data characters, user query habits and data unit capacity particularly. Furthermore we build a secondary index, namely, the HSP-tree over the above partition result. We show the results of experiment that compares ML-index with two state-of-the-art index methods on the real marine data. These suggest that the ML-index enable user to perform marine data query in about 2/3 the time needed by the state-of-the-art tools.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mayer-Schönberger, V., Cukier, K.: Big data: a revolution that will transform how we live, work, and think. Houghton Mifflin Harcourt (2013)
Meng, X.-F., Ci, X.: Big data management: concepts, techniques and challenges. J. Comput. Res. Dev. 50(1), 146–169 (2013)
Shi, S., Lei, B.: Theory and Practice on China Digital Ocean, pp. 1–16. Ocean Press, Beijing (2011)
Liu, X.-S., Zhang, X., Chi, T.-H., et al.: Study on China digital ocean prototype system. In: Proceedings of the 2009 WRI World Congress, pp. 466–469. IEEE, Piscataway (2009)
Zhou, X.-M., Wang, G.-R.: Key dimension based high-dimensional data partition strategy. J. Softw. 15(9), 1360–1374 (2004)
Chen, J., Fang, B.-X., Tan, J.-L., et al.: Index filtering algorithm based on minimum enclosing circle partition. J. Comput. 35(10), 2139–2146 (2012)
Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB 98, pp. 194–205 (1998)
Robinson, J.T.: The KDB-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of 1981 ACM SIGMOD on Data Management, pp. 10–18. ACM (1981)
Beckmann, N., Kriegel, H.P., Schneider, R., et al.: The R*-tree: an efficient and robust access method for points and rectangles, pp. 322–331. ACM (1990)
Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. (TODS) 9(1), 38–71 (1984)
Goil, S., Nagesh, H.: MAFIA: efficient and scalable subspace clustering for very large data sets. In: Proceedings of SIGKDD on Data Mining, pp. 443–452 (1999)
Huang, D.-M., Du, Y.-L., He, Q.: Migration algorithm for big marine data in hybrid cloud storage. J. Integr. Plant Biol. 2014(01), 199–205 (2014)
Acknowledgments
This work is Supported by National Natural Science Foundation of China (61272098), Natural Science Foundation of Shanghai (13ZR1455800) and Scientific Research Foundation for Ph.D. Of shanghai Ocean Univ.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Huang, D., Sun, L., Zhao, D., Zheng, X. (2014). An Efficient Hybrid Index Structure for Temporal Marine Data. In: Chen, Y., et al. Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science(), vol 8597. Springer, Cham. https://doi.org/10.1007/978-3-319-11538-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-11538-2_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11537-5
Online ISBN: 978-3-319-11538-2
eBook Packages: Computer ScienceComputer Science (R0)