A Proposal for the Characterization of Multi-Dimensional Inter-relationships of RDF Graphs Based on Set Theoretic Approach
Ayan Chakraborty, Shiladitya Munshi, Debajyoti Mukhopadhyay

TL;DR
This paper introduces a set theoretic method for analyzing and characterizing the complex inter-relationships among multiple RDF graphs, enhancing semantic web search capabilities.
Contribution
It proposes a formal set theoretic framework to identify and describe inter-relationships of RDF graphs, including n-dimensional induced relationships using RDF Schema.
Findings
A formal set theoretic criteria for RDF graph relationships
Refinement of inter-relationship analysis with RDF Schema
Framework for n-dimensional relationship characterization
Abstract
In this paper a Set Theoretic approach has been reported for analyzing inter-relationship between any numbers of RDF Graphs. An RDF Graph represents triples in Resource Description Format of semantic web. So the identification and characterization of criteria for inter-relationship of RDF Graphs shows a new road in semantic search. Using set theoretic approach, a sound framing criteria can be designed that examine whether two RDF Graphs are related and if yes, how these relationships could be described with formal set theory. Along with this, by introducing RDF Schema, the inter-relationship status is refined into n-dimensional induced relationships.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Advanced Database Systems and Queries · Data Management and Algorithms
