graph database systems two categories
play

Graph Database Systems Two Categories o u r c e : h t t p - PowerPoint PPT Presentation

I m a g e s Graph Database Systems Two Categories o u r c e : h t t p s : / / c o m m o n s . w i k i m e d i a . o r g / w i k i / F i l e : C O V E R E D _ B R I D G E _ A T


  1. I m a g e s Graph Database Systems – Two Categories o u r c e : h t t p s : / / c o m m o n s . w i k i m e d i a . o r g / w i k i / F i l e : C O V E R E D _ B R I D G E _ A T _ P E R N S T E J N _ C A S T L E , _ C Z E C H _ R E P U B L I C . Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 1 j p g

  2. I m a g e s o ● Triplestores support RDF and SPARQL u r c e : h t t p s : / / c o m m o n s . w i k i m e d i a . o r g / w i k i / F i l e : C O V E R E D _ B R I D G E _ A T _ P E R N S T E J N _ C A S T L E , _ C Z E C H _ R E P U B L I C . Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 2 j p g

  3. I m a g e s o ● Support of so-called u r c e : h t t Property Graphs (PGs) p s : / / c o or Labeled PGs (LPGs) m m o n s . w i k i m e d i a . o r g / w i k i / F i l e : C O V E R E D _ B R I D G E _ A T _ P E R N S T E J N _ C A S T L E , _ C Z E C H _ R E P U B L I C . Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 3 j p g

  4. I m a g e s Coexistence! o u r c e : h t t p s : / / c o ● Too much has been invested for any m m o n s one of them to get abandoned now . w i k i m e d ● Both have merits and a user base i a . o r g / w i k i / F i l e : C O V E R E D _ B R I D G E _ A T _ P E R N S T E J N _ C A S T L E , _ C Z E C H _ R E P U B L I C . Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 4 j p g

  5. I m a g e s Interoperability o u r c e : h t t p s : / / c o m m o n s . w i k i m e d i a . o r g / w i k i / F i l e : C O V E R E D _ B R I D G E _ A T _ P E R N S T E J N _ C A S T L E , _ C Z E C H _ R E P U B L I C . Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 5 j p g

  6. https://www.publicdomainpictures.net/en/view-image.php?image=253435 and https://www.flickr.com/photos/ntsb/40210711664 We need well-defjned approaches! Image sources: Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 6

  7. Foundatjons to Query Labeled Property Graphs using SPARQL * Olaf Hartjg @olafiartjg

  8. Difgerences between LPGs and RDF Graphs Node and edge identifiers in an LPG are local to that LPG, ● whereas URIs are globally unique identifiers important for data integration – Edge labels cannot appear as nodes in an LPG, whereas ● in RDF we may have (s, p, o) and (p, p2, o2) important for making the semantics – of data explicit within the data itself No multivalued properties in an LPG, whereas ● in RDF we may have (s, p, literal1) and (s, p, literal2) unless we use collection objects – as values of properties in LPGs RDF graphs are not truly multigraphs, LPGs are (i.e., two ● edges between the same nodes may have the same label) No edge properties in RDF graphs! ● Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 8

  9. Difgerences between LPGs and RDF Graphs Node and edge identifiers in an LPG are local to that LPG, ● whereas URIs are globally unique identifiers important for data integration – Edge labels cannot appear as nodes in an LPG, whereas ● in RDF we may have (s, p, o) and (p, p2, o2) important for making the semantics – of data explicit within the data itself No multivalued properties in an LPG, whereas ● in RDF we may have (s, p, literal1) and (s, p, literal2) unless we use collection objects – as values of properties in LPGs RDF graphs are not truly multigraphs, LPGs are (i.e., two ● edges between the same nodes may have the same label) No edge properties in RDF graphs! ● Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 9

  10. Difgerences between LPGs and RDF Graphs Node and edge identifiers in an LPG are local to that LPG, ● whereas URIs are globally unique identifiers important for data integration – Edge labels cannot appear as nodes in an LPG, whereas ● in RDF we may have (s, p, o) and (p, p2, o2) important for making the semantics – of data explicit within the data itself No multivalued properties in an LPG, whereas ● in RDF we may have (s, p, literal1) and (s, p, literal2) unless we use collection objects – as values of properties in LPGs RDF graphs are not truly multigraphs, LPGs are (i.e., two ● edges between the same nodes may have the same label) No edge properties in RDF graphs! ● Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 10

  11. Difgerences between LPGs and RDF Graphs Node and edge identifiers in an LPG are local to that LPG, ● whereas URIs are globally unique identifiers important for data integration – Edge labels cannot appear as nodes in an LPG, whereas ● in RDF we may have (s, p, o) and (p, p2, o2) important for making the semantics – of data explicit within the data itself No multivalued properties in an LPG, whereas ● in RDF we may have (s, p, literal1) and (s, p, literal2) unless we use collection objects – as values of properties in LPGs RDF graphs are not truly multigraphs, LPGs are (i.e., two ● edges between the same nodes may have the same label) No edge properties in RDF graphs! ● Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 11

  12. Difgerences between LPGs and RDF Graphs Node and edge identifiers in an LPG are local to that LPG, ● whereas URIs are globally unique identifiers important for data integration – Edge labels cannot appear as nodes in an LPG, whereas ● in RDF we may have (s, p, o) and (p, p2, o2) important for making the semantics – of data explicit within the data itself No multivalued properties in an LPG, whereas ● in RDF we may have (s, p, literal1) and (s, p, literal2) unless we use collection objects – as values of properties in LPGs RDF graphs are not truly multigraphs, LPGs are (i.e., two ● edges between the same nodes may have the same label) No edge properties in RDF graphs! ● Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 12

  13. RDF * /SPARQL * Approach [1,2] Annotations of individual triples (i.e., like edge properties in LPGs) ● Idea: nest triples into one another; similarly for query patterns ● SELECT ?i ?c WHERE { << ex:kubrick ex:influencedBy ?i >> ex:certainty ?c } Already supported by two commercial triplestores ● Other vendors are working on it (incl. Amazon Web Services) ● Collaboration to bring this approach to standardization by W3C ● [1] Olaf Hartig and Bryan Thompson: “ Foundations of an Alternative Approach to Reification in RDF. ” CoRR abs/1406.3399, 2014. [2] Olaf Hartig: “ Foundations of RDF* and SPARQL* - An Alternative Approach to Statement-Level Metadata in RDF. ” In Proc. of AMW 2017. Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 13

  14. RDF * /SPARQL * Approach [1,2] Annotations of individual triples (i.e., like edge properties in LPGs) ● Idea: nest triples into one another; similarly for query patterns ● Tomorrow! 12:15, Session 2.4 in Hall 4 SELECT ?i ?c WHERE { Paper that adopts this idea for << ex:kubrick ex:influencedBy ?i >> ex:certainty ?c } RDF Stream Processing [2] Already supported by two commercial triplestores ● Other vendors are working on it (incl. Amazon Web Services) ● Collaboration to bring this approach to standardization by W3C ● [1] Olaf Hartig and Bryan Thompson: “ Foundations of an Alternative Approach to Reification in RDF. ” CoRR abs/1406.3399, 2014. [2] Olaf Hartig: “ Foundations of RDF* and SPARQL* - An Alternative Approach to Statement-Level Metadata in RDF. ” In Proc. of AMW 2017. [3] Robin Keskisärkkä, Eva Blomqvist, Leili Lind, and Olaf Hartig: “ RSP-QL*: Enabling Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 14 Statement-Level Annotations in RDF Streams. ” In Proc. of SEMANTiCS 2019.

  15. An Approach to Interoperability SPARQL SPARQL* RDF* RDF* View View (Labeled) RDF RDF* Property Graph Graph Graph [1] Olaf Hartig and Bryan Thompson: “ Foundations of an Alternative Approach to Reification in RDF. ” CoRR abs/1406.3399, 2014. [2] Olaf Hartig: “ Foundations of RDF* and SPARQL* - An Alternative Approach to Statement-Level Metadata in RDF. ” In Proc. of AMW 2017. [4] Olaf Hartig: “ Reconciliation of RDF* and Property Graphs. ” In abs/1409.3288, 2014 Foundatjons to Query Labeled Property Graphs using SPARQL* – Olaf Hartjg @olafiartjg 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend