Abstract:

In order to represent and process time information， the extended research on temporal RDF （temporal resource description framework） model has been carried out， and how to effectively manage temporal RDF data has gradually become an important issue. Constructing a reasonable and effective index mechanism is one of the important ways to manage temporal RDF data and improve query efficiency. A two-stage indexing method for bitemporal RDF star query was proposed. First-stage indexing proposes a candidate set generation method based on bitemporal RDF node neighborhood information， and second-stage indexing further proposes a result set generation method based on bitmap indexing. With two-stage indexing， expensive join operations in star queries can be avoided and query results can be obtained quickly. This paper conducts comparative experiments in terms of query efficiency and index performance to verify the effectiveness of the proposed method.

Key words: resource description framework（RDF）, bitemporal RDF, star query, two-stage indexing, bitmap indexing