Skip to main content
SpringerLink
Log in

Observing LOD Using Equivalent Set Graphs: It Is Mostly Flat and Sparsely Linked

  • Conference paper
  • First Online:
The Semantic Web – ISWC 2019 (ISWC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11778))

Included in the following conference series:

Abstract

This paper presents an empirical study aiming at understanding the modeling style and the overall semantic structure of Linked Open Data. We observe how classes, properties and individuals are used in practice. We also investigate how hierarchies of concepts are structured, and how much they are linked. In addition to discussing the results, this paper contributes (i) a conceptual framework, including a set of metrics, which generalises over the observable constructs; (ii) an open source implementation that facilitates its application to other Linked Data knowledge graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This paper uses the following RDF prefix declarations for brevity, and uses the empty prefix (:) to denote an arbitrary example namespace.

  2. 2.

    See http://webdatacommons.org.

  3. 3.

    See https://schema.org.

  4. 4.

    See http://lod-a-lot.lod.labs.vu.nl.

  5. 5.

    https://w3id.org/edwin/repository.

  6. 6.

    https://w3id.org/edwin/iswc2019_esgs.

  7. 7.

    https://github.com/timrdf/DataFAQs/wiki/Billion-Triples-Challenge.

References

  1. Asprino, L., Basile, V., Ciancarini, P., Presutti, V.: Empirical analysis of foundational distinctions in linked open data. In: Proceedings of IJCAI-ECAI 2018, pp. 3962–3969 (2018)

    Google Scholar 

  2. Beek, W., Raad, J., Wielemaker, J., van Harmelen, F.: sameAs.cc: the closure of 500M owl:sameAs statements. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 65–80. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93417-4_5

    Chapter  Google Scholar 

  3. Beek, W., Rietveld, L., Bazoobandi, H.R., Wielemaker, J., Schlobach, S.: LOD laundromat: a uniform way of publishing other people’s dirty data. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 213–228. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11964-9_14

    Chapter  Google Scholar 

  4. Ding, L., Finin, T.: Characterizing the semantic web on the web. In: Cruz, I., et al. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 242–257. Springer, Heidelberg (2006). https://doi.org/10.1007/11926078_18

    Chapter  Google Scholar 

  5. Ding, L., Shinavier, J., Shangguan, Z., McGuinness, D.L.: SameAs networks and beyond: analyzing deployment status and implications of owl:sameAs in linked data. In: Patel-Schneider, P.F., et al. (eds.) ISWC 2010. LNCS, vol. 6496, pp. 145–160. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17746-0_10

    Chapter  Google Scholar 

  6. Ding, L., Zhou, L., Finin, T., Joshi, A.: How the semantic web is being used: an analysis of FOAF documents. In: Proceedings of HICSS-38 (2005)

    Google Scholar 

  7. Fernández, J., Beek, W., Martínez-Prieto, M., Arias, M.: LOD-a-lot - a queryable dump of the LOD cloud. In: Proceedings of ISWC 2017, pp. 75–83 (2017)

    Google Scholar 

  8. Gil, R., García, R., Delgado, J.: Measuring the semantic web. AISSIGSEMIS Bull. 1(2), 69–72 (2004)

    Google Scholar 

  9. Halpin, H., Hayes, P.J., McCusker, J.P., McGuinness, D.L., Thompson, H.S.: When owl:sameAs isn’t the same: an analysis of identity in linked data. In: Patel-Schneider, P.F., et al. (eds.) ISWC 2010. LNCS, vol. 6496, pp. 305–320. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17746-0_20

    Chapter  Google Scholar 

  10. Hayes, P., Patel-Schneider, P.F.: RDF 1.1 Semantics, February 2014

    Google Scholar 

  11. Mallea, A., Arenas, M., Hogan, A., Polleres, A.: On blank nodes. In: Aroyo, L., et al. (eds.) ISWC 2011. LNCS, vol. 7031, pp. 421–437. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25073-6_27

    Chapter  Google Scholar 

  12. Meusel, R., Petrovski, P., Bizer, C.: The WebDataCommons microdata, RDFa and microformat dataset series. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 277–292. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11964-9_18

    Chapter  Google Scholar 

  13. Paulheim, H., Gangemi, A.: Serving DBpedia with DOLCE – more than just adding a cherry on top. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 180–196. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25007-6_11

    Chapter  Google Scholar 

  14. Theoharis, Y., Tzitzikas, Y., Kotzinos, D., Christophides, V.: On graph features of SemanticWeb schemas. IEEE Trans. Knowl. Data Eng. 20(5), 692–702 (2008)

    Article  Google Scholar 

  15. Urbani, J., Kotoulas, S., Maassen, J., van Harmelen, F., Bal, H.: OWL reasoning with WebPIE: calculating the closure of 100 billion triples. In: Aroyo, L., et al. (eds.) ESWC 2010. LNCS, vol. 6088, pp. 213–227. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13486-9_15

    Chapter  Google Scholar 

  16. Wang, T.D., Parsia, B., Hendler, J.: A survey of the web ontology landscape. In: Cruz, I., et al. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 682–694. Springer, Heidelberg (2006). https://doi.org/10.1007/11926078_49

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. STLab, ISTC-CNR, Rome, Italy

    Luigi Asprino & Valentina Presutti

  2. University of Bologna, Bologna, Italy

    Luigi Asprino & Paolo Ciancarini

  3. Department of Computer Science, VU University Amsterdam, Amsterdam, The Netherlands

    Wouter Beek & Frank van Harmelen

Authors
  1. Luigi Asprino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wouter Beek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Ciancarini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Frank van Harmelen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Valentina Presutti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luigi Asprino .

Editor information

Editors and Affiliations

  1. Fondazione Bruno Kessler, Trento, Italy

    Chiara Ghidini

  2. Linköping University, Linköping, Sweden

    Olaf Hartig

  3. University of Bonn, Bonn, Germany

    Maria Maleshkova

  4. University of Economics Prague, Prague, Czech Republic

    Vojtěch Svátek

  5. University of Illinois at Chicago, Chicago, IL, USA

    Isabel Cruz

  6. University of Chile, Santiago, Chile

    Aidan Hogan

  7. Memect Technology, Beijing, China

    Jie Song

  8. Mines Saint-Etienne, Saint-Etienne, France

    Maxime Lefrançois

  9. Inria Sophia Antipolis - Méditerranée, Sophia Antipolis, France

    Fabien Gandon

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Asprino, L., Beek, W., Ciancarini, P., van Harmelen, F., Presutti, V. (2019). Observing LOD Using Equivalent Set Graphs: It Is Mostly Flat and Sparsely Linked. In: Ghidini, C., et al. The Semantic Web – ISWC 2019. ISWC 2019. Lecture Notes in Computer Science(), vol 11778. Springer, Cham. https://doi.org/10.1007/978-3-030-30793-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30793-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30792-9

  • Online ISBN: 978-3-030-30793-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation