Luo, Y.; Picalausa, F.; Fletcher, G.H.L.; Hidders, J.; Vansummeren, S.: Storing and indexing massive RDF datasets (2012)
0.01
0.005348703 = product of:
0.016046109 = sum of:
0.016046109 = product of:
0.032092217 = sum of:
0.032092217 = weight(_text_:management in 414) [ClassicSimilarity], result of:
0.032092217 = score(doc=414,freq=2.0), product of:
0.17235184 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051133685 = queryNorm
0.18620178 = fieldWeight in 414, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0390625 = fieldNorm(doc=414)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- The resource description framework (RDF for short) provides a flexible method for modeling information on the Web [34,40]. All data items in RDF are uniformly represented as triples of the form (subject, predicate, object), sometimes also referred to as (subject, property, value) triples. As a running example for this chapter, a small fragment of an RDF dataset concerning music and music fans is given in Fig. 2.1. Spurred by efforts like the Linking Open Data project, increasingly large volumes of data are being published in RDF. Notable contributors in this respect include areas as diverse as the government, the life sciences, Web 2.0 communities, and so on. To give an idea of the volumes of RDF data concerned, as of September 2012, there are 31,634,213,770 triples in total published by data sources participating in the Linking Open Data project. Many individual data sources (like, e.g., PubMed, DBpedia, MusicBrainz) contain hundreds of millions of triples (797, 672, and 179 millions, respectively). These large volumes of RDF data motivate the need for scalable native RDF data management solutions capabable of efficiently storing, indexing, and querying RDF data. In this chapter, we present a general and up-to-date survey of the current state of the art in RDF storage and indexing.
