Dynamic Hilbert curve-based B+-Tree to manage frequently updated data in big data applications

Life Science Journal

Volumn 11, Issue 10, 2014, Pages 454-461

  Seo, Dongmin ^a   Shin, Sungho ^a   Kim, Youngmin ^a   Jung, Hanmin ^a   Song, Sa Kwang ^a  

^a Korea Institute of Science and Technology Information (KISTI)   (South Korea)

Author keywords

Big data; Dynamic Hilbert curve; Frequently updated data; Multi dimensional data

Indexed keywords

EID: 84903213906     PISSN: 10978135     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Azhar R, Adnan A, Saeed M, Shah K. The performance of mapreduce over the varying nature of data. J. Life Science 2013;10(4):1263-1266.
2. Antonin G. R-trees: a dynamic index structure for spatial searching. Proc. Management of Data 1984;14(2):47-57.
3. Dongseop K, Sangjun L, Sukho L. Indexing the current positions of moving objects using the lazy update R-tree. Proc. Mobile Data Management 2002;113-120.
4. Mongli L, Wynne H, Christian S.J, Bin C, Kenglik T. Supporting frequent updates in Rtrees: a bottom-up approach. Proc. Very Large Database 2003;29:608-619.
5. Philip L.L, Bing Y. Efficient locking for concurrent operations on B-tree. J. ACM Transactions on Database Systems 1981;6(4):650-670.
6. Christian S.J, Dan L, Beng C.O. Query and update efficient B+-tree based indexing of moving objects. Proc. Very Large Database 2004;30:768-779.
7. Man L.Y, Yufei T, Nikos M. The Bdual-tree: indexing moving objects by space filling curves in the dual space. J. Very Large Database 2008;17(3):379-400.
8. Yufei T, Dimitris P, Jimeng S. The TPR*-tree: an optimized spatio-temporal access method for predictive queries. Proc. Very Large Database 2003;29:790-801.
9. Srinivasan V, Michael J.C. Performance of B+tree concurrency control algorithms. J. Very Large Database 1993;2(4):361-406.
10. Bongki M, Jagadish H.V, Christos F, Joel H.S. Analysis of the clustering properties of Hilbert space-filling curve. J. IEEE 2001;13(1):124-141.