![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
BLINK@ISWC 2016: Kobe, Japan
- Irini Fundulaki, Anastasia Krithara, Axel-Cyrille Ngonga Ngomo
, Vassiliki Rentoumi:
Proceedings of the Workshop on Benchmarking Linked Data (BLINK 2016) co-located with the 15th International Semantic Web Conference (ISWC), Kobe, Japan, October 18, 2016. CEUR Workshop Proceedings 1700, CEUR-WS.org 2016 - Venelin Kotsev, Nikos Minadakis, Vassilis Papakonstantinou, Orri Erling, Irini Fundulaki, Atanas Kiryakov:
Benchmarking RDF Query Engines: The LDBC Semantic Publishing Benchmark. - Mirko Spasic, Milos Jovanovik, Arnau Prat-Pérez:
An RDF Dataset Generator for the Social Network Benchmark with Real-World Coherence. - Tzanina Saveta, Evangelia Daskalaki, Giorgos Flouris, Irini Fundulaki, Axel-Cyrille Ngonga Ngomo
:
How Well Does Your Instance Matching System Perform? Experimental Evaluation with LANCE. - Antonis Troumpoukis, Angelos Charalambidis, Giannis Mouchakis, Stasinos Konstantopoulos, Ronald Siebes, Victor de Boer, Stian Soiland-Reyes, Daniela Digles:
Developing a Benchmark Suite for Semantic Web Data from Existing Workflows. - Vassilis Papakonstantinou, Giorgos Flouris, Irini Fundulaki, Kostas Stefanidis, Giannis Roussakis:
Versioning for Linked Data: Archiving Systems and Benchmarks. - Davide Lanti, Guohui Xiao, Diego Calvanese:
Fast and Simple Data Scaling for OBDA Benchmarks.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.