Abstract
Parallel multi-dimensional indexing system was proposed for big data analysis. The insertion and the retrieval performances were evaluated through randomly distributed data with three distribution schemes: area expansion, overlap, and proximity. This paper evaluates insertion and retrieval performances of this system through skewed data with the round robin method as well as three distribution schemes. It is experimentally clarified that the round robin method has good retrieval performance to randomly distributed data. It is also experimentally clarified that the proximity method has good retrieval performance especially for skewed data.
Author supplied keywords
Cite
CITATION STYLE
Nakanishi, K., Hochin, T., & Normiya, H. (2017). Evaluation of Parallel Multi-Dimensional Indexing System for Big Data Analysis. In Proceedings - 4th International Conference on Applied Computing and Information Technology, 3rd International Conference on Computational Science/Intelligence and Applied Informatics, 1st International Conference on Big Data, Cloud Computing, Data Science and Engineering, ACIT-CSII-BCD 2016 (pp. 105–110). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ACIT-CSII-BCD.2016.031
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.