2020•Solid State TechnologyRequires access

Research on Indexing Mechanism for Massive Distributed Data Fragment Storage

Huan Wang, Yong Kang Peng, Huajian Huang, Junyi Deng, Huajun Huang, Jingxian Liu

Open publisher page 0 citations

Abstract

Currently, massive distributed storage systems store a large number of interrelated heterogeneous data, but lack of a perfect indexing mechanism to solve the query problem of massive heterogeneous data. Therefore, this paper proposes an index model based on the combination of associative index and auxiliary index. The model uses the description of the common entity between structured data and unstructured data to establish a relationship, and creates an index as a keyword to establish an associated index layer. At the same time, a secondary index layer is established at each node to create an R tree index for the structured data, and an entity-based inverted index is created for the unstructured free document, thereby improving the query efficiency and accuracy. Experimental results show that the indexing system can not only effectively support mixed queries of heterogeneous data, but also improve the accuracy of query results.

About this research paper

What this paper is about

Currently, massive distributed storage systems store a large number of interrelated heterogeneous data, but lack of a perfect indexing mechanism to solve the query problem of massive heterogeneous data. Therefore, this paper proposes an index model based on the combination of associative index and auxiliary index. The model uses the description of the common entity between structured data and unstructured data to establish a relationship, and creates an index as a keyword to establish an associated index layer. At the same time, a secondary index layer is established at each node to create an R tree index for the structured data, and an entity-based inverted index is created for the unstructured free document, thereby improving the query efficiency and accuracy. Experimental results show that the indexing system can not only effectively support mixed queries of heterogeneous data, but also improve the accuracy of query results.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Currently, massive distributed storage systems store a large number of interrelated heterogeneous data, but lack of a perfect indexing mechanism to solve the query problem of massive heterogeneous data. Therefore, this paper proposes an index model based on the combination of associative index and auxiliary index. The model uses the description of the common entity between structured data and unstructured data to establish a relationship, and creates an index as a keyword to establish an associated index layer. At the same time, a secondary index layer is established at each node to create an R tree index for the structured data, and an entity-based inverted index is created for the unstructured free document, thereby improving the query efficiency and accuracy. Experimental results show that the indexing system can not only effectively support mixed queries of heterogeneous data, but also improve the accuracy of query results.

Key concepts: Search engine indexing, Computer science, Index (typography), Inverted index, Data mining, Layer (electronics), Information retrieval, Tree (set theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on Indexing Mechanism for Massive Distributed Data Fragment Storage — Research Paper | ScholarLens