Efficient Index Maintenance for Frequently Updated Semantic Data

  • Authors:

  • Yan Liang;Haofen Wang;Qiaoling Liu;Thanh Tran;Thomas Penin;Yong Yu

  • Affiliations:

  • Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Institute AIFB, Universität Karlsruhe, Germany;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China

  • Venue:
  • ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Semantic Web data due to its capability to handle the Web-scale data and efficiency on query answering. Additionally, the huge volumes of data on the Semantic Web are frequently updated. Thus, it further requires effective update mechanisms for these systems to handle the data change. However, the existing update approaches only focus on document. It still remains a big challenge to update IR index specially designed for semantic data in the form of finer grained structured objects rather than unstructured documents. In this paper, we present a well-designed update mechanism on the IR index for triples. Our approach provides a flexible and effective update mechanism by dividing the index into blocks. It reduces the number of update operations during the insertion of triples. At the same time, it preserves the efficiency on query processing and the capability to handle large scale semantic data. Experimental results show that the index update time is a fraction of that by complete reconstruction w.r.t. the portion of the inserted triples. Moreover, the query response time is not notably affected. Thus, it is capable to make newly arrived semantic data immediately searchable for users.