Database Reference
In-Depth Information
the SPARQL RDF query language that not only allow information discovery but
also assist with data validation. A large part of this chapter has been devoted to the
important question of how to identify correspondences and relationships between
datasets and how to craft appropriate linksets representing dataset integration
through explicit triples whose subjects lie in one dataset and objects in another. Since
a link may be semantically valid only in a certain context, we have also highlighted
the need to be able to describe such contexts through mechanisms such as Named
Graphs or Named Triples. Link maintenance and update protocols and processes
are a technology in its infancy, but we highlighted some of the options available at
the time of writing. Finally, we have addressed the issue of Linked Data quality and
the pitfalls of semantic spam. As has become apparent in this chapter, Linked Data
is a very young area, and as the volume of data published on the Linked Data Web
grows, more techniques are being developed to tackle the problems that only emerge
at scale and over time.
The nature of the development of Linked Data has necessarily meant that the
development of methods and tools for using and linking Linked Data is less mature
than those that aid the creation, databasing, and querying of Linked Data. As a result,
whereas triple stores and SPARQL query engines are maturing and are now well sup-
ported, there is still a distinct lack of robust commercial-grade tool support for some
of the newer areas. As the demands of industry grow, we can expect more products
to come on the market that address the needs of the burgeoning Linked Data Web.
NOTES
5. A draft standard for SPARQL 1.1 Update (Gearon, Passant, and Polleres, 2012) that has
not yet been finalized allows for additional forms, including INSERT, DELETE, CREATE,
and DROP, which allow RDF graphs to be altered in various ways. It is beyond the scope
of this chapter to discuss further, but the interested reader can access the most up-to-date
version of the forthcoming standard at
http://www.w3.org/TR/sparql11-update/
.
