Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The design and implementation of the redland RDF application framework
Proceedings of the 10th international conference on World Wide Web
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Storage and Querying of E-Commerce Data
Proceedings of the 27th International Conference on Very Large Data Bases
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
| Hi-index | 0.00 |
With the growth of ontology scale and complexity, the query performance of Ontology Repository Management System (ORMS) becomes more and more important. The paper proposes materialized relations technique which speeds up query processing in ORMS by making the implicit derived relations of ontology explicit. Here the selection of materialized relations is a key problem, because the materialized relations technique trades off required inference time against maintenance cost and storage space. However, the problem has not been discussed formally before. So the paper proposes a QSS model to describe the queries set of ontology formally and gives the benefit evaluation model and the selection algorithm of materialized relations based on QSS model. The method in this paper not only considers the benefit in query response of the materialization technique, but also the storage and maintenance cost of it. In the end, an application case is introduced to prove the selection method of materialized relations is effective.