On the Synthetic Generation of Semantic Web Schemas

Authors:
Yannis Theoharis;George Georgakopoulos;Vassilis Christophides
Affiliations:
Institute of Computer Science, FORTH, Heraklion, Greece GR 71110 and Department of Computer Science, University of Crete, Heraklion, Greece GR 71409;Department of Computer Science, University of Crete, Heraklion, Greece GR 71409;Institute of Computer Science, FORTH, Heraklion, Greece GR 71110 and Department of Computer Science, University of Crete, Heraklion, Greece GR 71409
Venue:
Semantic Web, Ontologies and Databases
Year:
2008

Citing 9
Cited 0

Rule execution in CPLEX: a persistent objectbase

Lecture notes in computer science on Advances in object-oriented database systems
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
ToXgene: a template-based data generator for XML

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Studying the XML Web: Gathering Statistics from an XML Sample

World Wide Web
Graph mining: Laws, generators, and algorithms

ACM Computing Surveys (CSUR)
XMark: a benchmark for XML data management

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On Graph Features of Semantic Web Schemas

IEEE Transactions on Knowledge and Data Engineering
Benchmarking database representations of RDF/S stores

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication

PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to cope with the expected size of the Semantic Web (SW) in the coming years, we need to benchmark existing SWtools (e.g., query language interpreters) in a credible manner. In this paper we present the first RDFSschema generator, termed PoweRGen, which takes into account the morphological features that schemas frequently exhibit in reality. In particular, we are interested in generating synthetically the two core components of an RDFSschema, namely the property(relationships between classes or attributes) and the subsumption(subsumption relationships among classes) graph. The total-degree distribution of the former, as well as the out-degree distribution of the Transitive Closure (TC) of the latter, usually follow a power-law. PoweRGen produces synthetic property and subsumption graphs whose distributions respect the power-lawexponents given as input with a confidence ranging between 90 驴 98%.