Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1311.7202

Integrating RDF into Hypergraph-Graph (HG(2)) Data Structure

Shiladitya Munshi·Ayan Chakraborty·Debajyoti Mukhopadhyay
View original source ↗Read source document ↗Export metadata ↓

Abstract

Current paper discusses the methodologies involved in integrating Resource Description Framework into a HyperGraph Graph HG 2 data structure in order to preserve the semantics of the information contained in RDF document for dealing future cross platform information portability issues. The entire semantic web is mostly dominated by few information frameworks like RDF, Topic Map, OWL etc. Hence semantic web currently faces the problem of non existence of common information meta-model which can integrate them all for ex-panded semantic search. On the background of development of Hyper Graph Graph HG 2 data structure, an RDF document if integrated to it, maintains the original semantics and exposes some critical semantic and object mapping lift as well which could further be exploited for semantic search and information transitional problems. The focus of the paper is to present the mapping constructs between RDF elements and HyperGraph Graph HG 2 elements.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Shiladitya Munshi, Ayan Chakraborty, Debajyoti Mukhopadhyay. 2013-11-28. Integrating RDF into Hypergraph-Graph (HG(2)) Data Structure. https://arxiv.org/abs/1311.7202

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗