Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Linked Connections presentation for Ally

Linked Connections presentation for Ally

Linked Connections tries to solve the many data publishers problem within the public transit data world by using open data/linked data/REST techniques

Pieter Colpaert

March 10, 2016
Tweet

More Decks by Pieter Colpaert

Other Decks in Technology

Transcript

  1. [email protected] http://linkedconnections.org So I moved on... I’m now a PhD

    candidate at Ghent University - iMinds Subject: Publishing transport data in a queryable way on the Web → and this is the awesome branding (any designers here? Yes, this is a cry for help)
  2. [email protected] http://linkedconnections.org How should we publish public transport data on

    the Web? Trying to maximise the reuse, informing as many people as possible
  3. [email protected] http://linkedconnections.org 2 options? GTFS data dump Route planning on

    agency’s server User agent can download a data dump, or ask a question to the agency’s server
  4. [email protected] http://linkedconnections.org User agent When I use this word: it

    can both be a machine or an end-user app GET-ting things on the Web And when I say Web, I mean HTTP
  5. [email protected] http://linkedconnections.org GTFS problems Interoperability nightmare (Do I need to

    explain this to you?) User agents need to import your data over and over again
  6. [email protected] http://linkedconnections.org Problem There’s a long tail of user needs

    (and they should not be addressed by just one app) Amount of people User profile: bus subscription, foldable bike owner, impaired...
  7. [email protected] http://linkedconnections.org Let’s take a look at the data a

    connection departureTime + departureStop arrivalTime + arrivalStop another connection departureTime + departureStop arrivalTime + arrivalStop © open street map -
  8. [email protected] http://linkedconnections.org time * The Basic Connection Scan Algorithm (CSA)

    And this is the algorithm* ~ creating a minimum spanning tree through a sorted directed acyclic graph
  9. [email protected] http://linkedconnections.org Page X Page ... Page 2 Page 1

    time nextPage nextPage Let’s split our data dump into fragments
  10. [email protected] http://linkedconnections.org Why? You cannot put the entire Web on

    one page, so you fragment your datasets and create links between them Different user agents download the same pages for solving different questions → Great for caching!
  11. [email protected] http://linkedconnections.org Page X Page ... Page 2 Page 1

    time nextPage nextPage When published in pages on the Web, route planning will need X requests instead of 1
  12. [email protected] http://linkedconnections.org Current status Academic open-source javascript library: https://github.com/linkedconnections Next

    steps → Demo that supports intermodal queries → How to publish stops, transfers, accessibility & trips If you’re interested in collaborating
  13. [email protected] http://linkedconnections.org Current status Datasets published: • Dutch railways: http://iffns.linkedconnections.org/

    • 1 month of Belgian rail: http://belgianrail.linkedconnections.org/connections/?departureTime=2015-10-03T15%3A20 Next steps All GTFS data converted to Linked Connections online? (WIP) If you’re interested in collaborating
  14. [email protected] http://linkedconnections.org We should stop thinking we can ask the

    Web only 1 question to get to the answer Thank you @pietercolpaert ← me @linkedcons ← the project