Abstract
Current paper introduces a Constraint Driven Stratificatified Model for RDF with Hypergraph-Graph (HG(2)) model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. In general, the schema component of RDF i,e RDFS is unstratified in nature. In order to establish a sustained information integration of RDF and Topic Map or other stratified semantic metamodel, imposing some constraints on RDF (without any semantic loss) evolves as an imperative pre condition. While HG(2) data structure is claimed to realize complex combinatorial structures, the current investigation reports a novel HG(2) based model for constraint driven stratification of RDF without any loss of semantic expressiveness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernees-Lee, T., Hendler, J., Lasilla, O.: The Sumentic Web. Scientific American (2001)
Graham, M.: RDF and Topic Maps: An exercise in convergence. In: Proceedings of XML Europe (2001)
Lacher, M.S., Stefan, D.: On the Integration of Topic Maps and RDF Data. In: Extreme Markup Languages Conference (2001)
Munshi, S., Chakraborty, A., Mukhopadhyay, D.: A Hybrid Graph based Framework for Integrating Information from RDF and Topic Map: A Proposal. In: Cube Conference (2012)
Hayes, J.: A Graph Model for RDF. Diploma Thesis, Technische Universität Darmstadt, Universidad de Chile (2004)
Auillans, P., Ossona de Mendez, P., Rosenstiehl, P., Vatant, B.: A Formal Model for Topic Maps. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 69–83. Springer, Heidelberg (2002)
Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)
Boullie, F.: Un modèle universel de banque de données, simultanément partageable, portable et répartie. Thèse de Doctorat d’Etat es Sciences Mathématiques (mention Informatique), Université Pierre et Marie Curie (1977)
Berge, C.: Minimax theorems for normal hypergraphs and balanced hypergraphs - a survey. Annals of Discrete Mathematics 21, 3–19 (1984)
Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland, Amsterdam (1989)
Nilsson, N.J.: Problem Solving Methods in Artificial Intelligence. McGraw-Hill, New York (1971)
Nilsson, N.J.: Principles of Artificial Intelligence. Morgan Kaufmann, Los Altos (1980)
Nguyen, S., Pallottino, S.: Hyperpaths and shortest hyperpaths. In: Simeone, B. (ed.) Combinatorial Optimization. Lecture Notes in Mathematics, vol. 1403, pp. 258–271. Springer, Berlin (1989)
Alpert, C.J., Caldwell, A.E., Kahng, A.B., Markov, I.L.: Hypergraph Partitioning with Fixed Vertices. IEEE Trans. on CAD 19(2), 267–272
Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Processing Letters 10, 253-266
Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 488–498. Springer, Heidelberg (2004)
Trifunovic, A.: Parallel Algorithms for Hypergraph Partitioning. PhD Thesis, University of London (February 2006) (Abstract)
Gallo, G., Longo, G., Nguyen, S., Pallottino, S.: Directed Hypergraphs and Applications, http://www.cis.upenn.edu/~lhuang3/wpe2/papers/gallo92directed.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Munshi, S., Chakraborty, A., Mukhopadhyay, D. (2013). Constraint Driven Stratification of RDF with Hypergraph Graph (HG(2)) Data Structure. In: Unnikrishnan, S., Surve, S., Bhoir, D. (eds) Advances in Computing, Communication, and Control. ICAC3 2013. Communications in Computer and Information Science, vol 361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36321-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-36321-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36320-7
Online ISBN: 978-3-642-36321-4
eBook Packages: Computer ScienceComputer Science (R0)