Open Decision Making (Open Besluitvorming in Dutch) lets you search through what has been discussed in Dutch governments. In collaboration with local governments, the VNG and the Open State Foundation, we’ve built software that standardizes and aggregates the meeting data of more than 120 governments. All this open information makes it easier for journalists, policymakers and well-informed citizens to get involved in. With the principles of linked data we ensured that the data is open, uniform and reusable for anyone that likes to build upon it.
In 2014 we started our e-democracy platform Argu.co, which aims to engage citizens in decision-making processes. We worked with many governments and hosted online discussions where people shared ideas, opinions and voted on issues. Although we’ve seen that e-democracy and civic participation can be very successful, one key element is often missing: the actual decision-making process. This has to do with the fact that e-democracy discussions tend to happen parallel to the actual governmental meetings. We wanted to bring these two worlds together. To achieve that goal, we decided to work on gathering and standardizing the data that these decision-makers create: meetings, votes, agenda-items and many other documents.
In 2016 we started working with the Open State Foundation, who initiated Open Raadsinformatie (Open Municipality Data). VNG (the Dutch Municipality Union) provided funding, we joined forces, got involved with the technology, and helped to scale the project up from 7 to over 120 municipalities and 6 provinces.
Dutch municipalities produce a lot of information in their meetings. They use meeting software to organize and distribute their agenda items, documents, motions, and reports online. However, all these applications tend to work quite differently, all with their own information schemes. Also, many of the proceedings and documents are saved in PDF format and are often not publicly accessible to download. With our access to these systems and a lot of time to understand and implement the various APIs, we were able to bring everything together and create a standardized, searchable base of information that is always publicly accessible.
Most of the interesting information hides in PDF files. We wrote ETL (extract, load, transform) software using Python, Celery and Elasticsearch that gets all the source files, standardizes it to a single model and loads the text into various query systems. We store and cache all these files in Google Cloud Storage, along with the referencing sources and metadata. This enables us to serve files that are not accessible through the default API of the meeting software sources. This also makes it possible to see what has changed between versions.
Additionally, two organizations contributed two enrichers that add derived information to the resources:
Theme classifier: a machine-learning classifier written by the Open State Foundation. Scores document relevance to a set of specified themes, such as Economy, Safety and Education.
Location classifier: based on the project LocLinkVis made by Alex Olieman and the University of Amsterdam. It finds streets and locations in document texts and translates it into geographical coordinates of city neighborhoods and districts.
These enrichers allow all users of Open Decision Making to filter documents by theme tags and use geographical information to pinpoint which locations are mentioned.
We love linked data, and its merits are exceptionally valuable in a project such as this one. Linked data is highly re-usable in other applications without needing duplication, and the diverse serialization formats of RDF will provide something for any use-case.
However, working with linked data poses new challenges, such as choosing the right data store for the statements. You might think that an existing triple store is the most logical option since we’re working with RDF, but you don’t need triple stores to do serve linked data. Triple stores make a lot of sense when you have schema-less RDF data and require SPARQL as a query language. We didn’t need those, as our schema was constrained by our internal models, and SPARQL didn’t suit our query requirements. The primary goal was providing full-text search and RESTful RDF resources.
Before we joined the project, Elasticsearch was used as the only data store. It ticked the text search box, as Elasticsearch has a powerful text search query-language, but it is not designed for relational database queries. Also, it’s not a database as it’s not ACID compliant (i.e., highly resistant to corruption or data loss).
So, looking for a suitable store, we started with ArangoDB, which is a NoSQL document-based graph store. It seemed appropriate at the time because we were working with lots of documents, all connected in a graph. However, we found that the graph queries were taking too long to be suitable for this project.
Next we tried Neo4j, which is the market leader in Graph databases. It offers a powerful query language called Cypher, but we found that memory use was growing too early too fast. Another problem related to storing RDF in Neo4j - it should be possible, but there are some differences between the graph models of RDF and Neo4j. We had some trouble with using URLs as keys (a requirement for RDF), which had to be escaped, making the queries long and dreadful. Also, you have to think about how to cope with external resources. Whereas in an RDF store one can add a triple referencing an external resource, in Neo4j one should create a node to mimic the same behavior.
In the end, we abandoned graph databases altogether for this project and stuck with Postgres. We didn’t need graph-like queries or schemaless storage of triples. I am not saying that those graph databases are not good enough, merely not suitable for our purpose and budget.
Since the project depends heavily on fast text search queries, we found that Elasticsearch is still essential. So we kept it on for full-text searching. But since its Query DSL is changing quite a lot over time, it is not suitable as a stable API. We had to come up with an answer to this and created the ORI API service which can be found here. The idea here was that every resource should have its own resolvable identifier that would stay the same.
Several applications now actively use the freely available data from Open Decision Making:
We have built the primary open-source search application (Dutch) for users to discover and explore what is being said in their local government. The beauty of open data is that everyone can build their own applications based on the same API.
VNG is the Dutch umbrella organization for all municipalities and has been the driving force in this project. They’ve asked us to create a widget to see what words are trending for all municipalities in each month.
WaarOverheid shows all documents that mention a location in your neighborhood and district. It provides a map interface to navigate from neighborhood to neighborhood to find documents in streets located there.
1848 gathers political information from different sources to search and receive alerts to be able to stay on top of things.
It all started with municipality data, but the scope has now broadened to provincial data and will soon include data from the national level as well. We are working with the Dutch parliament on integrating their brand new API.
We believe that this is just a preview of what is possible with open government data. If we can convince governments to adopt a more data-focused information publishing strategy (using machine-readable formats, such as RDF, instead of PDF), we can create even more engaging web applications: imagine clicking on a representative to see which motions they submitted, or compare voting behavior between political parties.
Working on this project has been challenging, we’ve overcome quite some hurdles that come with managing such amounts of data and systems. Along the way, we have learned a great deal about ETL processes, Elasticsearch, Kafka and Kubernetes, to name a few.
Contact us to know how we can help you achieving your goals in modeling and transforming information to linked data.