Robust module-based data management
Technology Used: Java/J2EE
The current trend for building an ontology-based data management system (DMS) is to capitalize on efforts made to design a preexisting well-established DMS (a reference system). The method amounts to extracting from the reference DMS a piece of schema relevant to the new application needs ÃƒÂ¢Ã¢â€šÂ¬Ã¢â‚¬Å“ a module ÃƒÂ¢Ã¢â€šÂ¬Ã¢â‚¬Å“, possibly personalizing it with extra-constraints w.r.t. the application under construction, and then managing a dataset using the resulting schema. The existing definitions of modules is extended and novel properties of robustness that provide means for checking easily that a robust module-based DMS evolves safely w.r.t. both the schema and the data of the reference DMS. We carry out our investigations in the setting of description logics which underlie modern ontology languages, like RDFS from W3C.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Recent work in description logics provides different solutions to achieve such a reuse of a reference ontology-based DMS.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Existing definitions of modules in the literature basically resort to the notion of (deductive) conservative extension of a schema or of uniform interpolant of a schema.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Previous work formalizes schemas written in DLs and discusses their connection.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Up to now, conservative extension has been considered for defining a module as a subset of a schema.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Forgetting about non-interesting relations of a schema.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Data replication is possible
ÃƒÂ¯Ã‚ÂÃ‚Â¶ The reuse of a reference ontology-based DMS is revisited in order to build a new DMS with specific needs.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ The system not only considers the design of a module-based DMS (i.e., how to extract a module from a ontological schema): it is also studied how a module-based DMS can benefit from the reference DMS to enhance its own data management skills.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ RDF is the W3CÃƒÂ¢Ã¢â€šÂ¬Ã¢â€žÂ¢s Semantic Web data model, which is rapidly spreading in more and more applications, and can be seen as a simple relational model restricted to unary and binary predicates.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ DL-lite comes with efficient inference algorithms for querying RDF data through (DL-lite) ontologies and for checking data consistency w.r.t. integrity constraints expressed in DL-lite.
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Efficiently managing large RDF datasets
ÃƒÂ¯Ã‚ÂÃ‚Â¶ Robust module-based DMS evolves safely w.r.t. both the schema and the data of the reference DMS