Hits:

Affiliation of Author(s):计算机科学与技术学院/人工智能学院/软件学院

Title of Paper:Indexing temporal RDF graph

Journal:COMPUTING

Key Words:RDF Temporal RDF graph Suffix path Prefix path B-tree Frequent elements

Abstract:Time data can be found in various real-world applications and different models have been proposed to model temporal information. With the wide utilization of the Web and the availability of massive Web resources, temporal Resource Description Framework (RDF) model has attracted more and more attention. In this paper, we propose an index approach for temporal RDF graphs to effectively query massive temporal RDF data. We build the prefix path index for querying subjects of temporal RDF triples and the suffix index for querying objects of temporal RDF triples, respectively. Meanwhile, we use frequent elements to improve the efficiency of the index we proposed. We also adopt B-tree index to manage all elements of triples. Our index approach can support inserting and deleting temporal triples in temporal RDF graphs. Experimental results show that our index approach can efficiently process queries in temporal RDF graphs.

ISSN No.:0010-485X

Translation or Not:no

Date of Publication:2019-10-01

Co-author:Zhao, Ping,lzp,mazongmin

Correspondence Author:mazongmin,yanli