In this paper we present the reasoning mechanism in the OWLIM family of semantic repositories, which is based on materialization. This mechanism is evaluated using a combination of datasets from the Linked Open Data cloud in a public service called FactForge, where the benefits of materialization are manifested in improved SPARQL query performance.

Abstract The life cycle of a residential structure is separated into three stages: materialization, usage, and demolition, according to the theory buildings. Materialization, use, demolition computation models are built based on features building carbon emissions. model used calculate analyze sensitivity emissions during whole Qianluo 1# building. results demonstrate that total output for over ...

Object Real/Fictional Instance Concrete Object Materialisation Implementation

Dynamic content generation poses huge resource demands on web servers, creating a scalability problem. WebView Materialization, where web pages are cached and constantly refreshed in the background, has been shown to ameliorate the scalability problem without sacrificing data freshness. In this work we present an adaptive online algorithm to select which WebViews to materialize, that realizes t...

Greedy based approach for view selection at each step selects a beneficial view that fits within the space available for view materialization. Most of these approaches are focused around the HRU algorithm, which uses a multidimensional lattice framework to determine a good set of views to materialize. The HRU algorithm exhibits high run time complexity as the number of possible views is exponen...

This paper presents a precise correspondence between two views of taxonomic hierarchies: an intensional view based on concepts and an extensional view based on categories, i.e., subsets of the population of individuals analyzed in terms of these concepts. The correspondence is described with materialization, a generic relationship defined for object-oriented and entity-relationship information ...

View materialization is known to be a valuable technique for performance optimization in relational databases, and much work has been done addressing the problem of consistently maintaining relational views under update operations. However, little progress has been made thus far regarding the topic of view materialization in objectoriented databases (OODBs). In this paper, we demonstrate that t...

Recently, it has been shown that ontologies with large datasets can be efficiently materialized by a so-called abstraction refinement technique. The technique consists of the abstraction phase, which partitions individuals into equivalence classes, and the refinement phase, which re-partitions individuals based on entailments for the representative individual of each equivalence class. In this ...

We introduce an approach to view materialization which is based on relational reformulation. In this context, we present a method for automatically discovering views of the stored relations that are not already deened yet present valuable opportunities for materialization. The proposed reformu-lation algorithm works oo-line and consists of two stages. At the rst stage, Datalog rules relevant to...