Optimizing B-tree search performance of big data sets / Mohsen Marjani
Many applications continuously produce large amounts of various data every day, which exceeds the limit of conventional data storage tools. Such data typically includes a large amount of data with different formats that becomes very difficult to query using traditional indexing technologies. Indexin...
Saved in:
Main Author: | Mohsen , Marjani |
---|---|
Format: | Thesis |
Published: |
2017
|
Subjects: | |
Online Access: | http://studentsrepo.um.edu.my/9744/1/Mohsen_Marjani.pdf http://studentsrepo.um.edu.my/9744/2/Mohsen_Marjani_%E2%80%93_Thesis.pdf http://studentsrepo.um.edu.my/9744/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Multi-objective scheduling of MapReduce jobs in big data processing
by: Hashem, Ibrahim Abaker Targio, et al.
Published: (2018) -
An analysis on new hybrid parameter selection model performance over big data set
by: Mohamad, Masurah, et al.
Published: (2020) -
An analysis on new hybrid parameter selection model performance over big data set
by: Mohamad, Masurah, et al.
Published: (2020) -
Optimal search algorithm in a big database using interpolation–extrapolation method
by: Kabir, M. Nomani, et al.
Published: (2019) -
Big data security
by: Al-Shawabkeh, Mahmoud M. M.
Published: (2014)