Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/jmkim/10.1007-978-981-10-4154-9_60
Improving the B+-Tree Construction for Transaction Log Data in Bank System Using Hadoop
https://github.com/jmkim/10.1007-978-981-10-4154-9_60
b-tree big-data bplustree hadoop mapreduce
Last synced: 13 days ago
JSON representation
Improving the B+-Tree Construction for Transaction Log Data in Bank System Using Hadoop
- Host: GitHub
- URL: https://github.com/jmkim/10.1007-978-981-10-4154-9_60
- Owner: jmkim
- Created: 2017-07-15T06:25:06.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2017-07-15T07:29:28.000Z (over 7 years ago)
- Last Synced: 2024-11-27T12:43:25.398Z (2 months ago)
- Topics: b-tree, big-data, bplustree, hadoop, mapreduce
- Language: Java
- Homepage: https://link.springer.com/chapter/10.1007/978-981-10-4154-9_60
- Size: 3.91 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ICISA 2017
## About our paper
### Title
Improving the B+-Tree Construction for Transaction Log Data in Bank System Using Hadoop
### Author
- [Cong Viet-Ngu Huynh]( mailto:[email protected] )
- [Jongmin Kim]( mailto:[email protected] )
- [Jun-Ho Huh]( mailto:[email protected] )
### Abstract
In Socialist Republic of Vietnam, applying the Big data to process any kind of data is still a challenge, especially in the banking sector. Until now, there is only one bank applied Big data to develop a data warehouse system has focused, consistent, can provide invaluable support to executives make immediate decisions, as well as planning long-term strategies, however, it still not able to solve any specific problem. Nowadays, from the fact large amounts of traditional data are still increasing significantly, if B-tree is considered as the standard data structure that manage and organize this kind of data, B+-tree is the most well-known variation of B-tree that is very suitable for applying bulk loading technique in case of data is available. However, it usually takes a lot of time to construct a B+-tree for a huge volume of data. In this paper, we propose a parallel B+-Tree construction scheme based on a Hadoop framework for Transaction log data. The proposed scheme divides the data into partitions, builds local B+-trees in parallel, and merges them to construct a B+-tree that covers the whole data set. While generating the partitions, it considers the data distribution so that each partitions have nearly equal amounts of data. Therefore the proposed scheme gives an efficient index structure while reducing the construction time.
### Published on
March 18, 2017
### Published to
Kim K., Joukov N. (eds) Information Science and Applications 2017. ICISA 2017. Lecture Notes in Electrical Engineering, vol 424. Springer, Singapore
### DOI
10.1007/978-981-10-4154-9_60
### Links
- [SpringerLink]( https://link.springer.com/chapter/10.1007/978-981-10-4154-9_60 )
## About this code
### Summary
This code only contains B+ tree construction prototype using [MapDB]( http://www.mapdb.org ), and sample transaction data creation.
### Dependencies/Libraries
- [eclipse-collections-7.1.0]( https://mvnrepository.com/artifact/org.eclipse.collections/eclipse-collections/7.1.0 )
- [eclipse-collections-api-7.1.0]( https://mvnrepository.com/artifact/org.eclipse.collections/eclipse-collections-api/7.1.0 )
- [elsa-3.0.0-M6]( https://mvnrepository.com/artifact/org.mapdb/elsa/3.0.0-M6 )
- [guava-21.0]( https://mvnrepository.com/artifact/com.google.guava/guava/21.0 )
- [lz4-1.3.0]( https://mvnrepository.com/artifact/net.jpountz.lz4/lz4/1.3.0 )
- [mapdb-3.0.3]( https://mvnrepository.com/artifact/org.mapdb/mapdb/3.0.3 )