- From: Iovka Boneva <iovka.boneva@univ-lille1.fr>
- Date: Tue, 24 Mar 2015 16:54:19 +0100
- To: "Peter F. Patel-Schneider" <pfpschneider@gmail.com>
- CC: RDF Data Shapes Working Group <public-data-shapes-wg@w3.org>
You can find here a archive containing - an executable jar file containing a command line utility for testing our algorithm for validation of RDF graphs against deterministic single occurrence ShEx schema: Algorithm 1 in our ICDT 2015 paper - 3 example files for running the program - all the required libraries (mainly jena) These are provided as is, with a very minimal user interface. If you have questions, please contact me by mail. The file is available for download until April 24. Please contact me if you want to have it after that date. https://filesender.renater.fr/?vid=2f1e6710-8ce8-9ce8-8b29-0000114bb87b Iovka Le 20/03/2015 20:08, Peter F. Patel-Schneider a écrit : > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Yes, please send me a copy of the system. > > Thanks, > > peter > > > On 03/20/2015 11:55 AM, Iovka Boneva wrote: >> I sent my previous mail by error before finishing it... so didn't have >> the occasion to say that unfortunately these implementations are not >> accessible for testing. As I said they were made for our own needs as >> proof of concept, and do not have friendly user interface. I am however >> willing to send the API in a jar file, together with example code on how >> to use it, if somebody wants to play with that. Unfortunately next week >> I won't have time to do more (and anyway my technical skills are >> insufficient for publishing it for testing on the web, while spending a >> reasonable amount of time on that). >> >> My main point was that there are indeed working implementations with >> recursion. >> >> Now to answer Peter's questions: - the first algorithm is indeed for >> subclass of ShEx, which merely corresponds to the first version of ShEx >> (no repetition of symbols). It is however not so limiting, as it allows >> to handle a lot of the identified use cases, and can be easily extended >> for handling more cases, as I already explained in a previous mail; - >> the second one is for full ShEx, (therefore its worse case complexity >> is not linear, and right now I cannot give figures on its actual >> performance in practice). >> >> Iovka >> >> >> >> >> Le 20/03/2015 17:05, Peter F. Patel-Schneider a écrit : On 03/20/2015 >> 08:42 AM, Iovka Boneva wrote: >>>>> We do have 3 implementations of recursive shapes with bag >>>>> semantics, for 2 different algorithms - one for validating against >>>>> deterministic schemas w/o repetitions, with a set of pre-typed root >>>>> nodes. It is written in Java using jena, and works both with >>>>> in-memory RDF-graphs, and using the Jena RDF-database API. Written >>>>> by myself; >> So this implementation is only for part of Shape Expressions? >> >>>>> - one for the same algorithm written in Python also using RDF API, >>>>> written by Slawek Staworko and Samuel Hym; >> And this implementation is also only for part of Shape Expressions? >> >>>>> - one for validation of a whole graph w/o pre-typed root nodes, >>>>> using our greatest fixed point algorithm. Also written in Python by >>>>> Slawek and Samuel. >> Does this implementation handle all of Shape Expressions? Is there an >> on-line demo? How can I get a copy of the system? >> >>>>> Our implementations were written for "proof of concept" prior to >>>>> our publication. We also have an algorithms for generating large >>>>> graphs on which we tested our implementations, and they indeed ran >>>>> in linear time in the size of the graph, as they were supposed to >>>>> from theoretical point of view. >>>>> >>>>> Iovka >> peter >> >> > -----BEGIN PGP SIGNATURE----- > Version: GnuPG v1 > > iQEcBAEBAgAGBQJVDHBJAAoJECjN6+QThfjzKz0IAIxkBAouYZJUIBBuH/kxXo0N > zQ/crOvBQZ+OhdCMe2Ua0HoZtFPMVlBAy8WCXcoRIRE81jAJ58hW/aBmugoeO9fp > 5sOr5QlRTrWWBwRIwgi5+gICanMWfuHHlgQuQKcCDX6PnyURgGddLNq6L1OGEeUy > RH8HUKr5PvTBtJoBzUTyurUskbnNI2IMtOUvqzT8GQhbriFZ8rj6EQiv3yc2R7lP > lXd2JujO9BYuO60m3cTvu8HLEOCs01XSM+jjUdxCQonmpBc2KUpiruCBah0myvhJ > 3JeBfWoxoj25NkUcEc3NU+ieVoytZUWcK4TPm6BQ23eVewkVp2dDks3cKMYspwY= > =Cx/p > -----END PGP SIGNATURE----- -- Iovka Boneva Associate professor (MdC) Université de Lille http://www.cristal.univ-lille.fr/~boneva/ +33 6 95 75 70 25 Please note that I read my mails twice a day at 9:00 and 13:00 (CET) For urgent matters, please contact me by phone
Received on Tuesday, 24 March 2015 15:54:56 UTC