Query-Oriented Summarization of RDF Graphs

Čebirić, Šejla; Goasdoué, François; Manolescu, Ioana

doi:10.1007/978-3-319-20424-6_9

Cited by 25 publications

(42 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Where U is the arrangement of URIs (Uniform Resource Identifiers) [5], the blank node identifiers are represented by , and L means the arrangement of RDF literals. Here, The sensitive data of the RDF is encrypted by using the advanced encryption algorithms like AES [28], DES [29] and RSA [30].…”

Section: Framework For Secured Data Modelmentioning

confidence: 99%

Cloud Based RDF Security: A Secured Data Model for Cloud Computing

Arulanandu¹,

Murthy²,

Nagraj³

2018

IJIES

View full text Add to dashboard Cite

Abstract:In this paper, a new secured data model for cloud computing is proposed which uses partial resource description framework (RDF) encryption and token based access control system in which sensitive data in an RDF graph is encrypted and all other non-sensitive data are publicly lucid. The security process, the decryption process, and query process are the three essential procedures in this framework. The consequence of the security process is the encrypted data, encrypted metadata, and plain text fragments. The proposed technique permits the token based access control system for the decryption procedure. The query process incorporates the map reduce framework is for lessening the immense measure of employments. At long last, the query answer is sent to the user in light of the access token list (AT-list) of the system administrator. Our test comes about demonstrate that, the performance of the proposed technique is assessed in view of the precision, recall and execution time of the framework. Our proposed approach is actualized using Java and keep running on Windows XP framework and the Lehigh University Benchmark (LUBM) datasets are used for our examination. In the paper this new secured RDF data model is deployed and tested using AWS elastic beanstalk.

show abstract

Section: Framework For Secured Data Modelmentioning

confidence: 99%

Cloud Based RDF Security: A Secured Data Model for Cloud Computing

Arulanandu¹,

Murthy²,

Nagraj³

2018

IJIES

View full text Add to dashboard Cite

show abstract

“…Conversely, type-first approaches summarize graph nodes first (or only) by their types. Below, we recall two quotient summaries described in [11], [18], which are the starting point of this work; they are both very compact, and illustrate the data-first and typefirst approaches respectively. They both rely on the notion of property cliques:…”

Section: Types In Summarization: First or Last?mentioning

confidence: 99%

“…Two RDF summaries introduced in [11] have been subsequently [18] redefined as quotients. They differ in their treatment of the types which may be attached to RDF graph nodes.…”

Section: Introductionmentioning

confidence: 99%

“…Given an equivalence relation ≡, for each equivalence class C (that is, maximal set of graph nodes comprising nodes all equivalent to each other), the summary has exactly one node n C in the summary. Example of quotient-based summaries include [4], [5], [6], [7], [17], [11], [10], [12]; other summaries (including Dataguides) are not quotient-based.…”

Section: Introductionmentioning

confidence: 99%

“…Each node from the summary graph represents, in some sense, a set of nodes from the input graph. Many other graph summarization proposals have been made, for OEM [4], later for XML trees with ID-IDREF links across tree nodes (thus turning an XML database into a graph) [5], [6], [7], and more recently for RDF [8], [9], [10], [11], [12], [13]; many more works have appeared in this area, some of which are presented in a recent tutorial [14]. Related areas are concerned with graph compression, e.g.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Quotient RDF Summaries Based on Type Hierarchies

Guzewicz

Manolescu

2018

2018 IEEE 34th International Conference on Data Engineering Workshops (ICDEW)

Self Cite

View full text Add to dashboard Cite

Abstract-Summarization has been applied to RDF graphs to obtain a compact representation thereof, easier to grasp by human users. We present a new brand of quotient-based RDF graph summaries, whose main novelty is to summarize together RDF nodes belonging to the same type hierarchy. We argue that such summaries bring more useful information to users about the structure and semantics of an RDF graph.

show abstract

Browsing Linked Data Catalogs with LODAtlas

Pietriga

Gözükan²,

Appert³

et al. 2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The Web of Data is growing fast, as exemplified by the evolution of the Linked Open Data (LOD) cloud over the last ten years. One of the consequences of this growth is that it is becoming increasingly difficult for application developers and end-users to find the datasets that would be relevant to them. Semantic Web search engines, open data catalogs, datasets and frameworks such as LODStats and LOD Laundromat, are all useful but only give partial, even if complementary, views on what datasets are available on the Web. We introduce LODAtlas, a portal that enables users to find datasets of interest. Users can make different types of queries about both the datasets' metadata and contents, aggregated from multiple sources. They can then quickly evaluate the matching datasets' relevance, thanks to LODAtlas' summary visualizations of their general metadata, connections and contents.

show abstract

Query-Oriented Summarization of RDF Graphs

Cited by 25 publications

References 1 publication

Cloud Based RDF Security: A Secured Data Model for Cloud Computing

Cloud Based RDF Security: A Secured Data Model for Cloud Computing

Quotient RDF Summaries Based on Type Hierarchies

Browsing Linked Data Catalogs with LODAtlas

Contact Info

Product

Resources

About