PoweRGen: A power-law based generator of RDFS schemas

  • Authors:

  • Yannis Theoharis;George Georgakopoulos;Vassilis Christophides

  • Affiliations:

  • Institute of Computer Science, FORTH, Vassilika Vouton, P.O. Box 1385, Heraklion, GR 71110, Greece and Department of Computer Science, University of Crete, P.O. Box 2208, Heraklion, GR 71409, Gree ...;Department of Computer Science, University of Crete, P.O. Box 2208, Heraklion, GR 71409, Greece;Institute of Computer Science, FORTH, Vassilika Vouton, P.O. Box 1385, Heraklion, GR 71110, Greece and Department of Computer Science, University of Crete, P.O. Box 2208, Heraklion, GR 71409, Gree ...

  • Venue:
  • Information Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the amount of RDF datasets available on the Web has grown significantly over the last years, scalability and performance of Semantic Web (SW) systems are gaining importance. Current RDF benchmarking efforts either consider schema-less RDF datasets or rely on fixed RDFS schemas. In this paper, we present the first RDFS schema generator, termed PoweRGen, which takes into account the features exhibited by real SW schemas. It considers the power-law functions involved in (a) the combined in- and out-degree distribution of the property graph (which captures the domains and ranges of the properties defined in a schema) and (b) the out-degree distribution of the transitive closure (TC) of the subsumption graph (which essentially captures the class hierarchy). The synthetic schemas generated by PoweRGen respect the power-law functions given as input with an accuracy ranging between 89 and 96%, as well as, various morphological characteristics regarding the subsumption hierarchy depth, structure, etc.