<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Datablend &#187; graph</title>
	<atom:link href="https://datablend.be/?cat=36&#038;feed=rss2" rel="self" type="application/rss+xml" />
	<link>https://datablend.be</link>
	<description>Big Data Simplified</description>
	<lastBuildDate>Mon, 07 Sep 2015 09:04:17 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.6.1</generator>
		<item>
		<title>The power of Manchester City: a data analysis</title>
		<link>https://datablend.be/?p=491</link>
		<comments>https://datablend.be/?p=491#comments</comments>
		<pubDate>Sun, 17 Aug 2014 11:55:16 +0000</pubDate>
		<dc:creator>Davy Suvee</dc:creator>
				<category><![CDATA[graph]]></category>
		<category><![CDATA[infographics]]></category>
		<category><![CDATA[neo4j]]></category>
		<category><![CDATA[visualisation]]></category>

		<guid isPermaLink="false">http://datablend.be/?p=491</guid>
		<description><![CDATA[What makes Manchester City such a great team? The infographic below illustrates one of the teams most powerful characteristics: its successful passing capability. The visualisation is based upon the Opta dataset released in August 2011, containing the high detailed Bolton vs Manchester City match statistics. The data has been loaded in the neo4j graph databases<p><a href="https://datablend.be/?p=491">Continue Reading →</a></p>]]></description>
				<content:encoded><![CDATA[<p style="text-align: justify;">What makes Manchester City such a great team? The infographic below illustrates one of the teams most powerful characteristics: its successful passing capability. The visualisation is based upon the <a href="http://www.optasports.com" title="Opta" target="_blank">Opta</a> dataset released in August 2011, containing the high detailed Bolton vs Manchester City match statistics. The data has been loaded in the <a href="http://neo4j.org" title="neo4j" target="_blank">neo4j</a> graph databases and the <a href="http://docs.neo4j.org/chunked/stable/cypher-query-lang.html" title="Cypher Query Language" target="_blank">Cypher Query Language</a> has been used to extract the passing statistics.</p>
<p style="text-align: justify;">For each of the teams, we calculated the average position of their players on the pitch (based upon their individual actions). The thickness of the red edges visualises the number of successful passes amongst two individual players. Finally, we visualised the number of successful passes of each player (see shirt-number) and the distribution of the length of his passes. Have fun exploring this infographic!</p>
<p> </p>
<p><center><a href="http://datablend.be/wp-content/uploads/2014/08/VoetbalInfographic-2.jpg"><img src="http://datablend.be/wp-content/uploads/2014/08/VoetbalInfographic-2.jpg" alt="VoetbalInfographic-2" width="400" height="300" class="alignnone size-medium wp-image-498" /></a></center> </p>
<p></p>]]></content:encoded>
			<wfw:commentRss>https://datablend.be/?feed=rss2&#038;p=491</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Coalition-Cocktail &#8211; Hacking the Elections @ Engagor</title>
		<link>https://datablend.be/?p=440</link>
		<comments>https://datablend.be/?p=440#comments</comments>
		<pubDate>Tue, 27 May 2014 14:57:42 +0000</pubDate>
		<dc:creator>Davy Suvee</dc:creator>
				<category><![CDATA[circos]]></category>
		<category><![CDATA[engagor]]></category>
		<category><![CDATA[gephi]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[hackaton]]></category>
		<category><![CDATA[vk14]]></category>

		<guid isPermaLink="false">http://datablend.be/?p=440</guid>
		<description><![CDATA[Last weekend, Engagor organised their hacktheelections hackaton. The Datablend team (Quentin, Stijn and Davy) was joined by Marc Broos, Tim Coene and Josbert van de Zande with one goal in mind: trying to visualise the (pre-arranged?) political coalition and, if possible, also predict the formation-period. Technically, we extracted over 160K tweets through the Engagor API.<p><a href="https://datablend.be/?p=440">Continue Reading →</a></p>]]></description>
				<content:encoded><![CDATA[<p style="text-align: left;">Last weekend, <a title="Engagor" href="https://engagor.com" target="_blank">Engagor</a> organised their <a title="hacktheelections" href="http://www.hacktheelections.com" target="_blank">hacktheelections</a> hackaton. The Datablend team (Quentin, Stijn and Davy) was joined by Marc Broos, Tim Coene and Josbert van de Zande with one goal in mind: trying to visualise the (pre-arranged?) political coalition and, if possible, also predict the formation-period.</p>
<p style="text-align: left;">Technically, we extracted over 160K tweets through the Engagor API. Next, a &#8220;sentiment&#8221;-based political graph was build and stored in the <a href="http://www.neo4j.org" title="Neo4J" target="_blank">Neo4J</a> graph database. A <a href="http://www.gephi.org" title="Gephi" target="_blank">Gephi</a>-based visualisation, based upon community detection, revealed the &#8220;truth&#8221;, which was, to be honest, a bit disappointing and at the same time somewhat expected: the political parties from Wallionia form a solid community while the Flemish parties are interconnected through many clusters. A warning sign for the upcoming formation process?</p>
<p style="text-align: left;">The slidedeck below provides an overview of the single day of hacking. Our results ranked third (on 8 teams). Although being very informative, it&#8217;s quite hard to compete with a &#8220;pokemon&#8221;-themed fighting animation between politicians *wink*. Many thanks to <a title="Engagor" href="https://engagor.com" target="_blank">Engagor</a> for the spotless organisation!</p>
<p><center><iframe src="http://www.slideshare.net/slideshow/embed_code/35157124" width="600" height="489" frameborder="0" marginwidth="0" marginheight="0" scrolling="no"></iframe><br/><br/></center></p>
<p></p>]]></content:encoded>
			<wfw:commentRss>https://datablend.be/?feed=rss2&#038;p=440</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The power of graphs to analyse biological data</title>
		<link>https://datablend.be/?p=344</link>
		<comments>https://datablend.be/?p=344#comments</comments>
		<pubDate>Mon, 02 Dec 2013 07:04:34 +0000</pubDate>
		<dc:creator>Davy Suvee</dc:creator>
				<category><![CDATA[gephi]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[graphconnect]]></category>
		<category><![CDATA[mongodb]]></category>
		<category><![CDATA[neo4j]]></category>
		<category><![CDATA[NoSQL]]></category>
		<category><![CDATA[visualisation]]></category>

		<guid isPermaLink="false">http://datablend.be/?p=344</guid>
		<description><![CDATA[Watch Davy Suvee present at GraphConnect London 2013 on the power of graph databases to analyse biological datasets. The Power of Graphs to Analyze Biological Data &#8211; Davy Suvee @ GraphConnect London 2013 from Neo Technology on Vimeo.]]></description>
				<content:encoded><![CDATA[<p>Watch Davy Suvee present at <a href="http://www.graphconnect.com/london/" title="GraphConnect London 2013">GraphConnect London 2013</a> on the power of graph databases to analyse biological datasets.</p>
<p><iframe src="//player.vimeo.com/video/80463932" width="500" height="281" frameborder="0" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>
<p><a href="http://vimeo.com/80463932">The Power of Graphs to Analyze Biological Data &#8211; Davy Suvee @ GraphConnect London 2013</a> from <a href="http://vimeo.com/neo4j">Neo Technology</a> on <a href="https://vimeo.com">Vimeo</a>.</p>
<p></p>]]></content:encoded>
			<wfw:commentRss>https://datablend.be/?feed=rss2&#038;p=344</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Yelp graph: checkin-based business clustering</title>
		<link>https://datablend.be/?p=308</link>
		<comments>https://datablend.be/?p=308#comments</comments>
		<pubDate>Sun, 01 Dec 2013 11:51:58 +0000</pubDate>
		<dc:creator>Davy Suvee</dc:creator>
				<category><![CDATA[gephi]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[neo4j]]></category>
		<category><![CDATA[visualisation]]></category>
		<category><![CDATA[yelp]]></category>

		<guid isPermaLink="false">http://datablend.be/?p=308</guid>
		<description><![CDATA[Recently, Yelp made available a sample dataset from the greater Phoenix metropolitan area including around 11.000 business, 8000 checkin-sets, 43.000 users and 230.000 user reviews. With the help of this data, data scientists can execute real-life experiments with various data mining/machine learning algorithms. In our case, we are interested in finding out whether it is possible<p><a href="https://datablend.be/?p=308">Continue Reading →</a></p>]]></description>
				<content:encoded><![CDATA[<p style="text-align: justify;">Recently, <a title="yelp" href="http://yelp.com" target="_blank">Yelp</a> made available <a title="a sample dataset" href="http://www.yelp.co.uk/dataset_challenge" target="_blank">a sample dataset</a> from the greater Phoenix metropolitan area including around 11.000 business, 8000 checkin-sets, 43.000 users and 230.000 user reviews. With the help of this data, data scientists can execute real-life experiments with various data mining/machine learning algorithms. In our case, we are interested in finding out whether it is possible to visually cluster businesses by category, based purely on their checkin data. The checkin data itself is available on a day-hour level: for each business, it is possible to retrieve the number of checkins on a Sunday afternoon between 3 and 4. So, with only this data in mind, are we able to cluster businesses as being restaurants or fashion stores, based purely on the correlations calculated amongst their checkin data? For this experiment, we use the <a title="Neo4J" href="http://neo4j.org" target="_blank">Neo4J</a> graph database for storing our checkin-based correlation graph and employ the <a title="Gephi" href="http://gephi.org" target="_blank">Gephi</a> graph visualisation platform for interpreting the identified business communities/clusters. As always, the <a title="full source code" href="https://github.com/datablend/yelp-graph" target="_blank">full source code</a> of this article can be found on the Datablend public github repository (although you will need to acquire the dataset yourself through the <a title="Yelp Dataset Challenge" href="http://www.yelp.co.uk/dataset_challenge" target="_blank">Yelp Dataset Challenge</a> portal).</p>
<h3>1. Building the Neo4J checkin correlation graph</h3>
<p style="text-align: justify;">We start by parsing both the business and checkin json-files from the Yelp Dataset challenge. Unfortunately, checkin data is available for only 8,282 out of the 11,537 supplied businesses. In addition, many of these have only a limited set of associated checkins. Hence, in order to make sure that only relevant correlations are calculated, we ignore the ones that have less than a 100 checkins, resulting in around 1920 remaining businesses.</p>
<p style="text-align: justify;">Next, we try to identify the correlation between two businesses by using the Pearson Correlation Coefficient (read <a title="this site" href="https://statistics.laerd.com/statistical-guides/pearson-correlation-coefficient-statistical-guide.php" target="_blank">this site</a> for a nice introduction). Simply put, we try to identify whether a linear association exists between the checkins of two individual businesses. In our case, the calculation is based upon 168 data points (24 hours x 7 days), the idea being that two breakfast restaurants will get most of their checkins from the morning till noon, while two bars will get most of their checkins during the evening and at night. Hence, we expect the correlation between two businesses of the same type to be quite high, while different types of businesses (i.e. a breakfast restaurant and a bar) will  result in little or no correlation.</p>
<p style="text-align: justify;">Time to get our hands dirty. After parsing the data files, we use the existing apache.commons.math to calculate the pairwise correlation between the checkin datasets of the 1920 businesses. If the resulting coefficient is 0.8 or higher, we consider both businesses to be correlated. We create a unique node for each business within the Neo4J graph and combine them via a &#8220;correlated&#8221;-relationship.</p>
<script src="https://gist.github.com/7704584.js"></script>
<p style="text-align: justify;">The generated graph contains 606 unique nodes (i.e. businesses that are correlated to at least one other business) and 2585 edges (i.e. actual correlations).</p>
<h3>2. Gephi interpretation</h3>
<p style="text-align: justify;">Our next task is to observe whether groups of businesses exists that are highly correlated (i.e. highly interconnected) and identify whether these correlations makes sense. In order to do so, we import our Neo4J correlation graph in Gephi through the <a title="Gephi Neo4J plugin" href="https://marketplace.gephi.org/plugin/neo4j-graph-database-support/" target="_blank">Gephi Neo4J plugin</a>. Once loaded, we run the <a title="modularity" href="http://wiki.gephi.org/index.php/Modularity" target="_blank">modularity</a>-function to identify meaningful communities. These computed communities are then used to partition (i.e. color) the nodes (and their related edges) so that clusters can easily be observed. Next, we apply K-core filtering, in our case 3-core, to keep the subgraph from which all nodes have a degree of at least 3 (i.e. 3 relationships with other nodes). The size of the nodes (and their associated labels) is configured to be proportional with their degree. Finally, we apply <a title="Fruchterman-Reingold" href="http://wiki.gephi.org/index.php/Fruchterman-Reingold" target="_blank">Fruchterman-Reingold</a> lay-outing in order to clearly visualise the various clusters.</p>
<p style="text-align: justify;"><a href="http://datablend.be/wp-content/uploads/2013/12/yelp-graph.jpg" target="_blank"><img class="alignnone size-medium wp-image-334" alt="yelp-graph" src="http://datablend.be/wp-content/uploads/2013/12/yelp-graph.jpg"/></a></p>
<p style="text-align: justify;">We can easily observe 8 communities, but are these clusters meaningful? The pink cluster on the right-end side is highly interconnected (i.e. all nodes of the cluster have mutual correlations). Most of them can be identified as being breakfast diners (ex. <a href="http://www.yelp.co.uk/search?find_desc=the+good+egg&#038;find_loc=Phoenix%2C+AZ%2C+USA" title="The Good Egg">The good egg</a>, <a href="http://www.yelp.co.uk/biz/the-breakfast-joynt-scottsdale-2" title="The breakfast joynt">The breakfast joynt</a> and <a href="http://www.yelp.co.uk/biz/orange-table-scottsdale" title="Orange table">Orange table</a>). Cool. This certainly make sense, as most of these business have checkins early morning until early afternoon. The yellow cluster on the top contains various department stores (including <a href="http://www.yelp.co.uk/biz/costco-phoenix-4" title="Costco">Costco</a>, <a href="http://www.yelp.co.uk/biz/nordstrom-rack-phoenix-2#query:nordstroms%20rack" title="Nordstrom Rack" target="_blank">Nordstrom Rack</a> and <a href="http://www.yelp.co.uk/biz/ikea-tempe" title="IKEA" target="_blank">IKEA</a>). Again meaningful, as most of them open their doors somewhere around 10AM and close around 7PM. At first sight, it seems strange that the coffee places are correlated into two separate groups (yellow cluster at the bottom and pink cluster on the top). The reason however is simple: some of them close late afternoon while others are open until midnight.</p>
<h3>3. Conclusion</h3>
<p style="text-align: justify;">The Neo4J/Gephi solution works remarkably well to visually identify the various business clusters from the Yelp dataset. In a next blog article, we will show how to use the <a href="http://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm" title="k-nearest neighbours algorithm">k-nearest neighbours algorithm</a> to automatically predict the type of business based upon solely the checkin information.</p>
<p></p>]]></content:encoded>
			<wfw:commentRss>https://datablend.be/?feed=rss2&#038;p=308</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>8 things I like about Datomic</title>
		<link>https://datablend.be/?p=273</link>
		<comments>https://datablend.be/?p=273#comments</comments>
		<pubDate>Wed, 29 Aug 2012 09:56:11 +0000</pubDate>
		<dc:creator>Davy Suvee</dc:creator>
				<category><![CDATA[BigData.be]]></category>
		<category><![CDATA[datomic]]></category>
		<category><![CDATA[fluxgraph]]></category>
		<category><![CDATA[graph]]></category>

		<guid isPermaLink="false">http://datablend22.lin3.nucleus.be/?p=273</guid>
		<description><![CDATA[Yesterday evening, the 9th BigData.be MeetUp was organised at the offices of NGDATA in Ghent. With 45 people showing up, this was our best attended MeetUp till know, illustrating the growing popularity of Big Data in Belgium. The meeting had a line-up of three presentations: Kenny Helsens, who presented a wrap-up of the zimmo.be project<p><a href="https://datablend.be/?p=273">Continue Reading →</a></p>]]></description>
				<content:encoded><![CDATA[<p style="text-align: justify;">Yesterday evening, the <a href="http://www.meetup.com/bigdatabe/events/63141522" target='_blank'>9th BigData.be MeetUp</a> was organised at the offices of <a href="http://www.ngdata.com" target='_blank'>NGDATA</a> in Ghent. With 45 people showing up, this was our best attended MeetUp till know, illustrating the growing popularity of Big Data in Belgium.  The meeting had a line-up of three presentations:</p>
<ol>
<li>Kenny Helsens, who presented a wrap-up of the zimmo.be project</li>
<li>Gabriel Reid, who gave an introduction to <a href="http://incubator.apache.org/projects/crunch.html" target='_blank'>Apache Crunch</a>, of which is is a committer</li>
<li>Myself, giving a presentation on <a href="http://www.datomic.com" target='_blank'>Datomic</a> and <a href="http://github.com/datablend/blueprints" target='_blank'>FluxGraph</a></li>
</ol>
<p style="text-align: justify;">
<p style="text-align: justify;">The presentation highlights various aspects that, to my opinion, set Datomic apart from other types of noSQL databases. At the end of the presentation, I introduced <a href="http://github.com/datablend/blueprints" target='_blank'>FluxGraph</a>, a distributed, temporal graph database implemented on top of Datomic. FluxGraph implements the <a href="http://github.com/tinkerpop/blueprints" target='_blank'>Tinkerpop Blueprints API</a> and allows users to perform queries against a specific version of the graph in the past.  </p>
<p>Already looking forward to the next BigData.be MeetUp!<br />
<br />
<center><iframe src="http://www.slideshare.net/slideshow/embed_code/14102514" width="600" height="489" frameborder="0" marginwidth="0" marginheight="0" scrolling="no"></iframe><br/><br/></center></p>
<p></p>]]></content:encoded>
			<wfw:commentRss>https://datablend.be/?feed=rss2&#038;p=273</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Graphs, Graphs, Graphs, &#8230;</title>
		<link>https://datablend.be/?p=271</link>
		<comments>https://datablend.be/?p=271#comments</comments>
		<pubDate>Tue, 24 Jul 2012 09:54:22 +0000</pubDate>
		<dc:creator>Davy Suvee</dc:creator>
				<category><![CDATA[blueprints]]></category>
		<category><![CDATA[datomic]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[mongodb]]></category>
		<category><![CDATA[tinkerpop]]></category>

		<guid isPermaLink="false">http://datablend22.lin3.nucleus.be/?p=271</guid>
		<description><![CDATA[Last week, Datablend open-sourced two new Tinkerpop Blueprints implementations: blueprints-mongodb-graph and blueprints-datomic-graph. Tinkerpop is an open source project that provides an entire stack of technologies within the Graph Database space. At the core of this stack is the Blueprints framework. Blueprints can be considered as the JDBC of Graph Databases. By providing a collection of<p><a href="https://datablend.be/?p=271">Continue Reading →</a></p>]]></description>
				<content:encoded><![CDATA[<p style="text-align: justify;">Last week, Datablend open-sourced two new <a href="http://www.tinkerpop.com/" target="_blank">Tinkerpop</a> <a href="https://github.com/tinkerpop/blueprints/wiki" target="_blank">Blueprints</a> implementations: <a href="https://github.com/datablend/blueprints-mongodb" target="_blank">blueprints-mongodb-graph</a> and <a href="https://github.com/datablend/blueprints" target="_blank">blueprints-datomic-graph</a>. Tinkerpop is an open source project that provides an entire stack of technologies within the Graph Database space. At the core of this stack is the Blueprints framework. Blueprints can be considered as the <span class="highlight">JDBC</span> of Graph Databases. By providing a collection of generic interfaces, it allows to develop graph-based applications without introducing explicit dependencies on concrete Graph Database implementations. Additionally, Blueprints provides concrete bindings for the <a href="http://neo4j.org" target="_blank">Neo4J</a>, <a href=" http://www.orientechnologies.com" target="_blank">OrientDB</a> and <a href=" http://www.sparsity-technologies.com/dex" target="_blank">Dex</a> Graph Databases. On top of Blueprints, the Tinkerpop team developed an entire range of graph technologies, including <a href="https://github.com/tinkerpop/gremlin/wiki" target="_blank">Gremlin</a>, a powerful, domain-specific language designed for traversing graphs. Hence, once a Blueprints binding is available for a particular Graph Database, an entire range of technologies can be leveraged.</p>
<p>&nbsp;</p>
<h3>1. mongoDB Graph</h3>
<p style="text-align: justify;">The <a href="http://www.mongodb.org/" target="_blank">mongoDB</a> Blueprints implementation provides users with a <span class="highlight"><em>scalable</span>, <span class="highlight">distributed</em></span> Graph Database implementation.  mongoDB graph does not require any information on the underlying physical mongoDB setup, so read/write scalability can easily be achieved through mongoDB&#8217;s natively supported <span class="highlight"><em>replication</em></span> and <span class="highlight"><em>sharding</em></span> functionalities. Some initial benchmarks (writing/reading 100.000 vertices where each 2 vertices are connected through an edge) on a single mongoDB node shows the following performance:</p>
<script src="https://gist.github.com/3169096.js"></script>
<p style="text-align: justify;">Not too shabby for running it on a single mongoDB instance. Currently, each write is executed as a singular commit to the mongoDB store. Although this process could be improved by performing writes through optimized <span class="highlight"><em>batches</em></span>,  we need to ensure that the transactional semantics of the Blueprints stack are still respected. Further performance optimizations will be released soon, so keep an eye on the <a href="https://github.com/datablend/blueprints-mongodb" target="_blank">blueprints-mongodb-graph </a>github project.</p>
<p>&nbsp;</p>
<h3>2. Datomic Graph</h3>
<p style="text-align: justify;"><a href="http://datomic.com" target='_blank'>Datomic</a> is a novel distributed database system designed to enable scalable, flexible and intelligent applications, running on next-generation cloud architectures. Datomic employs a powerful data model (based upon the concept of <span class="highlight"><em>Datoms</em></span>) and an expressive query language (based upon the concept of <span class="highlight"><em>Datalog</em></span>. Additionally, it introduces an explicit notion of <span class="highlight"><em>time</em></span>, which allows for the execution of queries against both the <span class="highlight"><em>previous</em></span> and <span class="highlight"><em>future states</em></span> of the database. The RDF and SPARQL feel of the Datomic data model and query approach makes it an ideal target for implementing a property graph. Hence, the <a href="https://github.com/datablend/blueprints" target="_blank">blueprints-datomic-graph</a> Blueprints implementation.</p>
<p style="text-align: justify;">Clever use the time-aware nature of the Datomic datastore, makes Datomic Graph the very first <span class="highlight"><em>distributed</em></span>, <span class="highlight"><em>temporal graph database</em></span>: users can perform queries against a specific version of the graph in the past. The code sample below illustrates how a time-aware social graph can be created, stored and queried through the Datomic Graph implementation.</p>
<script src="https://gist.github.com/3169442.js"></script>
<p>&nbsp;</p>
<p style="text-align: justify;">As one would expect, this outputs the following information:</p>
<script src="https://gist.github.com/3169500.js"></script>
<p>&nbsp;</p>
<p style="text-align: justify;">Datomic Graph does not only support versioning of the vertices and edges, but also on the properties of individual vertices/edges. Pretty slick, not? We are currently enhancing the implementation with additional time-based operations, including the <span class="highlight"><em>easy comparison of subgraphs</em></span> over time. So stay tuned!</p>
<p></p>]]></content:encoded>
			<wfw:commentRss>https://datablend.be/?feed=rss2&#038;p=271</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
