Filters








4 Hits in 2.5 sec

A demonstration of TripleProv

Marcin Wylot, Philippe Cudré-Mauroux, Paul Groth
2015 Proceedings of the VLDB Endowment  
In this demonstration, we present TripleProv: a new system extending a native RDF store to efficiently handle the storage, tracking and querying of provenance in RDF data.  ...  In particular, the capacity to store, track, and query provenance data is becoming a pivotal feature of modern triple stores.  ...  Takeaways This demonstration highlights the importance of tracking the provenance of Web data.  ... 
doi:10.14778/2824032.2824119 fatcat:b7lsmcam4jepxbpsjlv6gja4rq

An Extended Native RDF for Provenance-Enabled Queries in Linked Data

2019 International Journal of Engineering and Advanced Technology  
In particular, we audit why, how, and where provenance, depict the connections among these ideas of provenance, and portray a portion of their applications in certainty calculation, see upkeep and update  ...  Specifically, ability to store, track, and inquiry provenance information is turning into crucial element present day triple stores.  ...  Figure 2 : 2 Query execution times (in seconds) for the Figure 3 :Figure 4 :Figure 5 : 345 Overhead of tracking provenance compared to vanilla version system for WDC dataset Query execution times (in  ... 
doi:10.35940/ijeat.f9228.109119 fatcat:ty75ztvvlng4bbji3hlruyvata

How and Why is An Answer (Still) Correct? Maintaining Provenance in Dynamic Knowledge Graphs [article]

Garima Gaur and Arnab Bhattacharya and Srikanta Bedathur
2020 arXiv   pre-print
Therefore, it is important to establish the provenance of results for a query to determine how these were computed.  ...  Addressing these issues, we present HUKA which uses provenance polynomials for tracking the derivation of query results over knowledge graphs by encoding the edges involved in generating the answer.  ...  In this paper, we use provenance polynomials [19] to track the provenance of answers of a graph pattern query over knowledge graphs stored in property-graph engines such as Neo4j.  ... 
arXiv:2007.14864v1 fatcat:gvx6wbnnivcflpzny6g32nryhu

DiploCloud: Efficient and Scalable Management of RDF Data in the Cloud

Marcin Wylot, Philippe Cudre-Mauroux
2016 IEEE Transactions on Knowledge and Data Engineering  
Contrary to previous approaches, DiploCloud runs a physiological analysis of both instance and schema information prior to partitioning the data.  ...  Sharding such data using classical techniques or partitioning the graph using traditional min-cut algorithms leads to very inefficient distributed operations and to a high number of joins.  ...  The system was also extended in TripleProv [4] , [5] to support storing, tracking, and querying provenance in RDF query processing.  ... 
doi:10.1109/tkde.2015.2499202 fatcat:mxxfq3jxwbbwllpbrjpmag3tau