Superfast Pathfinding in DBpedia

Superfast Pathfinding in DBpedia

Everything is Connected is able to find a path between a Facebook user and any concept known on DBpedia, such as, persons, locations, things, etc. The found path is presented to the end-user as a short story, which explains the relation between the searched concept and the end-user.

Graph algorithms make optimal use of available computation resources to and paths in structured data. Linked Data allows web services to make these approaches generic. However, scalability has always been a major issue in this context. To overcome this issue the Pathfinding Service makes use of an approach by pre-processing datasets and indexing them. It can find paths between Linked Data resources in DBpedia in most cases within a couple of seconds (in future releases other large datasets will be supported as well).

Advertisements

About laurensdv
Computer Science Student, interested in creating more innovating user experiences for information access. Fond of travelling around Europe!

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: