Introducing our public SPARQL query service

The dblp Knowledge Graph (dblp KG) is a fully semantic view on all the data and relationships that you can find in the dblp computer science bibliography. In the recent years, the dblp team has been actively working on building the dblp KG, as we already discussed in several recent blog posts. It has already proven to be quite useful, as the dblp KG makes sharing dblp’s curated data and combining it with other semantic data sources easy and straightforward. But it also enables us to launch a new tool that will allow you to generate new insights well beyond the current capabilities of our prepared web pages and our simple text-based search: our brand new dblp SPARQL query service. Read more…

The dblp Knowledge Graph: major extension and an update to the RDF schema

More than two years ago, we first published our dblp Knowledge Graph as an dblp RDF dump file. We have since been working on expanding and updating our RDF schema, as well as on adding new semantic relations to the graph. Today, we release our first major extension to the dblp KG: We added publication venues (e.g., journals and conference series) as first-class entities to the graph. Introducing dblp:Stream Until recently, the dblp KG had been mainly an “almost bipartite” graph of publications (dblp:Publication) and their creators (dblp:Creator). At some point we introduced further reification entities to model more context, but the publication-creator network remained at the core of the graph. With the new dblp:Stream class we now introduce a Read more…

DTD update May 2023

(updated 2023-06-28) A few days ago, we discussed the new dataset publications in dblp. As a preparation for more and more detailed datasets we slightly modify the DTD that defines the structure of our XML data export. A quick reminder: you can download the dblp dataset as a single XML file. For more details please see our FAQ page. All modifications are additions or slight changes of data type. They should not affect most data imports. The new DTD can be used for older releases of the XML file. We will not add the new elements/attributes before May 29, 2023. All changes can be seen in our change log. If you have any questions please contact us. The changes Added Read more…

Dataset publications in dblp

Datasets and other research artifacts are a major topic in the scientific community in the recent years. Many ongoing projects focus on improving the standardization, publication and citation of these artifacts. Currently, the dblp team is involved in three of them: NFDI4DataScience, NFDIxCS, and Unknown Data. As part of these projects, we are happy to announce that datasets and artifacts have now been added as true “first-class citizens” to dblp, just like any other research contribution. To this end, we updated our internal tools to better support datasets as a type of publication. We started to index some dataset repositories, such as Zenodo and IEEE DataPort, with many more to come. A first batch about 3,700 data publications is already Read more…

Building the German Research Data Infrastructure NFDI – for and with Computer Science

On November 4, 2022, the Joint Science Conference (GWK) selected Schloss Dagstuhl – Leibniz Center for Informatics and the consortium NFDIxCS for federal and state funding within the German National Research Data Infrastructure (NFDI). The consortium will be funded in the double-digit millions of Euros and over a duration of five years. Together with its sister consortium NFDI4DataScience, this is already the second NFDI grant that has been awarded to Schloss Dagstuhl. The NFDI is a collaborative, nationwide network to systematically index, interconnect, and make openly available the valuable stock of data from science and research. Together with 16 other leading partner institutions, Schloss Dagstuhl aims to systematically manage research data in computer science. The main goal of NFDIxCS is to Read more…

Updates to the dblp RDF schema

In the six months since the release of the dblp RDF dump and its persistent snapshot releases, the RDF dump has been downloaded a total of about a thousand times. We are pleased to see that the community is interested in using our semantic data in their research and beyond. However, based on the feedback we have received and the experience we have had experimenting with query interfaces for the data, we have also noticed a number of shortcomings in our schema that we want to address. Therefore, as of September 9, 2022, we are changing a few details about the dblp RDF schema. These changes aim (in part) to make the schema more convenient in practice, e.g., in SPARQL Read more…

OpenAlex integration in dblp

For more than 12 years, the Microsoft Academic Search, later renamed to just Microsoft Academic and eventually to Microsoft Academic Graph (MAG), had been the software giant’s  scholarly bibliographic information service. Despite it being one of the most comprehensive collections across all scientific fields out there, Microsoft obviously never envisioned MAG to be a lasting infrastructure for the community, but rather a playground for certain internal research and technology projects. Consequently, when Microsoft decided to pull the plug and end MAG in 2021, it came to the dismay of many researchers who were relying on MAG as a data source. At this point, the fine people at OurResearch, who were already providing the very useful Unpaywall service, stepped in and Read more…

dblp in RDF

For more than 20 years, a full dump of all dblp records in our own XML format has been available as open data for download and reuse. These dump files have always been in high demand over the years (with 500+ downloads in February 2022 alone) and are used as a research dataset in numerous publications. For quite some time now, we have been asked to provide a full RDF dump as well. Snapshots of the dblp XML file have been converted to RDF before by members of the community, and there are still a number of those RDF files available on the Internet. However, the problem with these snapshots is that they are usually not updated once they are Read more…