Efficient multi-view maintenance in the social semantic web

Abstract

The Social Semantic Web (SSW) refers to the mix of RDF data in web content, and social network data associated with those who posted that content. Applications to monitor the SSW are becoming increasingly popular. For instance, marketers want to look for semantic patterns relating to the content of tweets and Facebook posts relating to their products. Such applications allow multiple users to specify patterns of interest, and monitor them in real-time as new data gets added to the web or to a social network. In this paper, we develop the concept of SSW view servers in which all of these types of applications can be simultaneously monitored from such servers. The patterns of interest are views. We show that a given set of views can be compiled in multiple possible ways to take advantage of common substructures, and define the concept of an optimal merge. We develop a very fast MultiView algorithm that scalably and efficiently maintains multiple subgraph views. We show that our algorithm is correct, study its complexity, and experimentally demonstrate that our algorithm can scalably handle updates to hundreds of views on real-world SSW databases with up to 540M edges.

Materialized View Maintenance: Issues, Classification, and Open Challenges

“…It is particularly difficult to maintain RDF view in the Semantic Web setting due to the dynamic nature of Web data. Though there have been some proposed algorithms 20,61,123 in the literature to maintain RDF views. Table 1 shows a classification of literature methods of view maintenance based on the different proposed dimensions: technique, time, data availability, distribution, data source model, and view expressivity.…”

“…Each maintenance step executes view module to create nodes of view graphs for new graph pattern matches, to update existing nodes that already mark graph pattern matches, or to delete nodes that do not mark graph pattern matches anymore. More recently, RDF views have been addressed in (Vidal et al, 141 Pugliese et al 123 and Bröcheler et al 20 ). Thus, Pugliese and Bröcheler et al 20,123 have expressed patterns of interest as RDF views over an underlying graph or social network database.…”

“…More recently, RDF views have been addressed in (Vidal et al, 141 Pugliese et al 123 and Bröcheler et al 20 ). Thus, Pugliese and Bröcheler et al 20,123 have expressed patterns of interest as RDF views over an underlying graph or social network database. The authors developed scalable and efficient algorithms called "AddView and MultiView".…”

“…Even though huge efforts have been performed on view maintenance; however, there are some important aspects, which are called for further investigation. Indeed, the few proposed methods in the distributed context of both views and sources over graph data model and RDF views 20,123 require more effort from searchers. Thus, current view maintenance methods for the RDF data model have limitations resulting from the unstructured nature of RDF datasets.…”