Parallel Indexing Scheme for Data Intensive Applications

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 representat...

Full description

Saved in:
Bibliographic Details
Published in:The International journal of networked and distributed computing (Online) 2015-04, Vol.3 (2), p.89-98
Main Authors: Funaki, Kenta, Hochin, Teruhisa, Nomiya, Hiroki, Nakanishi, Hideya, Kojima, Mamoru
Format: Article
Language:English
Subjects:
Distributed index
Insertion performance
Multi-dimensional index
Parallel processing
Research Article
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2211-7938
2211-7946
2211-7946
DOI:10.2991/ijndc.2015.3.2.3