Giter Club home page Giter Club logo

clerezza's Introduction

Building

Build using Apache Maven with

mvn install

FAQ

Some more advanced questions focused on showing the differences to other proposed APIs.

Can I add RdfTerms from one implementation to another?

Yes, any compliant implementation of BlankNode, Iri or Literal as well as Triple can be added to any implemenation of Graph, as long the Graph supports adding triples. Implementation may not require the nodes to be of a particular implementation of having been created with a specific factory.

How does it work?

Implementation might need to map instances of BlankNode to their internal implementation. This should be done in a way that when there is no more reference to the BlankNode object (i.e. when the object can be garbage collected) the mapping to the internal implementation is removed from memory to. This can be achieved by using a java.util.WeakHashMap

Do I get back the same object that I added?

For instances of Iri or Literals you get back an object that result equal to the originally added object, i.e. an object with the same HashCode and of which the equals method return true when compared with the originally added object. Ther is no guarantee that the same instance will be returned. For instances of BlankNode the above in only guaranteed as long as the original object is referenced. When the original object becomes eligible for garbage collection the implementation may start returning a different (an not equal) object. In practice this means BlankNode objects cannot safely be serialized (using Java serialization) or passed around via RMI.

Can an implementation remove redundant information from a Graph?

Yes, as long as this doesn't affect any BlankNode instance that is currently reachable (i.e. the Java object is in memory and is not eligible for garbage collection).

For example given the non-lean graph:

ex:a ex:p _:x .
_:y ex:p _:x .

As long as there is no BlankNode instance referencing _:y the implementation can reduce the graph to:

ex:a ex:p _:x .

removing the redundancy. If however there is a reachable BlankNode instance for _:y the implementation must not remove the redundancy as the code which has access to the object can go on adding a triple:

_:y ex:p2 ex:b .

Thus creating a graph that doesn't contain any internal redundancy, namely:

ex:a ex:p _:x .
_:y ex:p _:x .
_:y ex:p2 ex:b .

clerezza's People

Contributors

acoburn avatar bdelacretaz avatar danielshahaf avatar enridaga avatar florent-andre avatar kamaci avatar miador avatar misl avatar retog avatar tandhika avatar tteofili avatar westei avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.