Associated index for big structured and unstructured data

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In big data epoch, one of the major challenges is the large volume of mixed structured and unstructured data. Because of different form, structured and unstructured data are often considered apart from each other. However, they may speak about the same entities of the world. If a query involves both structured data and its unstructured counterpart, it is inefficient to execute it separately. The paper presents a novel index structure tailored towards associations between structured and unstructured data, based on entity co-occurrences. It is also a semantic index represented as RDF graphs which describes the semantic relationships among entities. Experiments show that the associated index can not only provide apposite information but also execute queries efficiently.

Cite

CITATION STYLE

APA

Zhu, C., Li, Q., Kong, L., Wang, X., & Hong, X. (2015). Associated index for big structured and unstructured data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9098, pp. 567–570). Springer Verlag. https://doi.org/10.1007/978-3-319-21042-1_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free