Materialized View Selection Scheme for enhancing RDF Query Performance

AbstractWith the development of the semantic web, a large amount of data being produced nowadays is in RDF format. RDF is represented by a triple. An RDF database consisting of triples requires the high cost of join query processing. Materialized view is known as a scheme to reduce the query processing cost by accessing materialized views without accessing the database. It is physically stored the results or the intermediate results of the query processing in a storage area. In this paper, we propose a materialized view selection scheme by using decision tree to solve such a problem. The decision tree considers the size and maintenance costs of the materialized view as well as the profit of query response times. It is shown through performance evaluation that the proposed scheme increases the number of materialized views in the limited storage space and decreases the update rates of the materialized views. ■ keyword : ∣RDF∣Decision Tree ∣Materialized View ∣Shortcut ∣ * 이 논문은 미래창조과학부 및 정보통신기술진흥센터의 대학ICT연구센터육성 지원사업(IITP-2015-H8501-15-1013), 교육부와 한국연구재단의 지역혁신인력양성사업(No.2013H1B8A2032298), 2013년도 정부(미래창조과학부)의 재원으로 한국연구재단의 지원을 받아 수행된 연구임(No.2013R1A2A2A01015710), 2014년도 정부(교육부)의 재원으로 한국연구재단의 지원을 받아 수행된 기초연구사업임(No.2014R1A1A2055778).접수일자 : 2015년 06월 25일 수정일자 : 2015년 07월 24일 심사완료일 : 2015년 07월 24일 교신저자 : 유재수, e-mail : yjs@chungbuk.ac.kr