Parallel Indexing Scheme for Data Intensive Applications

DOI

10.2991/ijndc.2015.3.2.3How to use a DOI?

Keywords

Multi-dimensional index, Parallel processing, Insertion performance, Distributed index

Abstract

This paper proposes a parallel indexing scheme of a large amount of data in order to resolve the issues about time limitation. Three kinds of computing-nodes are introduced. These are reception-nodes, representative-nodes, and normal-nodes. A reception-node receives data for insertion. A representative-node receives queries. Normal-nodes retrieve data from indexes. Here, three kinds of indexes are introduced. These are a whole-index, a partial-index, and a reception-index. In a partial-index, data are stored. In a whole-index, partial-indexes are stored as its data. In a reception-index, additional data are stored. The reception-index is moved to a normal-node, and becomes a partial-index. The proposed scheme is also a data distribution scheme for shortening the insertion time. A reception-node accepts additional data even if the index is already built.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Kenta Funaki
AU  - Teruhisa Hochin
AU  - Hiroki Nomiya
AU  - Hideya Nakanishi
PY  - 2015
DA  - 2015/04/01
TI  - Parallel Indexing Scheme for Data Intensive Applications
JO  - International Journal of Networked and Distributed Computing
SP  - 89
EP  - 98
VL  - 3
IS  - 2
SN  - 2211-7946
UR  - https://doi.org/10.2991/ijndc.2015.3.2.3
DO  - 10.2991/ijndc.2015.3.2.3
ID  - Funaki2015
ER  -