[ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ]

Journal of Information Science and Engineering, Vol. 35 No. 4, pp. 923-934

A Methodology for Indexing Temporal RDF Data

College of Computer Science and Technology
Nanjing University of Aeronautics and Astronautics
Nanjing, 211106 P.R. China

Time information widely exists in various real-world applications and RDF (Resource Description Framework) has been using as a data model and representation format for semantic data processing. With the rapid growth of RDF data with time features, efficient and effective management of temporal RDF data is an important task. For this purpose, we propose to index temporal RDF data in the paper. We propose a novel temporal RDF data index structure. We present its two levels of indexes: the first one is a global index for time information of RDF triples and the second is a local index for non-time information of RDF triples. We exploit efficient algorithms to build the global index and the local index. We evaluate our index approach from index performances and querying performances. The experimental results show that our index approach is scalable and efficient.

Keywords: RDF, temporal RDF, index structure, K-D tree index, bitmap index

  Retrieve PDF document (JISE_201904_13.pdf)