Publikationen

2023

• Base Plat­form for Knowl­edge Graphs with Free Soft­wareIn: Sebas­t­ian Tramp, Ricar­do Usbeck, Natanael Arndt, Julia Holze and Sören Auer (eds.): Pro­ceed­ings of the Inter­na­tion­al Work­shop on Linked Data-dri­ven Resilience Research 2023, {CEUR} Work­shop Pro­ceed­ings. vol. 3401. Her­sonis­sos, GreeceSimon Bin, Claus Stadler, Nor­man Radtke, Kurt Jung­hanns, Sabine Grün­der-Fahrer and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  We present an Open Source base plat­form for the Coy­Pu knowl­edge graph project in the resilience domain. We report on our expe­ri­ences with sev­er­al tools which are used to cre­ate, main­tain, serve, view and explore a mod­u­lar large-scale knowl­edge graph, as well as the adap­tions that were nec­es­sary to enable fric­tion­less inter­ac­tion from both per­for­mance and usabil­i­ty per­spec­tives. For this pur­pose, sev­er­al adjust­ments had to be made. We pro­vide a broad view of dif­fer­ent pro­grams which are of rel­e­vance to this domain. We demon­strate that while it is already pos­si­ble to achieve good results with free soft­ware, there are still sev­er­al pain points that need to be addressed. Res­o­lu­tion of these issues is often not only a mat­ter of con­fig­u­ra­tion but requires mod­i­fi­ca­tion of the source code as well.

  @inproceedings{bin-2023–base-platform,
  abstract = {We present an Open Source base plat­form for the Coy­Pu knowl­edge graph project in the resilience domain. We report on our expe­ri­ences with sev­er­al tools which are used to cre­ate, main­tain, serve, view and explore a mod­u­lar large-scale knowl­edge graph, as well as the adap­tions that were nec­es­sary to enable fric­tion­less inter­ac­tion from both per­for­mance and usabil­i­ty per­spec­tives. For this pur­pose, sev­er­al adjust­ments had to be made. We pro­vide a broad view of dif­fer­ent pro­grams which are of rel­e­vance to this domain. We demon­strate that while it is already pos­si­ble to achieve good results with free soft­ware, there are still sev­er­al pain points that need to be addressed. Res­o­lu­tion of these issues is often not only a mat­ter of con­fig­u­ra­tion but requires mod­i­fi­ca­tion of the source code as well.},
  address = {Her­sonis­sos, Greece},
  author = {Bin, Simon and Stadler, Claus and Radtke, Nor­man and Jung­hanns, Kurt and Grün­der-Fahrer, Sabine and Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of the Inter­na­tion­al Work­shop on Linked Data-dri­ven Resilience Research 2023},
  edi­tor = {Tramp, Sebas­t­ian and Usbeck, Ricar­do and Arndt, Natanael and Holze, Julia and Auer, Sören},
  key­words = {sys:relevantFor:infai},
  month = {05},
  series = {{CEUR} Work­shop Pro­ceed­ings},
  title = {Base Plat­form for Knowl­edge Graphs with Free Soft­ware},
  vol­ume = 3401,
  year = 2023
  }
  

  %0 Con­fer­ence Paper
  %1 bin-2023–base-platform
  %A Bin, Simon
  %A Stadler, Claus
  %A Radtke, Nor­man
  %A Jung­hanns, Kurt
  %A Grün­der-Fahrer, Sabine
  %A Mar­tin, Michael
  %B Pro­ceed­ings of the Inter­na­tion­al Work­shop on Linked Data-dri­ven Resilience Research 2023
  %C Her­sonis­sos, Greece
  %D 2023
  %E Tramp, Sebas­t­ian
  %E Usbeck, Ricar­do
  %E Arndt, Natanael
  %E Holze, Julia
  %E Auer, Sören
  %T Base Plat­form for Knowl­edge Graphs with Free Soft­ware
  %U https://ceur-ws.org/Vol-3401/paper6.pdf
  %V 3401
  %X We present an Open Source base plat­form for the Coy­Pu knowl­edge graph project in the resilience domain. We report on our expe­ri­ences with sev­er­al tools which are used to cre­ate, main­tain, serve, view and explore a mod­u­lar large-scale knowl­edge graph, as well as the adap­tions that were nec­es­sary to enable fric­tion­less inter­ac­tion from both per­for­mance and usabil­i­ty per­spec­tives. For this pur­pose, sev­er­al adjust­ments had to be made. We pro­vide a broad view of dif­fer­ent pro­grams which are of rel­e­vance to this domain. We demon­strate that while it is already pos­si­ble to achieve good results with free soft­ware, there are still sev­er­al pain points that need to be addressed. Res­o­lu­tion of these issues is often not only a mat­ter of con­fig­u­ra­tion but requires mod­i­fi­ca­tion of the source code as well.
  

• Devel­op­ing a Scal­able Bench­mark for Assess­ing Large Lan­guage Mod­els in Knowl­edge Graph Engi­neer­ingIn: Pro­ceed­ings of Poster Track of Seman­tics 2023Lars-Peter Mey­er, Johannes Frey, Kurt Jung­hanns, Felix Brei, Kir­ill Bulert, Sabine Grün­der-Fahrer and Michael Martin

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  As the field of Large Lan­guage Mod­els (LLMs) evolves at an accel­er­at­ed pace, the crit­i­cal need to assess and mon­i­tor their per­for­mance emerges. We intro­duce a bench­mark­ing frame­work focused on knowl­edge graph engi­neer­ing (KGE) accom­pa­nied by three chal­lenges address­ing syn­tax and error cor­rec­tion, facts extrac­tion and dataset gen­er­a­tion. We show that while being a use­ful tool, LLMs are yet unfit to assist in knowl­edge graph gen­er­a­tion with zero-shot prompt­ing. Con­se­quent­ly, our LLM-KG-Bench frame­work pro­vides auto­mat­ic eval­u­a­tion and stor­age of LLM respons­es as well as sta­tis­ti­cal data and visu­al­iza­tion tools to sup­port track­ing of prompt engi­neer­ing and mod­el performance.

  @inproceedings{Meyer2023DevelopingScalableBenchmark,
  abstract = {As the field of Large Lan­guage Mod­els (LLMs) evolves at an accel­er­at­ed pace, the crit­i­cal need to assess and mon­i­tor their per­for­mance emerges. We intro­duce a bench­mark­ing frame­work focused on knowl­edge graph engi­neer­ing (KGE) accom­pa­nied by three chal­lenges address­ing syn­tax and error cor­rec­tion, facts extrac­tion and dataset gen­er­a­tion. We show that while being a use­ful tool, LLMs are yet unfit to assist in knowl­edge graph gen­er­a­tion with zero-shot prompt­ing. Con­se­quent­ly, our LLM-KG-Bench frame­work pro­vides auto­mat­ic eval­u­a­tion and stor­age of LLM respons­es as well as sta­tis­ti­cal data and visu­al­iza­tion tools to sup­port track­ing of prompt engi­neer­ing and mod­el per­for­mance.},
  author = {Mey­er, Lars-Peter and Frey, Johannes and Jung­hanns, Kurt and Brei, Felix and Bulert, Kir­ill and Grün­der-Fahrer, Sabine and Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of Poster Track of Seman­tics 2023},
  key­words = {sys:relevantFor:infai},
  title = {Devel­op­ing a Scal­able Bench­mark for Assess­ing Large Lan­guage Mod­els in Knowl­edge Graph Engi­neer­ing},
  year = 2023
  }
  

  %0 Con­fer­ence Paper
  %1 Meyer2023DevelopingScalableBenchmark
  %A Mey­er, Lars-Peter
  %A Frey, Johannes
  %A Jung­hanns, Kurt
  %A Brei, Felix
  %A Bulert, Kir­ill
  %A Grün­der-Fahrer, Sabine
  %A Mar­tin, Michael
  %B Pro­ceed­ings of Poster Track of Seman­tics 2023
  %D 2023
  %R 10.48550/ARXIV.2308.16622
  %T Devel­op­ing a Scal­able Bench­mark for Assess­ing Large Lan­guage Mod­els in Knowl­edge Graph Engi­neer­ing
  %X As the field of Large Lan­guage Mod­els (LLMs) evolves at an accel­er­at­ed pace, the crit­i­cal need to assess and mon­i­tor their per­for­mance emerges. We intro­duce a bench­mark­ing frame­work focused on knowl­edge graph engi­neer­ing (KGE) accom­pa­nied by three chal­lenges address­ing syn­tax and error cor­rec­tion, facts extrac­tion and dataset gen­er­a­tion. We show that while being a use­ful tool, LLMs are yet unfit to assist in knowl­edge graph gen­er­a­tion with zero-shot prompt­ing. Con­se­quent­ly, our LLM-KG-Bench frame­work pro­vides auto­mat­ic eval­u­a­tion and stor­age of LLM respons­es as well as sta­tis­ti­cal data and visu­al­iza­tion tools to sup­port track­ing of prompt engi­neer­ing and mod­el performance.
  

• Scal­ing RML and SPAR­QL-based Knowl­edge Graph Con­struc­tion with Apache SparkIn: 4th Inter­na­tion­al Work­shop on Knowl­edge Graph Con­struc­tion @ ESWC 2023, CEUR work­shop pro­ceed­ings. vol. 3471. Her­sonis­sos, GreeceClaus Stadler, Lorenz Büh­mann, Lars-Peter Mey­er and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Approach­es for the con­struc­tion of knowl­edge graphs from het­ero­ge­neous data sources range from ad-hoc scripts to ded­i­cat­ed map­ping lan­guages. Two com­mon foun­da­tions are there­by RML and SPARQL. So far, both approach­es are treat­ed as dif­fer­ent: On the one hand there are tools specif­i­cal­ly for pro­cess­ing RML where­as on the oth­er hand there are tools that extend SPARQL in order to incor­po­rate addi­tion­al data sources. In this work, we first show how this gap can be bridged by trans­lat­ing RML to a sequence of SPARQL CONSTRUCT queries and intro­duce the nec­es­sary SPARQL exten­sions. In a sub­se­quent step, we employ tech­niques to opti­mize SPARQL query work­loads as well as indi­vid­ual query exe­cu­tion times in order to obtain an opti­mized sequence of queries with respect to the order and unique­ness of the gen­er­at­ed triples. Final­ly, we present a cor­re­spond­ing SPARQL query exe­cu­tion engine based on the Apache Spark Big Data frame­work. In our eval­u­a­tion on bench­marks we show that our approach is capa­ble of achiev­ing RML map­ping exe­cu­tion per­for­mance that sur­pass­es the cur­rent state of the art.

  @inproceedings{stadler2023-scaling-rml,
  abstract = {Approach­es for the con­struc­tion of knowl­edge graphs from het­ero­ge­neous data sources range from ad-hoc scripts to ded­i­cat­ed map­ping lan­guages. Two com­mon foun­da­tions are there­by RML and SPARQL. So far, both approach­es are treat­ed as dif­fer­ent: On the one hand there are tools specif­i­cal­ly for pro­cess­ing RML where­as on the oth­er hand there are tools that extend SPARQL in order to incor­po­rate addi­tion­al data sources. In this work, we first show how this gap can be bridged by trans­lat­ing RML to a sequence of SPARQL CONSTRUCT queries and intro­duce the nec­es­sary SPARQL exten­sions. In a sub­se­quent step, we employ tech­niques to opti­mize SPARQL query work­loads as well as indi­vid­ual query exe­cu­tion times in order to obtain an opti­mized sequence of queries with respect to the order and unique­ness of the gen­er­at­ed triples. Final­ly, we present a cor­re­spond­ing SPARQL query exe­cu­tion engine based on the Apache Spark Big Data frame­work. In our eval­u­a­tion on bench­marks we show that our approach is capa­ble of achiev­ing RML map­ping exe­cu­tion per­for­mance that sur­pass­es the cur­rent state of the art.},
  address = {Her­sonis­sos, Greece},
  author = {Stadler, Claus and Büh­mann, Lorenz and Mey­er, Lars-Peter and Mar­tin, Michael},
  book­ti­tle = {4th Inter­na­tion­al Work­shop on Knowl­edge Graph Con­struc­tion @ ESWC 2023},
  key­words = {sys:relevantFor:infai},
  series = {CEUR work­shop pro­ceed­ings},
  title = {Scal­ing RML and SPAR­QL-based Knowl­edge Graph Con­struc­tion with Apache Spark},
  vol­ume = 3471,
  year = 2023
  }
  

  %0 Con­fer­ence Paper
  %1 stadler2023-scal­ing-rml
  %A Stadler, Claus
  %A Büh­mann, Lorenz
  %A Mey­er, Lars-Peter
  %A Mar­tin, Michael
  %B 4th Inter­na­tion­al Work­shop on Knowl­edge Graph Con­struc­tion @ ESWC 2023
  %C Her­sonis­sos, Greece
  %D 2023
  %T Scal­ing RML and SPAR­QL-based Knowl­edge Graph Con­struc­tion with Apache Spark
  %U https://ceur-ws.org/Vol-3471/paper8.pdf
  %V 3471
  %X Approach­es for the con­struc­tion of knowl­edge graphs from het­ero­ge­neous data sources range from ad-hoc scripts to ded­i­cat­ed map­ping lan­guages. Two com­mon foun­da­tions are there­by RML and SPARQL. So far, both approach­es are treat­ed as dif­fer­ent: On the one hand there are tools specif­i­cal­ly for pro­cess­ing RML where­as on the oth­er hand there are tools that extend SPARQL in order to incor­po­rate addi­tion­al data sources. In this work, we first show how this gap can be bridged by trans­lat­ing RML to a sequence of SPARQL CONSTRUCT queries and intro­duce the nec­es­sary SPARQL exten­sions. In a sub­se­quent step, we employ tech­niques to opti­mize SPARQL query work­loads as well as indi­vid­ual query exe­cu­tion times in order to obtain an opti­mized sequence of queries with respect to the order and unique­ness of the gen­er­at­ed triples. Final­ly, we present a cor­re­spond­ing SPARQL query exe­cu­tion engine based on the Apache Spark Big Data frame­work. In our eval­u­a­tion on bench­marks we show that our approach is capa­ble of achiev­ing RML map­ping exe­cu­tion per­for­mance that sur­pass­es the cur­rent state of the art.
  

• LLM-assist­ed Knowl­edge Graph Engi­neer­ing: Exper­i­ments with Chat­G­PTLars-Peter Mey­er, Claus Stadler, Johannes Frey, Nor­man Radtke, Kurt Jung­hanns, Roy Meiss­ner, Gor­dian Dzi­wis, Kir­ill Bulert, Michael Martin

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  Knowl­edge Graphs (KG) pro­vide us with a struc­tured, flex­i­ble, trans­par­ent, cross-sys­tem, and col­lab­o­ra­tive way of orga­niz­ing our knowl­edge and data across var­i­ous domains in soci­ety and indus­tri­al as well as sci­en­tif­ic dis­ci­plines. KGs sur­pass any oth­er form of rep­re­sen­ta­tion in terms of effec­tive­ness. How­ev­er, Knowl­edge Graph Engi­neer­ing (KGE) requires in-depth expe­ri­ences of graph struc­tures, web tech­nolo­gies, exist­ing mod­els and vocab­u­lar­ies, rule sets, log­ic, as well as best prac­tices. It also demands a sig­nif­i­cant amount of work. Con­sid­er­ing the advance­ments in large lan­guage mod­els (LLMs) and their inter­faces and appli­ca­tions in recent years, we have con­duct­ed com­pre­hen­sive exper­i­ments with Chat­G­PT to explore its poten­tial in sup­port­ing KGE. In this paper, we present a selec­tion of these exper­i­ments and their results to demon­strate how Chat­G­PT can assist us in the devel­op­ment and man­age­ment of KGs.

  @article{Meyer2023LLMassistedKnowledge,
  abstract = {Knowl­edge Graphs (KG) pro­vide us with a struc­tured, flex­i­ble, trans­par­ent, cross-sys­tem, and col­lab­o­ra­tive way of orga­niz­ing our knowl­edge and data across var­i­ous domains in soci­ety and indus­tri­al as well as sci­en­tif­ic dis­ci­plines. KGs sur­pass any oth­er form of rep­re­sen­ta­tion in terms of effec­tive­ness. How­ev­er, Knowl­edge Graph Engi­neer­ing (KGE) requires in-depth expe­ri­ences of graph struc­tures, web tech­nolo­gies, exist­ing mod­els and vocab­u­lar­ies, rule sets, log­ic, as well as best prac­tices. It also demands a sig­nif­i­cant amount of work. Con­sid­er­ing the advance­ments in large lan­guage mod­els (LLMs) and their inter­faces and appli­ca­tions in recent years, we have con­duct­ed com­pre­hen­sive exper­i­ments with Chat­G­PT to explore its poten­tial in sup­port­ing KGE. In this paper, we present a selec­tion of these exper­i­ments and their results to demon­strate how Chat­G­PT can assist us in the devel­op­ment and man­age­ment of KGs.},
  author = {Mey­er, Lars-Peter and Stadler, Claus and Frey, Johannes and Radtke, Nor­man and Jung­hanns, Kurt and Meiss­ner, Roy and Dzi­wis, Gor­dian and Bulert, Kir­ill and Mar­tin, Michael},
  key­words = {sys:relevantFor:infai},
  title = {LLM-assist­ed Knowl­edge Graph Engi­neer­ing: Exper­i­ments with Chat­G­PT},
  year = 2023
  }
  

  %0 Jour­nal Arti­cle
  %1 Meyer2023LLMassistedKnowledge
  %A Mey­er, Lars-Peter
  %A Stadler, Claus
  %A Frey, Johannes
  %A Radtke, Nor­man
  %A Jung­hanns, Kurt
  %A Meiss­ner, Roy
  %A Dzi­wis, Gor­dian
  %A Bulert, Kir­ill
  %A Mar­tin, Michael
  %D 2023
  %R 10.48550/ARXIV.2307.06917
  %T LLM-assist­ed Knowl­edge Graph Engi­neer­ing: Exper­i­ments with Chat­G­PT
  %X Knowl­edge Graphs (KG) pro­vide us with a struc­tured, flex­i­ble, trans­par­ent, cross-sys­tem, and col­lab­o­ra­tive way of orga­niz­ing our knowl­edge and data across var­i­ous domains in soci­ety and indus­tri­al as well as sci­en­tif­ic dis­ci­plines. KGs sur­pass any oth­er form of rep­re­sen­ta­tion in terms of effec­tive­ness. How­ev­er, Knowl­edge Graph Engi­neer­ing (KGE) requires in-depth expe­ri­ences of graph struc­tures, web tech­nolo­gies, exist­ing mod­els and vocab­u­lar­ies, rule sets, log­ic, as well as best prac­tices. It also demands a sig­nif­i­cant amount of work. Con­sid­er­ing the advance­ments in large lan­guage mod­els (LLMs) and their inter­faces and appli­ca­tions in recent years, we have con­duct­ed com­pre­hen­sive exper­i­ments with Chat­G­PT to explore its poten­tial in sup­port­ing KGE. In this paper, we present a selec­tion of these exper­i­ments and their results to demon­strate how Chat­G­PT can assist us in the devel­op­ment and man­age­ment of KGs.
  

• {KGCW}2023 Chal­lenge Report {RDF}{P}rocessing{T}oolkit / SansaIn: 4th Inter­na­tion­al Work­shop on Knowl­edge Graph Con­struc­tion @ ESWC 2023, CEUR work­shop pro­ceed­ings. Her­sonis­sos, GreeceSimon Bin, Claus Stadler and Lorenz Bühmann

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  This is the report of our par­tic­i­pa­tion in the KGCW2023 Chal­lenge @ ESWC 2023 with our RDFProcessingToolkit/Sansa sys­tem which won the “fastest” tool award. The chal­lenge was about the con­struc­tion of RDF knowl­edge graphs from RML spec­i­fi­ca­tions with vary­ing com­plex­i­ty in regard to the mix of input for­mats, char­ac­ter­is­tics of the data and the need­ed join oper­a­tions. We detail how we inte­grat­ed our tool into the pro­vid­ed bench­mark frame­work. There­by we also report on the issues and short­com­ings we encoun­tered as a base for future improve­ments. Fur­ther­more, we pro­vide an analy­sis of the data mea­sured with the bench­mark framework.

  @inproceedings{stadler2023-kgcw-challenge,
  abstract = {This is the report of our par­tic­i­pa­tion in the KGCW2023 Chal­lenge @ ESWC 2023 with our RDFProcessingToolkit/Sansa sys­tem which won the “fastest” tool award. The chal­lenge was about the con­struc­tion of RDF knowl­edge graphs from RML spec­i­fi­ca­tions with vary­ing com­plex­i­ty in regard to the mix of input for­mats, char­ac­ter­is­tics of the data and the need­ed join oper­a­tions. We detail how we inte­grat­ed our tool into the pro­vid­ed bench­mark frame­work. There­by we also report on the issues and short­com­ings we encoun­tered as a base for future improve­ments. Fur­ther­more, we pro­vide an analy­sis of the data mea­sured with the bench­mark frame­work.},
  address = {Her­sonis­sos, Greece},
  author = {Bin, Simon and Stadler, Claus and Büh­mann, Lorenz},
  book­ti­tle = {4th Inter­na­tion­al Work­shop on Knowl­edge Graph Con­struc­tion @ ESWC 2023},
  key­words = {sys:relevantFor:infai},
  num­ber = 3471,
  series = {CEUR work­shop pro­ceed­ings},
  title = {{KGCW}2023 Chal­lenge Report {RDF}{P}rocessing{T}oolkit / Sansa},
  year = 2023
  }
  

  %0 Con­fer­ence Paper
  %1 stadler2023-kgcw-chal­lenge
  %A Bin, Simon
  %A Stadler, Claus
  %A Büh­mann, Lorenz
  %B 4th Inter­na­tion­al Work­shop on Knowl­edge Graph Con­struc­tion @ ESWC 2023
  %C Her­sonis­sos, Greece
  %D 2023
  %N 3471
  %T {KGCW}2023 Chal­lenge Report {RDF}{P}rocessing{T}oolkit / Sansa
  %U https://ceur-ws.org/Vol-3471/paper12.pdf
  %X This is the report of our par­tic­i­pa­tion in the KGCW2023 Chal­lenge @ ESWC 2023 with our RDFProcessingToolkit/Sansa sys­tem which won the “fastest” tool award. The chal­lenge was about the con­struc­tion of RDF knowl­edge graphs from RML spec­i­fi­ca­tions with vary­ing com­plex­i­ty in regard to the mix of input for­mats, char­ac­ter­is­tics of the data and the need­ed join oper­a­tions. We detail how we inte­grat­ed our tool into the pro­vid­ed bench­mark frame­work. There­by we also report on the issues and short­com­ings we encoun­tered as a base for future improve­ments. Fur­ther­more, we pro­vide an analy­sis of the data mea­sured with the bench­mark framework.
  

• Bench­mark­ing the Abil­i­ties of Large Lan­guage Mod­els for RDF Knowl­edge Graph Cre­ation and Com­pre­hen­sion: How Well Do LLMs Speak Tur­tle?In: Pro­ceed­ings of Work­shop Deep Learn­ing for Knowl­edge Graphs (DL4KG) @ ISWC23Johannes Frey, Lars-Peter Mey­er, Natanael Arndt, Felix Brei and Kir­ill Bulert

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Large Lan­guage Mod­els (LLMs) are advanc­ing at a rapid pace, with sig­nif­i­cant improve­ments at nat­ur­al lan­guage pro­cess­ing and cod­ing tasks. Yet, their abil­i­ty to work with for­mal lan­guages rep­re­sent­ing data, specif­i­cal­ly with­in the realm of knowl­edge graph engi­neer­ing, remains under-inves­ti­gat­ed. To eval­u­ate the pro­fi­cien­cy of var­i­ous LLMs, we cre­at­ed a set of five tasks that probe their abil­i­ty to parse, under­stand, ana­lyze, and cre­ate knowl­edge graphs seri­al­ized in Tur­tle syn­tax. These tasks, each embody­ing dis­tinct degrees of com­plex­i­ty and being able to scale with the size of the prob­lem, have been inte­grat­ed into our auto­mat­ed eval­u­a­tion sys­tem, the LLM-KG-Bench. The eval­u­a­tion encom­passed four com­mer­cial­ly avail­able LLMs — GPT‑3.5, GPT‑4, Claude 1.3, and Claude 2.0, as well as two freely acces­si­ble offline mod­els, GPT4All Vicu­na and GPT4All Fal­con 13B. This analy­sis offers an in-depth under­stand­ing of the strengths and short­com­ings of LLMs in rela­tion to their appli­ca­tion with­in RDF knowl­edge graph engi­neer­ing work­flows uti­liz­ing Tur­tle rep­re­sen­ta­tion. While our find­ings show that the lat­est com­mer­cial mod­els out­per­form their fore­run­ners in terms of pro­fi­cien­cy with the Tur­tle lan­guage, they also reveal an appar­ent weak­ness. These mod­els fall short when it comes to adher­ing strict­ly to the out­put for­mat­ting con­straints, a cru­cial require­ment in this context.

  @inproceedings{Frey2023BenchmarkingAbilitiesLarge,
  abstract = {Large Lan­guage Mod­els (LLMs) are advanc­ing at a rapid pace, with sig­nif­i­cant improve­ments at nat­ur­al lan­guage pro­cess­ing and cod­ing tasks. Yet, their abil­i­ty to work with for­mal lan­guages rep­re­sent­ing data, specif­i­cal­ly with­in the realm of knowl­edge graph engi­neer­ing, remains under-inves­ti­gat­ed. To eval­u­ate the pro­fi­cien­cy of var­i­ous LLMs, we cre­at­ed a set of five tasks that probe their abil­i­ty to parse, under­stand, ana­lyze, and cre­ate knowl­edge graphs seri­al­ized in Tur­tle syn­tax. These tasks, each embody­ing dis­tinct degrees of com­plex­i­ty and being able to scale with the size of the prob­lem, have been inte­grat­ed into our auto­mat­ed eval­u­a­tion sys­tem, the LLM-KG-Bench. The eval­u­a­tion encom­passed four com­mer­cial­ly avail­able LLMs — GPT‑3.5, GPT‑4, Claude 1.3, and Claude 2.0, as well as two freely acces­si­ble offline mod­els, GPT4All Vicu­na and GPT4All Fal­con 13B. This analy­sis offers an in-depth under­stand­ing of the strengths and short­com­ings of LLMs in rela­tion to their appli­ca­tion with­in RDF knowl­edge graph engi­neer­ing work­flows uti­liz­ing Tur­tle rep­re­sen­ta­tion. While our find­ings show that the lat­est com­mer­cial mod­els out­per­form their fore­run­ners in terms of pro­fi­cien­cy with the Tur­tle lan­guage, they also reveal an appar­ent weak­ness. These mod­els fall short when it comes to adher­ing strict­ly to the out­put for­mat­ting con­straints, a cru­cial require­ment in this con­text.},
  author = {Frey, Johannes and Mey­er, Lars-Peter and Arndt, Natanael and Brei, Felix and Bulert, Kir­ill},
  book­ti­tle = {Pro­ceed­ings of Work­shop Deep Learn­ing for Knowl­edge Graphs (DL4KG) @ ISWC23},
  key­words = {sys:relevantFor:infai},
  title = {Bench­mark­ing the Abil­i­ties of Large Lan­guage Mod­els for RDF Knowl­edge Graph Cre­ation and Com­pre­hen­sion: How Well Do LLMs Speak Tur­tle?},
  year = 2023
  }
  

  %0 Con­fer­ence Paper
  %1 Frey2023BenchmarkingAbilitiesLarge
  %A Frey, Johannes
  %A Mey­er, Lars-Peter
  %A Arndt, Natanael
  %A Brei, Felix
  %A Bulert, Kir­ill
  %B Pro­ceed­ings of Work­shop Deep Learn­ing for Knowl­edge Graphs (DL4KG) @ ISWC23
  %D 2023
  %R 10.48550/ARXIV.2309.17122
  %T Bench­mark­ing the Abil­i­ties of Large Lan­guage Mod­els for RDF Knowl­edge Graph Cre­ation and Com­pre­hen­sion: How Well Do LLMs Speak Tur­tle?
  %U https://ceur-ws.org/Vol-3559/paper‑3.pdf
  %X Large Lan­guage Mod­els (LLMs) are advanc­ing at a rapid pace, with sig­nif­i­cant improve­ments at nat­ur­al lan­guage pro­cess­ing and cod­ing tasks. Yet, their abil­i­ty to work with for­mal lan­guages rep­re­sent­ing data, specif­i­cal­ly with­in the realm of knowl­edge graph engi­neer­ing, remains under-inves­ti­gat­ed. To eval­u­ate the pro­fi­cien­cy of var­i­ous LLMs, we cre­at­ed a set of five tasks that probe their abil­i­ty to parse, under­stand, ana­lyze, and cre­ate knowl­edge graphs seri­al­ized in Tur­tle syn­tax. These tasks, each embody­ing dis­tinct degrees of com­plex­i­ty and being able to scale with the size of the prob­lem, have been inte­grat­ed into our auto­mat­ed eval­u­a­tion sys­tem, the LLM-KG-Bench. The eval­u­a­tion encom­passed four com­mer­cial­ly avail­able LLMs — GPT‑3.5, GPT‑4, Claude 1.3, and Claude 2.0, as well as two freely acces­si­ble offline mod­els, GPT4All Vicu­na and GPT4All Fal­con 13B. This analy­sis offers an in-depth under­stand­ing of the strengths and short­com­ings of LLMs in rela­tion to their appli­ca­tion with­in RDF knowl­edge graph engi­neer­ing work­flows uti­liz­ing Tur­tle rep­re­sen­ta­tion. While our find­ings show that the lat­est com­mer­cial mod­els out­per­form their fore­run­ners in terms of pro­fi­cien­cy with the Tur­tle lan­guage, they also reveal an appar­ent weak­ness. These mod­els fall short when it comes to adher­ing strict­ly to the out­put for­mat­ting con­straints, a cru­cial require­ment in this context.
  

2022

• {LSQ} 2.0: A linked dataset of {SPARQL} query logsIn: Philippe Cud­ré-Mau­roux (ed.) Seman­tic Web, IOS Press, pp. 1–23Claus Stadler, Muham­mad Saleem, Qais­er Mehmood, Car­los Buil-Aran­da, Michel Dumon­tier, Aidan Hogan and Axel-Cyrille Ngonga Ngomo

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  We present the Linked SPARQL Queries (LSQ) dataset, which cur­rent­ly describes 43.95 mil­lion exe­cu­tions of 11.56 mil­lion unique SPARQL queries extract­ed from the logs of 27 dif­fer­ent end­points. The LSQ dataset pro­vides RDF descrip­tions of each such query, which are indexed in a pub­lic LSQ end­point, allow­ing inter­est­ed par­ties to find queries with the char­ac­ter­is­tics they require. We begin by describ­ing the use cas­es envis­aged for the LSQ dataset, which include appli­ca­tions for research on com­mon fea­tures of queries, for build­ing cus­tom bench­marks, and for design­ing user inter­faces. We then dis­cuss how LSQ has been used in prac­tice since the release of four ini­tial SPARQL logs in 2015. We dis­cuss the mod­el and vocab­u­lary that we use to rep­re­sent these queries in RDF. We then pro­vide a brief overview of the 27 end­points from which we extract­ed queries in terms of the domain to which they per­tain and the data they con­tain. We pro­vide sta­tis­tics on the queries includ­ed from each log, includ­ing the num­ber of query exe­cu­tions, unique queries, as well as dis­tri­b­u­tions of queries for a vari­ety of select­ed char­ac­ter­is­tics. We final­ly dis­cuss how the LSQ dataset is host­ed and how it can be accessed and lever­aged by inter­est­ed par­ties for their use cases.

  @article{stadler2022-lsq20,
  abstract = {We present the Linked SPARQL Queries (LSQ) dataset, which cur­rent­ly describes 43.95 mil­lion exe­cu­tions of 11.56 mil­lion unique SPARQL queries extract­ed from the logs of 27 dif­fer­ent end­points. The LSQ dataset pro­vides RDF descrip­tions of each such query, which are indexed in a pub­lic LSQ end­point, allow­ing inter­est­ed par­ties to find queries with the char­ac­ter­is­tics they require. We begin by describ­ing the use cas­es envis­aged for the LSQ dataset, which include appli­ca­tions for research on com­mon fea­tures of queries, for build­ing cus­tom bench­marks, and for design­ing user inter­faces. We then dis­cuss how LSQ has been used in prac­tice since the release of four ini­tial SPARQL logs in 2015. We dis­cuss the mod­el and vocab­u­lary that we use to rep­re­sent these queries in RDF. We then pro­vide a brief overview of the 27 end­points from which we extract­ed queries in terms of the domain to which they per­tain and the data they con­tain. We pro­vide sta­tis­tics on the queries includ­ed from each log, includ­ing the num­ber of query exe­cu­tions, unique queries, as well as dis­tri­b­u­tions of queries for a vari­ety of select­ed char­ac­ter­is­tics. We final­ly dis­cuss how the LSQ dataset is host­ed and how it can be accessed and lever­aged by inter­est­ed par­ties for their use cas­es.},
  author = {Stadler, Claus and Saleem, Muham­mad and Mehmood, Qais­er and Buil-Aran­da, Car­los and Dumon­tier, Michel and Hogan, Aidan and Ngonga Ngo­mo, Axel-Cyrille},
  edi­tor = {Cud­ré-Mau­roux, Philippe},
  jour­nal = {Seman­tic Web},
  key­words = {sys:relevantFor:infai},
  month = 11,
  pages = {1–23},
  pub­lish­er = {IOS Press},
  title = {{LSQ} 2.0: A linked dataset of {SPARQL} query logs},
  year = 2022
  }
  

  %0 Jour­nal Arti­cle
  %1 stadler2022-lsq20
  %A Stadler, Claus
  %A Saleem, Muham­mad
  %A Mehmood, Qais­er
  %A Buil-Aran­da, Car­los
  %A Dumon­tier, Michel
  %A Hogan, Aidan
  %A Ngonga Ngo­mo, Axel-Cyrille
  %D 2022
  %E Cud­ré-Mau­roux, Philippe
  %I IOS Press
  %J Seman­tic Web
  %P 1–23
  %R 10.3233/SW-223015
  %T {LSQ} 2.0: A linked dataset of {SPARQL} query logs
  %U https://www.semantic-web-journal.net/system/files/swj3015.pdf
  %X We present the Linked SPARQL Queries (LSQ) dataset, which cur­rent­ly describes 43.95 mil­lion exe­cu­tions of 11.56 mil­lion unique SPARQL queries extract­ed from the logs of 27 dif­fer­ent end­points. The LSQ dataset pro­vides RDF descrip­tions of each such query, which are indexed in a pub­lic LSQ end­point, allow­ing inter­est­ed par­ties to find queries with the char­ac­ter­is­tics they require. We begin by describ­ing the use cas­es envis­aged for the LSQ dataset, which include appli­ca­tions for research on com­mon fea­tures of queries, for build­ing cus­tom bench­marks, and for design­ing user inter­faces. We then dis­cuss how LSQ has been used in prac­tice since the release of four ini­tial SPARQL logs in 2015. We dis­cuss the mod­el and vocab­u­lary that we use to rep­re­sent these queries in RDF. We then pro­vide a brief overview of the 27 end­points from which we extract­ed queries in terms of the domain to which they per­tain and the data they con­tain. We pro­vide sta­tis­tics on the queries includ­ed from each log, includ­ing the num­ber of query exe­cu­tions, unique queries, as well as dis­tri­b­u­tions of queries for a vari­ety of select­ed char­ac­ter­is­tics. We final­ly dis­cuss how the LSQ dataset is host­ed and how it can be accessed and lever­aged by inter­est­ed par­ties for their use cases.
  

• Seman­tifi­ca­tion of Geospa­tial Infor­ma­tion for Enriched Knowl­edge Rep­re­sen­ta­tion in Con­text of Cri­sis Infor­mat­icsIn: Natanael Arndt, Sabine Grün­der-Fahrer, Julia Holze, Michael Mar­tin and Sebas­t­ian Tramp (eds.): Pro­ceed­ings of the Inter­na­tion­al Work­shop on Data-dri­ven Resilience Research 2022, {CEUR} Work­shop Pro­ceed­ings. vol. 3376. Leipzig, Ger­manyClaus Stadler, Simon Bin, Lorenz Büh­mann, Nor­man Radtke, Kurt Jung­hanns, Sabine Grün­der-Fahrer and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In the con­text of cri­sis infor­mat­ics, the inte­gra­tion and exploita­tion of high vol­umes of het­ero­ge­neous data from mul­ti­ple sources is one of the big chances as well as chal­lenges up to now. Seman­tic Web tech­nolo­gies have proven a valu­able means to inte­grate and rep­re­sent knowl­edge on the basis of domain con­cepts which improves inter­op­er­abil­i­ty and inter­pretabil­i­ty of infor­ma­tion resources and allows deriv­ing more knowl­edge via seman­tic rela­tions and rea­son­ing. In this paper, we inves­ti­gate the poten­tial of rep­re­sent­ing and pro­cess­ing geospa­tial infor­ma­tion with­in the seman­tic par­a­digm. We show, on the tech­ni­cal lev­el, how exist­ing open source means can be used and sup­ple­ment­ed as to effi­cient­ly han­dle geo­graph­ic infor­ma­tion and to con­vey exem­plary results high­ly rel­e­vant in con­text of cri­sis man­age­ment appli­ca­tions. When giv­en seman­tic resources get enriched with geospa­tial infor­ma­tion, new infor­ma­tion can be retrieved com­bin­ing the con­cepts of mul­ti-poly­gons and geo-coor­di­nates and using the pow­er of GeoSPAR­QL queries. Cus­tom SPARQL exten­sion func­tions and data types for JSON, XML and CSV as well as for dialects such as Geo­J­SON and GML allow for suc­cinct inte­gra­tion of het­ero­ge­neous data. We imple­ment­ed these fea­tures for the Apache Jena Seman­tic Web frame­work by lever­ag­ing its plu­g­in sys­tems. Fur­ther­more, sig­nif­i­cant improve­ments w.r.t. GeoSPAR­QL query per­for­mance have been con­tributed to the framework.

  @inproceedings{stadler-c-2022–geospacial,
  abstract = {In the con­text of cri­sis infor­mat­ics, the inte­gra­tion and exploita­tion of high vol­umes of het­ero­ge­neous data from mul­ti­ple sources is one of the big chances as well as chal­lenges up to now. Seman­tic Web tech­nolo­gies have proven a valu­able means to inte­grate and rep­re­sent knowl­edge on the basis of domain con­cepts which improves inter­op­er­abil­i­ty and inter­pretabil­i­ty of infor­ma­tion resources and allows deriv­ing more knowl­edge via seman­tic rela­tions and rea­son­ing. In this paper, we inves­ti­gate the poten­tial of rep­re­sent­ing and pro­cess­ing geospa­tial infor­ma­tion with­in the seman­tic par­a­digm. We show, on the tech­ni­cal lev­el, how exist­ing open source means can be used and sup­ple­ment­ed as to effi­cient­ly han­dle geo­graph­ic infor­ma­tion and to con­vey exem­plary results high­ly rel­e­vant in con­text of cri­sis man­age­ment appli­ca­tions. When giv­en seman­tic resources get enriched with geospa­tial infor­ma­tion, new infor­ma­tion can be retrieved com­bin­ing the con­cepts of mul­ti-poly­gons and geo-coor­di­nates and using the pow­er of GeoSPAR­QL queries. Cus­tom SPARQL exten­sion func­tions and data types for JSON, XML and CSV as well as for dialects such as Geo­J­SON and GML allow for suc­cinct inte­gra­tion of het­ero­ge­neous data. We imple­ment­ed these fea­tures for the Apache Jena Seman­tic Web frame­work by lever­ag­ing its plu­g­in sys­tems. Fur­ther­more, sig­nif­i­cant improve­ments w.r.t. GeoSPAR­QL query per­for­mance have been con­tributed to the frame­work.},
  address = {Leipzig, Ger­many},
  author = {Stadler, Claus and Bin, Simon and Büh­mann, Lorenz and Radtke, Nor­man and Jung­hanns, Kurt and Grün­der-Fahrer, Sabine and Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of the Inter­na­tion­al Work­shop on Data-dri­ven Resilience Research 2022},
  edi­tor = {Arndt, Natanael and Grün­der-Fahrer, Sabine and Holze, Julia and Mar­tin, Michael and Tramp, Sebas­t­ian},
  key­words = {sys:relevantFor:infai},
  month = {07},
  series = {{CEUR} Work­shop Pro­ceed­ings},
  title = {Seman­tifi­ca­tion of Geospa­tial Infor­ma­tion for Enriched Knowl­edge Rep­re­sen­ta­tion in Con­text of Cri­sis Infor­mat­ics},
  vol­ume = 3376,
  year = 2022
  }
  

  %0 Con­fer­ence Paper
  %1 stadler-c-2022–geospacial
  %A Stadler, Claus
  %A Bin, Simon
  %A Büh­mann, Lorenz
  %A Radtke, Nor­man
  %A Jung­hanns, Kurt
  %A Grün­der-Fahrer, Sabine
  %A Mar­tin, Michael
  %B Pro­ceed­ings of the Inter­na­tion­al Work­shop on Data-dri­ven Resilience Research 2022
  %C Leipzig, Ger­many
  %D 2022
  %E Arndt, Natanael
  %E Grün­der-Fahrer, Sabine
  %E Holze, Julia
  %E Mar­tin, Michael
  %E Tramp, Sebas­t­ian
  %T Seman­tifi­ca­tion of Geospa­tial Infor­ma­tion for Enriched Knowl­edge Rep­re­sen­ta­tion in Con­text of Cri­sis Infor­mat­ics
  %U https://ceur-ws.org/Vol-3376/paper03.pdf
  %V 3376
  %X In the con­text of cri­sis infor­mat­ics, the inte­gra­tion and exploita­tion of high vol­umes of het­ero­ge­neous data from mul­ti­ple sources is one of the big chances as well as chal­lenges up to now. Seman­tic Web tech­nolo­gies have proven a valu­able means to inte­grate and rep­re­sent knowl­edge on the basis of domain con­cepts which improves inter­op­er­abil­i­ty and inter­pretabil­i­ty of infor­ma­tion resources and allows deriv­ing more knowl­edge via seman­tic rela­tions and rea­son­ing. In this paper, we inves­ti­gate the poten­tial of rep­re­sent­ing and pro­cess­ing geospa­tial infor­ma­tion with­in the seman­tic par­a­digm. We show, on the tech­ni­cal lev­el, how exist­ing open source means can be used and sup­ple­ment­ed as to effi­cient­ly han­dle geo­graph­ic infor­ma­tion and to con­vey exem­plary results high­ly rel­e­vant in con­text of cri­sis man­age­ment appli­ca­tions. When giv­en seman­tic resources get enriched with geospa­tial infor­ma­tion, new infor­ma­tion can be retrieved com­bin­ing the con­cepts of mul­ti-poly­gons and geo-coor­di­nates and using the pow­er of GeoSPAR­QL queries. Cus­tom SPARQL exten­sion func­tions and data types for JSON, XML and CSV as well as for dialects such as Geo­J­SON and GML allow for suc­cinct inte­gra­tion of het­ero­ge­neous data. We imple­ment­ed these fea­tures for the Apache Jena Seman­tic Web frame­work by lever­ag­ing its plu­g­in sys­tems. Fur­ther­more, sig­nif­i­cant improve­ments w.r.t. GeoSPAR­QL query per­for­mance have been con­tributed to the framework.
  

• {LSQ} Frame­work: The {LSQ} Frame­work for {SPARQL} Query Log Pro­cess­ingIn: 6th Work­shop on Stor­ing, Query­ing and Bench­mark­ing Knowl­edge Graphs @ ISWC 2022, {CEUR} Work­shop Pro­ceed­ings. vol. 3279Claus Stadler, Muham­mad Saleem and Axel-Cyrille Ngonga Ngomo

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The Linked SPARQL Queries (LSQ) datasets con­tain real-world SPARQL queries col­lect­ed from the query logs of the pub­licly avail­able SPARQL end­points. In LSQ, each SPARQL query is rep­re­sent­ed as RDF with var­i­ous struc­tur­al and data-dri­ven fea­tures attached. In this paper, we present the LSQ Java frame­work for cre­at­ing rich knowl­edge graphs from SPARQL query logs. The frame­work is able to RDFize SPARQL query logs, which are avail­able in dif­fer­ent for­mats, in a scal­able way. Fur­ther­more, the frame­work offers a set of sta­t­ic and dynam­ic enrich­ers. Sta­t­ic enrich­ers derive infor­ma­tion from the queries, such as their num­ber of basic graph pat­terns and pro­ject­ed vari­ables or even a full SPIN mod­el. Dynam­ic enrich­ment involves addi­tion­al resources. For instance, the bench­mark enrich­er exe­cutes queries against a SPARQL end­point and col­lects query exe­cu­tion times and result set sizes. This frame­work has already been used to con­vert query logs of 27 pub­lic SPARQL end­points, rep­re­sent­ing 43.95 mil­lion exe­cu­tions of 11.56 mil­lion unique SPARQL queries. The LSQ queries have been used in many use cas­es such as bench­mark­ing based on real-world SPARQL queries, SPARQL adop­tion, caching, query opti­miza­tion, use­abil­i­ty analy­sis, and meta-query­ing. Real­iza­tion of LSQ required devis­ing nov­el soft­ware com­po­nents to (a) improve scal­a­bil­i­ty of RDF data pro­cess­ing with the Apache Spark Big Data frame­work and (b) ease oper­a­tions of com­plex RDF data mod­els such as con­trolled skolem­iza­tion. Fol­low­ing the spir­it of Open­Source soft­ware devel­op­ment and the “don’t repeat your­self” (DRY) par­a­digm, the work on the LSQ frame­work also result­ed in con­tri­bu­tions to Apache Jena in order to make these improve­ments read­i­ly avail­able out­side of the LSQ context.

  @inproceedings{stadler2022-lsq-framework,
  abstract = {The Linked SPARQL Queries (LSQ) datasets con­tain real-world SPARQL queries col­lect­ed from the query logs of the pub­licly avail­able SPARQL end­points. In LSQ, each SPARQL query is rep­re­sent­ed as RDF with var­i­ous struc­tur­al and data-dri­ven fea­tures attached. In this paper, we present the LSQ Java frame­work for cre­at­ing rich knowl­edge graphs from SPARQL query logs. The frame­work is able to RDFize SPARQL query logs, which are avail­able in dif­fer­ent for­mats, in a scal­able way. Fur­ther­more, the frame­work offers a set of sta­t­ic and dynam­ic enrich­ers. Sta­t­ic enrich­ers derive infor­ma­tion from the queries, such as their num­ber of basic graph pat­terns and pro­ject­ed vari­ables or even a full SPIN mod­el. Dynam­ic enrich­ment involves addi­tion­al resources. For instance, the bench­mark enrich­er exe­cutes queries against a SPARQL end­point and col­lects query exe­cu­tion times and result set sizes. This frame­work has already been used to con­vert query logs of 27 pub­lic SPARQL end­points, rep­re­sent­ing 43.95 mil­lion exe­cu­tions of 11.56 mil­lion unique SPARQL queries. The LSQ queries have been used in many use cas­es such as bench­mark­ing based on real-world SPARQL queries, SPARQL adop­tion, caching, query opti­miza­tion, use­abil­i­ty analy­sis, and meta-query­ing. Real­iza­tion of LSQ required devis­ing nov­el soft­ware com­po­nents to (a) improve scal­a­bil­i­ty of RDF data pro­cess­ing with the Apache Spark Big Data frame­work and (b) ease oper­a­tions of com­plex RDF data mod­els such as con­trolled skolem­iza­tion. Fol­low­ing the spir­it of Open­Source soft­ware devel­op­ment and the “don’t repeat your­self” (DRY) par­a­digm, the work on the LSQ frame­work also result­ed in con­tri­bu­tions to Apache Jena in order to make these improve­ments read­i­ly avail­able out­side of the LSQ con­text.},
  author = {Stadler, Claus and Saleem, Muham­mad and Ngo­mo, Axel-Cyrille Ngonga},
  book­ti­tle = {6th Work­shop on Stor­ing, Query­ing and Bench­mark­ing Knowl­edge Graphs @ ISWC 2022},
  key­words = {sys:relevantFor:infai},
  series = {{CEUR} Work­shop Pro­ceed­ings},
  title = {{LSQ} Frame­work: The {LSQ} Frame­work for {SPARQL} Query Log Pro­cess­ing},
  vol­ume = 3279,
  year = 2022
  }
  

  %0 Con­fer­ence Paper
  %1 stadler2022-lsq-frame­work
  %A Stadler, Claus
  %A Saleem, Muham­mad
  %A Ngo­mo, Axel-Cyrille Ngonga
  %B 6th Work­shop on Stor­ing, Query­ing and Bench­mark­ing Knowl­edge Graphs @ ISWC 2022
  %D 2022
  %T {LSQ} Frame­work: The {LSQ} Frame­work for {SPARQL} Query Log Pro­cess­ing
  %U https://ceur-ws.org/Vol-3279/paper4.pdf
  %V 3279
  %X The Linked SPARQL Queries (LSQ) datasets con­tain real-world SPARQL queries col­lect­ed from the query logs of the pub­licly avail­able SPARQL end­points. In LSQ, each SPARQL query is rep­re­sent­ed as RDF with var­i­ous struc­tur­al and data-dri­ven fea­tures attached. In this paper, we present the LSQ Java frame­work for cre­at­ing rich knowl­edge graphs from SPARQL query logs. The frame­work is able to RDFize SPARQL query logs, which are avail­able in dif­fer­ent for­mats, in a scal­able way. Fur­ther­more, the frame­work offers a set of sta­t­ic and dynam­ic enrich­ers. Sta­t­ic enrich­ers derive infor­ma­tion from the queries, such as their num­ber of basic graph pat­terns and pro­ject­ed vari­ables or even a full SPIN mod­el. Dynam­ic enrich­ment involves addi­tion­al resources. For instance, the bench­mark enrich­er exe­cutes queries against a SPARQL end­point and col­lects query exe­cu­tion times and result set sizes. This frame­work has already been used to con­vert query logs of 27 pub­lic SPARQL end­points, rep­re­sent­ing 43.95 mil­lion exe­cu­tions of 11.56 mil­lion unique SPARQL queries. The LSQ queries have been used in many use cas­es such as bench­mark­ing based on real-world SPARQL queries, SPARQL adop­tion, caching, query opti­miza­tion, use­abil­i­ty analy­sis, and meta-query­ing. Real­iza­tion of LSQ required devis­ing nov­el soft­ware com­po­nents to (a) improve scal­a­bil­i­ty of RDF data pro­cess­ing with the Apache Spark Big Data frame­work and (b) ease oper­a­tions of com­plex RDF data mod­els such as con­trolled skolem­iza­tion. Fol­low­ing the spir­it of Open­Source soft­ware devel­op­ment and the “don’t repeat your­self” (DRY) par­a­digm, the work on the LSQ frame­work also result­ed in con­tri­bu­tions to Apache Jena in order to make these improve­ments read­i­ly avail­able out­side of the LSQ context.
  

• Ontoflow: A User-Friend­ly Ontol­ogy Devel­op­ment Work­flowIn: Pro­ceed­ings of Inter­na­tion­al Work­shop on Seman­tic Indus­tri­al Infor­ma­tion Mod­el­ling (SemI­IM) @ ESWC22Gor­dian Dzi­wis, Lisa Wenige, Lars-Peter Mey­er and Michael Martin

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{Dziwis2022OntoflowUserFriendly,
  author = {Dzi­wis, Gor­dian and Wenige, Lisa and Mey­er, Lars-Peter and Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of Inter­na­tion­al Work­shop on Seman­tic Indus­tri­al Infor­ma­tion Mod­el­ling (SemI­IM) @ ESWC22},
  key­words = {sys:relevantFor:infai},
  title = {Ontoflow: A User-Friend­ly Ontol­ogy Devel­op­ment Work­flow},
  year = 2022
  }
  

  %0 Con­fer­ence Paper
  %1 Dziwis2022OntoflowUserFriendly
  %A Dzi­wis, Gor­dian
  %A Wenige, Lisa
  %A Mey­er, Lars-Peter
  %A Mar­tin, Michael
  %B Pro­ceed­ings of Inter­na­tion­al Work­shop on Seman­tic Indus­tri­al Infor­ma­tion Mod­el­ling (SemI­IM) @ ESWC22
  %D 2022
  %T Ontoflow: A User-Friend­ly Ontol­ogy Devel­op­ment Work­flow
  %U https://ceur-ws.org/Vol-3355/ontoflow.pdf
  

2021

• A Visu­al SHACL Shapes Edi­tor Based On OntoPadIn: Joint Pro­ceed­ings of the Seman­tics co-locat­ed events: Poster\&Demo track and Work­shop on Ontol­ogy-Dri­ven Con­cep­tu­al Mod­el­ling of Dig­i­tal Twins co-locat­ed with Seman­tics 2021, Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings. Ams­ter­dam, Nether­landsNatanael Arndt, André Valdes­til­has, Gus­ta­vo Pub­lio, Andrea Cim­mi­no, Kon­rad Höffn­er and Thomas Riechert

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  On the Seman­tic Web, vocab­u­lar­ies and ontolo­gies play a fun­da­men­tal role to express the ter­mi­nol­o­gy and rules of cer­tain domains. New tech­nolo­gies like SHACL pro­vide the pos­si­bil­i­ty to express data schema­ta spe­cif­ic to cer­tain data sets, appli­ca­tions, and domains. How­ev­er, the domain mod­el­ing process is col­lab­o­ra­tive and when using RDF, it requires tech­ni­cal knowl­edge. In this paper, we present a tool to sup­port a two-step-process to mod­el a ter­mi­nol­o­gy and a schema with a com­bined graph­i­cal RDF Schema edi­tor and visu­al SHACL edi­tor. This tool allows domain experts to cre­ate a ter­mi­nol­o­gy and schema with­out the need for a deep under­stand­ing of RDF Schema or SHACL.

  @inproceedings{arndt-n-2021–shacl,
  abstract = {On the Seman­tic Web, vocab­u­lar­ies and ontolo­gies play a fun­da­men­tal role to express the ter­mi­nol­o­gy and rules of cer­tain domains. New tech­nolo­gies like SHACL pro­vide the pos­si­bil­i­ty to express data schema­ta spe­cif­ic to cer­tain data sets, appli­ca­tions, and domains. How­ev­er, the domain mod­el­ing process is col­lab­o­ra­tive and when using RDF, it requires tech­ni­cal knowl­edge. In this paper, we present a tool to sup­port a two-step-process to mod­el a ter­mi­nol­o­gy and a schema with a com­bined graph­i­cal RDF Schema edi­tor and visu­al SHACL edi­tor. This tool allows domain experts to cre­ate a ter­mi­nol­o­gy and schema with­out the need for a deep under­stand­ing of RDF Schema or SHACL.},
  address = {Ams­ter­dam, Nether­lands},
  author = {Arndt, Natanael and Valdes­til­has, André and Pub­lio, Gus­ta­vo and Cim­mi­no, Andrea and Höffn­er, Kon­rad and Riechert, Thomas},
  book­ti­tle = {Joint Pro­ceed­ings of the Seman­tics co-locat­ed events: Poster\&Demo track and Work­shop on Ontol­ogy-Dri­ven Con­cep­tu­al Mod­el­ling of Dig­i­tal Twins co-locat­ed with Seman­tics 2021},
  key­words = {es},
  month = {09},
  series = {Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings},
  title = {A Visu­al SHACL Shapes Edi­tor Based On OntoPad},
  year = 2021
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2021–shacl
  %A Arndt, Natanael
  %A Valdes­til­has, André
  %A Pub­lio, Gus­ta­vo
  %A Cim­mi­no, Andrea
  %A Höffn­er, Kon­rad
  %A Riechert, Thomas
  %B Joint Pro­ceed­ings of the Seman­tics co-locat­ed events: Poster\&Demo track and Work­shop on Ontol­ogy-Dri­ven Con­cep­tu­al Mod­el­ling of Dig­i­tal Twins co-locat­ed with Seman­tics 2021
  %C Ams­ter­dam, Nether­lands
  %D 2021
  %T A Visu­al SHACL Shapes Edi­tor Based On OntoPad
  %U http://ceur-ws.org/Vol-2941/paper16.pdf
  %X On the Seman­tic Web, vocab­u­lar­ies and ontolo­gies play a fun­da­men­tal role to express the ter­mi­nol­o­gy and rules of cer­tain domains. New tech­nolo­gies like SHACL pro­vide the pos­si­bil­i­ty to express data schema­ta spe­cif­ic to cer­tain data sets, appli­ca­tions, and domains. How­ev­er, the domain mod­el­ing process is col­lab­o­ra­tive and when using RDF, it requires tech­ni­cal knowl­edge. In this paper, we present a tool to sup­port a two-step-process to mod­el a ter­mi­nol­o­gy and a schema with a com­bined graph­i­cal RDF Schema edi­tor and visu­al SHACL edi­tor. This tool allows domain experts to cre­ate a ter­mi­nol­o­gy and schema with­out the need for a deep under­stand­ing of RDF Schema or SHACL.
  

• Open Data and the Sta­tus Quo — A Fine-Grained Eval­u­a­tion Frame­work for Open Data Qual­i­ty and an Analy­sis of Open Data por­tals in Ger­manyIn: Lisa Wenige, Claus Stadler, Michael Mar­tin, Richard Figu­ra, Robert Sauter and Christo­pher W. Frank

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{wenige2021open,
  author = {Wenige, Lisa and Stadler, Claus and Mar­tin, Michael and Figu­ra, Richard and Sauter, Robert and Frank, Christo­pher W.},
  key­words = {sys:relevantFor:infai},
  title = {Open Data and the Sta­tus Quo — A Fine-Grained Eval­u­a­tion Frame­work for Open Data Qual­i­ty and an Analy­sis of Open Data por­tals in Ger­many},
  year = 2021
  }
  

  %0 Con­fer­ence Paper
  %1 wenige2021open
  %A Wenige, Lisa
  %A Stadler, Claus
  %A Mar­tin, Michael
  %A Figu­ra, Richard
  %A Sauter, Robert
  %A Frank, Christo­pher W.
  %D 2021
  %T Open Data and the Sta­tus Quo — A Fine-Grained Eval­u­a­tion Frame­work for Open Data Qual­i­ty and an Analy­sis of Open Data por­tals in Ger­many
  %U https://arxiv.org/pdf/2106.09590.pdf
  

• Towards the next gen­er­a­tion of the Linked­Ge­o­Da­ta project using vir­tu­al knowl­edge graphsIn: Jour­nal of Web Seman­tics vol. 71, p. 100662Lin­fang Ding, Guo­hui Xiao, Albulen Pano, Claus Stadler and Diego Calvanese

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  With the advance­ment of Seman­tic Tech­nolo­gies, large geospa­tial data sources have been increas­ing­ly pub­lished as Linked data on the Web. The Linked­Ge­o­Da­ta project is one of the most promi­nent such projects to cre­ate a large knowl­edge graph from Open­StreetMap (OSM) with glob­al cov­er­age and inter­link­ing of oth­er data sources. In this paper, we report on the ongo­ing effort of expos­ing the rela­tion­al data­base in Linked­Ge­o­Da­ta as a SPARQL end­point using Vir­tu­al Knowl­edge Graph (VKG) tech­nol­o­gy. Specif­i­cal­ly, we present two real­iza­tions of VKGs, using the two sys­tems Spar­qli­fy and Ontop. In order to improve com­pli­ance with the OGC GeoSPAR­QL stan­dard, we have imple­ment­ed GeoSPAR­QL sup­port in Ontop v4. More­over, we have eval­u­at­ed the VKG-pow­ered Linked­Ge­o­Da­ta in the test areas of Italy and Ger­many. Our exper­i­ments demon­strate that such sys­tem sup­ports com­plex GeoSPAR­QL queries, which con­firms that query answer­ing in the VKG approach is efficient.

  @article{Ding2021,
  abstract = {With the advance­ment of Seman­tic Tech­nolo­gies, large geospa­tial data sources have been increas­ing­ly pub­lished as Linked data on the Web. The Linked­Ge­o­Da­ta project is one of the most promi­nent such projects to cre­ate a large knowl­edge graph from Open­StreetMap (OSM) with glob­al cov­er­age and inter­link­ing of oth­er data sources. In this paper, we report on the ongo­ing effort of expos­ing the rela­tion­al data­base in Linked­Ge­o­Da­ta as a SPARQL end­point using Vir­tu­al Knowl­edge Graph (VKG) tech­nol­o­gy. Specif­i­cal­ly, we present two real­iza­tions of VKGs, using the two sys­tems Spar­qli­fy and Ontop. In order to improve com­pli­ance with the OGC GeoSPAR­QL stan­dard, we have imple­ment­ed GeoSPAR­QL sup­port in Ontop v4. More­over, we have eval­u­at­ed the VKG-pow­ered Linked­Ge­o­Da­ta in the test areas of Italy and Ger­many. Our exper­i­ments demon­strate that such sys­tem sup­ports com­plex GeoSPAR­QL queries, which con­firms that query answer­ing in the VKG approach is effi­cient.},
  author = {Ding, Lin­fang and Xiao, Guo­hui and Pano, Albulen and Stadler, Claus and Cal­vanese, Diego},
  jour­nal = {Jour­nal of Web Seman­tics},
  key­words = {sys:relevantFor:infai},
  pages = 100662,
  title = {Towards the next gen­er­a­tion of the Linked­Ge­o­Da­ta project using vir­tu­al knowl­edge graphs},
  vol­ume = 71,
  year = 2021
  }
  

  %0 Jour­nal Arti­cle
  %1 Ding2021
  %A Ding, Lin­fang
  %A Xiao, Guo­hui
  %A Pano, Albulen
  %A Stadler, Claus
  %A Cal­vanese, Diego
  %D 2021
  %J Jour­nal of Web Seman­tics
  %P 100662
  %R https://doi.org/10.1016/j.websem.2021.100662
  %T Towards the next gen­er­a­tion of the Linked­Ge­o­Da­ta project using vir­tu­al knowl­edge graphs
  %U https://svn.aksw.org/papers/2023/JWS_LinkedGeoData_Ontop/public.pdf
  %V 71
  %X With the advance­ment of Seman­tic Tech­nolo­gies, large geospa­tial data sources have been increas­ing­ly pub­lished as Linked data on the Web. The Linked­Ge­o­Da­ta project is one of the most promi­nent such projects to cre­ate a large knowl­edge graph from Open­StreetMap (OSM) with glob­al cov­er­age and inter­link­ing of oth­er data sources. In this paper, we report on the ongo­ing effort of expos­ing the rela­tion­al data­base in Linked­Ge­o­Da­ta as a SPARQL end­point using Vir­tu­al Knowl­edge Graph (VKG) tech­nol­o­gy. Specif­i­cal­ly, we present two real­iza­tions of VKGs, using the two sys­tems Spar­qli­fy and Ontop. In order to improve com­pli­ance with the OGC GeoSPAR­QL stan­dard, we have imple­ment­ed GeoSPAR­QL sup­port in Ontop v4. More­over, we have eval­u­at­ed the VKG-pow­ered Linked­Ge­o­Da­ta in the test areas of Italy and Ger­many. Our exper­i­ments demon­strate that such sys­tem sup­ports com­plex GeoSPAR­QL queries, which con­firms that query answer­ing in the VKG approach is efficient.
  

2019

• Doc­tor­al Sym­po­sium on Research on Online Data­bas­es inHis­to­ry (RODBH 2019)In: Pro­ceed­ings of the Doc­tor­al Sym­po­sium on Research on Online Data­bas­es in His­to­ry co-locat­ed with 3rd Data for His­to­ry Work­shop. vol. 2532. Leipzig, Ger­many : CEURThomas Riechert, Francesco Beretta, George Brusek­er, Edgard Marx, Jen­nifer Blanke, Vin­cent Alamercery, Tra­cy Hoff­mann and Natanael Arndt

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  This edi­to­r­i­al pro­vides an intro­duc­tion to the field of research of the Doc­tor­al Sym­po­siu­mon Research on Online Data­bas­es in His­to­ry (RODBH 2019) which was col­lo­cat­ed with the 3rdData for His­to­ry work­shop. The work­shop series is sit­u­at­ed in the field of dig­i­tal human­i­ties and­tar­gets the inter­con­nec­tion of sub­jects of his­tor­i­cal research, knowl­edge engi­neer­ing, and infor­ma­tion­science. The com­mon inter­link of this dis­ci­plines is the use of research data, data man­age­ment, andall accom­pa­ny­ing activ­i­ties as well as the orga­ni­za­tion of col­lab­o­ra­tive com­mu­ni­ty processes.

  @inproceedings{riechert-t-2019–rodbh,
  abstract = {This edi­to­r­i­al pro­vides an intro­duc­tion to the field of research of the Doc­tor­al Sym­po­siu­mon Research on Online Data­bas­es in His­to­ry (RODBH 2019) which was col­lo­cat­ed with the 3rdData for His­to­ry work­shop. The work­shop series is sit­u­at­ed in the field of dig­i­tal human­i­ties and­tar­gets the inter­con­nec­tion of sub­jects of his­tor­i­cal research, knowl­edge engi­neer­ing, and infor­ma­tion­science. The com­mon inter­link of this dis­ci­plines is the use of research data, data man­age­ment, andall accom­pa­ny­ing activ­i­ties as well as the orga­ni­za­tion of col­lab­o­ra­tive com­mu­ni­ty process­es.},
  address = {Leipzig, Ger­many},
  author = {Riechert, Thomas and Beretta, Francesco and Brusek­er, George and Marx, Edgard and Blanke, Jen­nifer and Alamercery, Vin­cent and Hoff­mann, Tra­cy and Arndt, Natanael},
  book­ti­tle = {Pro­ceed­ings of the Doc­tor­al Sym­po­sium on Research on Online Data­bas­es in His­to­ry co-locat­ed with 3rd Data for His­to­ry Work­shop},
  key­words = {AIKE},
  month = {04},
  pub­lish­er = {CEUR},
  title = {Doc­tor­al Sym­po­sium on Research on Online Data­bas­es inHis­to­ry (RODBH 2019)},
  vol­ume = 2532,
  year = 2019
  }
  

  %0 Con­fer­ence Paper
  %1 riechert-t-2019–rodbh
  %A Riechert, Thomas
  %A Beretta, Francesco
  %A Brusek­er, George
  %A Marx, Edgard
  %A Blanke, Jen­nifer
  %A Alamercery, Vin­cent
  %A Hoff­mann, Tra­cy
  %A Arndt, Natanael
  %B Pro­ceed­ings of the Doc­tor­al Sym­po­sium on Research on Online Data­bas­es in His­to­ry co-locat­ed with 3rd Data for His­to­ry Work­shop
  %C Leipzig, Ger­many
  %D 2019
  %I CEUR
  %T Doc­tor­al Sym­po­sium on Research on Online Data­bas­es inHis­to­ry (RODBH 2019)
  %U https://svn.aksw.org/papers/2019/RODBH_editorial/public.pdf
  %V 2532
  %X This edi­to­r­i­al pro­vides an intro­duc­tion to the field of research of the Doc­tor­al Sym­po­siu­mon Research on Online Data­bas­es in His­to­ry (RODBH 2019) which was col­lo­cat­ed with the 3rdData for His­to­ry work­shop. The work­shop series is sit­u­at­ed in the field of dig­i­tal human­i­ties and­tar­gets the inter­con­nec­tion of sub­jects of his­tor­i­cal research, knowl­edge engi­neer­ing, and infor­ma­tion­science. The com­mon inter­link of this dis­ci­plines is the use of research data, data man­age­ment, andall accom­pa­ny­ing activ­i­ties as well as the orga­ni­za­tion of col­lab­o­ra­tive com­mu­ni­ty processes.
  

• ONTOLOGY-DRIVEN SERVICE INTEGRATION INTO WEB APPLICATIONS: A DECLARATIVE APPROACHIn: Pedro Isaías (ed.): IADIS Inter­na­tion­al Con­fer­ence WWW/Internet 2019 : ICWI, pp. 150–154Andreas Both; Didi­er Cher­ix; Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The major­i­ty of web appli­ca­tions nowa­days are data-dri­ven. How­ev­er, that does not mean that all data is avail­able while launch­ing the respec­tive appli­ca­tion. While con­sid­er­ing Web 2.0 appli­ca­tions, data is often fetched on-demand from remote web ser­vices, for exam­ple, after a loca­tion was pro­vid­ed, weath­er data could be fetched, and local news is loaded. This mashup approach is high­ly dynam­i­cal, i.e., based on the data input of the user, com­plete­ly dif­fer­ent exe­cu­tion paths might be per­formed. Cur­rent­ly, such work­flows are imple­ment­ed with­in the appli­ca­tion log­ic requir­ing high devel­op­ment effort and main­te­nance of the imple­ment­ed log­ic to pre­vent unin­ten­tion­al behav­ior. In this paper, we present a nov­el approach to inte­grate web ser­vices dynam­i­cal­ly, to decrease deploy­ment and main­te­nance costs and to enable the next gen­er­a­tion of inter­linked data web appli­ca­tions to enables appli­ca­tion archi­tects to (re)define the data inte­gra­tion in a descrip­tive way in an ontol­ogy, val­i­date the work­flows and define log­i­cal require­ments. How­ev­er, our approach is not just a design method but also a method for ad hoc inte­gra­tion of new ser­vices. Our approach has a sig­nif­i­cant impact on the effort for gen­er­at­ing and main­tain­ing dynam­ic applications.

  @inproceedings{Both2019,
  abstract = {The major­i­ty of web appli­ca­tions nowa­days are data-dri­ven. How­ev­er, that does not mean that all data is avail­able while launch­ing the respec­tive appli­ca­tion. While con­sid­er­ing Web 2.0 appli­ca­tions, data is often fetched on-demand from remote web ser­vices, for exam­ple, after a loca­tion was pro­vid­ed, weath­er data could be fetched, and local news is loaded. This mashup approach is high­ly dynam­i­cal, i.e., based on the data input of the user, com­plete­ly dif­fer­ent exe­cu­tion paths might be per­formed. Cur­rent­ly, such work­flows are imple­ment­ed with­in the appli­ca­tion log­ic requir­ing high devel­op­ment effort and main­te­nance of the imple­ment­ed log­ic to pre­vent unin­ten­tion­al behav­ior. In this paper, we present a nov­el approach to inte­grate web ser­vices dynam­i­cal­ly, to decrease deploy­ment and main­te­nance costs and to enable the next gen­er­a­tion of inter­linked data web appli­ca­tions to enables appli­ca­tion archi­tects to (re)define the data inte­gra­tion in a descrip­tive way in an ontol­ogy, val­i­date the work­flows and define log­i­cal require­ments. How­ev­er, our approach is not just a design method but also a method for ad hoc inte­gra­tion of new ser­vices. Our approach has a sig­nif­i­cant impact on the effort for gen­er­at­ing and main­tain­ing dynam­ic appli­ca­tions.},
  author = {Mar­tin, Andreas Both; Didi­er Cher­ix; Michael},
  book­ti­tle = {IADIS Inter­na­tion­al Con­fer­ence WWW/Internet 2019},
  edi­tor = {Isaías, Pedro},
  key­words = {es},
  orga­ni­za­tion = {ICWI},
  pages = {150 — 154},
  title = {ONTOLOGY-DRIVEN SERVICE INTEGRATION INTO WEB APPLICATIONS: A DECLARATIVE APPROACH},
  year = 2019
  }
  

  %0 Con­fer­ence Paper
  %1 Both2019
  %A Mar­tin, Andreas Both; Didi­er Cher­ix; Michael
  %B IADIS Inter­na­tion­al Con­fer­ence WWW/Internet 2019
  %D 2019
  %E Isaías, Pedro
  %P 150 — 154
  %R 10.33965/icwi2019_201913C020
  %T ONTOLOGY-DRIVEN SERVICE INTEGRATION INTO WEB APPLICATIONS: A DECLARATIVE APPROACH
  %U http://www.iadisportal.org/digital-library/ontology-driven-service-integration-into-web-applications-a-declarative-approach
  %X The major­i­ty of web appli­ca­tions nowa­days are data-dri­ven. How­ev­er, that does not mean that all data is avail­able while launch­ing the respec­tive appli­ca­tion. While con­sid­er­ing Web 2.0 appli­ca­tions, data is often fetched on-demand from remote web ser­vices, for exam­ple, after a loca­tion was pro­vid­ed, weath­er data could be fetched, and local news is loaded. This mashup approach is high­ly dynam­i­cal, i.e., based on the data input of the user, com­plete­ly dif­fer­ent exe­cu­tion paths might be per­formed. Cur­rent­ly, such work­flows are imple­ment­ed with­in the appli­ca­tion log­ic requir­ing high devel­op­ment effort and main­te­nance of the imple­ment­ed log­ic to pre­vent unin­ten­tion­al behav­ior. In this paper, we present a nov­el approach to inte­grate web ser­vices dynam­i­cal­ly, to decrease deploy­ment and main­te­nance costs and to enable the next gen­er­a­tion of inter­linked data web appli­ca­tions to enables appli­ca­tion archi­tects to (re)define the data inte­gra­tion in a descrip­tive way in an ontol­ogy, val­i­date the work­flows and define log­i­cal require­ments. How­ev­er, our approach is not just a design method but also a method for ad hoc inte­gra­tion of new ser­vices. Our approach has a sig­nif­i­cant impact on the effort for gen­er­at­ing and main­tain­ing dynam­ic applications.
  

• Smarte Dat­en im Knowl­edge Graph, die Grund­lage ein­er zukun­ftssicheren Bere­it­stel­lung Offen­er Dat­enRichard Figu­ra, Alexan­der Will­ner and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Offene Dat­en sind ein­er der wichtig­sten Rohstoffe der dig­i­tal­en Welt, mit wach­sender wirtschaftlich­er und gesellschaftlich­er Bedeu­tung. Trotz zahlre­ich­er Bemühun­gen kon­nten prog­nos­tizierte Mehrw­erte noch nicht erre­icht wer­den, was unter anderem auf eine unvoll­ständi­ge Ver­net­zung der Dat­en zurück­zuführen ist. In diesem Vor­trag wer­den Tech­nolo­gien und Prozesse vorgestellt, um Dat­en zu einem öffentlichen ver­füg­baren Knowl­edge Graph hinzuzufü­gen und dort mit Dat­en ander­er Quellen zu verknüpfen.

  @misc{martin-2019-fossgis,
  abstract = {Offene Dat­en sind ein­er der wichtig­sten Rohstoffe der dig­i­tal­en Welt, mit wach­sender wirtschaftlich­er und gesellschaftlich­er Bedeu­tung. Trotz zahlre­ich­er Bemühun­gen kon­nten prog­nos­tizierte Mehrw­erte noch nicht erre­icht wer­den, was unter anderem auf eine unvoll­ständi­ge Ver­net­zung der Dat­en zurück­zuführen ist. In diesem Vor­trag wer­den Tech­nolo­gien und Prozesse vorgestellt, um Dat­en zu einem öffentlichen ver­füg­baren Knowl­edge Graph hinzuzufü­gen und dort mit Dat­en ander­er Quellen zu verknüpfen.},
  author = {Figu­ra, Richard and Will­ner, Alexan­der and Mar­tin, Michael},
  key­words = {sys:relevantFor:infai},
  title = {Smarte Dat­en im Knowl­edge Graph, die Grund­lage ein­er zukun­ftssicheren Bere­it­stel­lung Offen­er Dat­en},
  year = 2019
  }
  

  %0 Gener­ic
  %1 mar­tin-2019-fos­s­gis
  %A Figu­ra, Richard
  %A Will­ner, Alexan­der
  %A Mar­tin, Michael
  %D 2019
  %T Smarte Dat­en im Knowl­edge Graph, die Grund­lage ein­er zukun­ftssicheren Bere­it­stel­lung Offen­er Dat­en
  %U https://www.fossgis-konferenz.de/2019/
  %X Offene Dat­en sind ein­er der wichtig­sten Rohstoffe der dig­i­tal­en Welt, mit wach­sender wirtschaftlich­er und gesellschaftlich­er Bedeu­tung. Trotz zahlre­ich­er Bemühun­gen kon­nten prog­nos­tizierte Mehrw­erte noch nicht erre­icht wer­den, was unter anderem auf eine unvoll­ständi­ge Ver­net­zung der Dat­en zurück­zuführen ist. In diesem Vor­trag wer­den Tech­nolo­gien und Prozesse vorgestellt, um Dat­en zu einem öffentlichen ver­füg­baren Knowl­edge Graph hinzuzufü­gen und dort mit Dat­en ander­er Quellen zu verknüpfen.
  

• Con­flict Detec­tion, Avoid­ance, and Res­o­lu­tion in a Non-Lin­ear RDF Ver­sion Con­trol Sys­tem: The Quit Edi­tor Inter­face Con­cur­ren­cy Con­trolIn: Com­pan­ion Pro­ceed­ings of the 2019 World Wide Web Con­fer­ence (WWW ’19 Com­pan­ion). San Fran­cis­co, CA, USANatanael Arndt and Nor­man Radtke

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{arndt-n-2019–qeicc,
  address = {San Fran­cis­co, CA, USA},
  author = {Arndt, Natanael and Radtke, Nor­man},
  book­ti­tle = {Com­pan­ion Pro­ceed­ings of the 2019 World Wide Web Con­fer­ence (WWW ’19 Com­pan­ion)},
  key­words = {quit},
  month = {05},
  title = {Con­flict Detec­tion, Avoid­ance, and Res­o­lu­tion in a Non-Lin­ear RDF Ver­sion Con­trol Sys­tem: The Quit Edi­tor Inter­face Con­cur­ren­cy Con­trol},
  year = 2019
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2019–qeicc
  %A Arndt, Natanael
  %A Radtke, Nor­man
  %B Com­pan­ion Pro­ceed­ings of the 2019 World Wide Web Con­fer­ence (WWW ’19 Com­pan­ion)
  %C San Fran­cis­co, CA, USA
  %D 2019
  %R 10.1145/3308560.3316519
  %T Con­flict Detec­tion, Avoid­ance, and Res­o­lu­tion in a Non-Lin­ear RDF Ver­sion Con­trol Sys­tem: The Quit Edi­tor Inter­face Con­cur­ren­cy Con­trol
  %U https://svn.aksw.org/papers/2019/MEPDaW_QEICC/public.pdf
  

• Decen­tral­ized Col­lab­o­ra­tive Knowl­edge Man­age­ment using Git (Extend­ed Abstract)In: Com­pan­ion Pro­ceed­ings of the 2019 World Wide Web Con­fer­ence (WWW ’19 Com­pan­ion). San Fran­cis­co, CA, USANatanael Arndt and Michael Martin

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{arndt-n-2019–collaborative,
  address = {San Fran­cis­co, CA, USA},
  author = {Arndt, Natanael and Mar­tin, Michael},
  book­ti­tle = {Com­pan­ion Pro­ceed­ings of the 2019 World Wide Web Con­fer­ence (WWW ’19 Com­pan­ion)},
  key­words = {quit},
  month = {05},
  title = {Decen­tral­ized Col­lab­o­ra­tive Knowl­edge Man­age­ment using Git (Extend­ed Abstract)},
  year = 2019
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2019–collaborative
  %A Arndt, Natanael
  %A Mar­tin, Michael
  %B Com­pan­ion Pro­ceed­ings of the 2019 World Wide Web Con­fer­ence (WWW ’19 Com­pan­ion)
  %C San Fran­cis­co, CA, USA
  %D 2019
  %R 10.1145/3308560.3316523
  %T Decen­tral­ized Col­lab­o­ra­tive Knowl­edge Man­age­ment using Git (Extend­ed Abstract)
  %U https://natanael.arndt.xyz/bib/arndt-n-2019–collaborative
  

• Jekyll RDF: Tem­plate-Based Linked Data Pub­li­ca­tion with Min­i­mized Effort and Max­i­mum Scal­a­bil­i­tyIn: 19th Inter­na­tion­al Con­fer­ence on Web Engi­neer­ing (ICWE 2019), ICWE 2019. Dae­jeon, KoreaNatanael Arndt, Sebas­t­ian Zänker, Gez­im Sejdiu and Sebas­t­ian Tramp

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Over the last decades the Web has evolved from a human–human com­mu­ni­ca­tion net­work to a net­work of com­plex human–machine inter­ac­tions. An increas­ing amount of data is avail­able as Linked Data which allows machines to “under­stand” the data, but RDF is not meant to be under­stood by humans. With Jekyll RDF we present a method to close the gap between struc­tured data and human acces­si­ble explo­ration inter­faces by pub­lish­ing RDF datasets as cus­tomiz­able sta­t­ic HTML sites. It con­sists of an RDF resource map­ping sys­tem to serve the resources under their respec­tive IRI, a tem­plate map­ping based on schema class­es, and a markup lan­guage to define tem­plates to ren­der cus­tomized resource pages. Using the tem­plate sys­tem, it is pos­si­ble to cre­ate domain spe­cif­ic brows­ing inter­faces for RDF data next to the Linked Data resources. This enables con­tent man­age­ment and knowl­edge man­age­ment sys­tems to serve datasets in a high­ly cus­tomiz­able, low effort, and scal­able way to be con­sumed by machines as well as humans.

  @inproceedings{arndt-n-2019–jekyll-rdf,
  abstract = {Over the last decades the Web has evolved from a human–human com­mu­ni­ca­tion net­work to a net­work of com­plex human–machine inter­ac­tions. An increas­ing amount of data is avail­able as Linked Data which allows machines to “under­stand” the data, but RDF is not meant to be under­stood by humans. With Jekyll RDF we present a method to close the gap between struc­tured data and human acces­si­ble explo­ration inter­faces by pub­lish­ing RDF datasets as cus­tomiz­able sta­t­ic HTML sites. It con­sists of an RDF resource map­ping sys­tem to serve the resources under their respec­tive IRI, a tem­plate map­ping based on schema class­es, and a markup lan­guage to define tem­plates to ren­der cus­tomized resource pages. Using the tem­plate sys­tem, it is pos­si­ble to cre­ate domain spe­cif­ic brows­ing inter­faces for RDF data next to the Linked Data resources. This enables con­tent man­age­ment and knowl­edge man­age­ment sys­tems to serve datasets in a high­ly cus­tomiz­able, low effort, and scal­able way to be con­sumed by machines as well as humans.},
  address = {Dae­jeon, Korea},
  author = {Arndt, Natanael and Zänker, Sebas­t­ian and Sejdiu, Gez­im and Tramp, Sebas­t­ian},
  book­ti­tle = {19th Inter­na­tion­al Con­fer­ence on Web Engi­neer­ing (ICWE 2019)},
  key­words = {es},
  month = {06},
  series = {ICWE 2019},
  title = {Jekyll RDF: Tem­plate-Based Linked Data Pub­li­ca­tion with Min­i­mized Effort and Max­i­mum Scal­a­bil­i­ty},
  year = 2019
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2019–jekyll-rdf
  %A Arndt, Natanael
  %A Zänker, Sebas­t­ian
  %A Sejdiu, Gez­im
  %A Tramp, Sebas­t­ian
  %B 19th Inter­na­tion­al Con­fer­ence on Web Engi­neer­ing (ICWE 2019)
  %C Dae­jeon, Korea
  %D 2019
  %R 10.1007/978–3‑030–19274-7_24
  %T Jekyll RDF: Tem­plate-Based Linked Data Pub­li­ca­tion with Min­i­mized Effort and Max­i­mum Scal­a­bil­i­ty
  %U https://svn.aksw.org/papers/2019/ICWE_JekyllRDF/public.pdf
  %X Over the last decades the Web has evolved from a human–human com­mu­ni­ca­tion net­work to a net­work of com­plex human–machine inter­ac­tions. An increas­ing amount of data is avail­able as Linked Data which allows machines to “under­stand” the data, but RDF is not meant to be under­stood by humans. With Jekyll RDF we present a method to close the gap between struc­tured data and human acces­si­ble explo­ration inter­faces by pub­lish­ing RDF datasets as cus­tomiz­able sta­t­ic HTML sites. It con­sists of an RDF resource map­ping sys­tem to serve the resources under their respec­tive IRI, a tem­plate map­ping based on schema class­es, and a markup lan­guage to define tem­plates to ren­der cus­tomized resource pages. Using the tem­plate sys­tem, it is pos­si­ble to cre­ate domain spe­cif­ic brows­ing inter­faces for RDF data next to the Linked Data resources. This enables con­tent man­age­ment and knowl­edge man­age­ment sys­tems to serve datasets in a high­ly cus­tomiz­able, low effort, and scal­able way to be con­sumed by machines as well as humans.
  

• Ein Plat­tform-Ökosys­tem für Pre­dic­tive Main­te­nance zur Erhöhung der Effizienz und Effek­tiv­ität der Instand­hal­tung in kleinen und mit­tleren Unternehmen (KMU)In: Die hybride Fab­rik — men­schliche und kün­stliche Intel­li­genz im Ein­klang: Fach­ta­gung Ber­net­zt pla­nen und pro­duzieren VPP2019, Wis­senschaftliche Schriften­rei­he des Insti­tutes für Betrieb­swis­senschaften und Fab­riksys­teme. Chem­nitz, Ger­manyMatthias Nagel, Natanael Arndt, Fabi­an Förster, Matthes Nagel and Ralph Riedel

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Dat­en spie­len im mod­er­nen wirtschaftlichen Han­deln eine immer größere Rolle. Jedoch bleibt der Wert der Dat­en durch den Verbleib beim Eigen­tümer oft ungenutzt. IIoT und Indus­trie 4.0 Ange­bote von großen Tech­nolo­giekonz­er­nen wer­den jedoch nicht den Anforderun­gen und Bedenken von KMU in Hin­blick auf die Daten­sicher­heit und die damit ver­bun­dene Wahrung von Geschäfts­ge­heimnis­sen gerecht. Im vor­liegen­den Artikel wird der Mehrw­ert der ver­net­zten Nutzung von Maschi­nen­dat­en zur Ermöglichung von vorauss­chauen­der Instand­hal­tung auf ein­er Plat­tform gezeigt. Die Gewährleis­tung der Daten­sicher­heit spielt beim Entwurf der Plat­tform bere­its eine konzep­tionelle Rolle. Es wer­den ver­schiedene Arten der Analyse der Dat­en zur Vorher­sage von Aus­fällen vorgestellt. Der Artikel wird durch eine Betra­ch­tung zur wirtschaftlichen Nutzung der Analy­seergeb­nisse abgeschlossen.

  @inproceedings{nagel-m-2019–predictive-maintenance‑,
  abstract = {Dat­en spie­len im mod­er­nen wirtschaftlichen Han­deln eine immer größere Rolle. Jedoch bleibt der Wert der Dat­en durch den Verbleib beim Eigen­tümer oft ungenutzt. IIoT und Indus­trie 4.0 Ange­bote von großen Tech­nolo­giekonz­er­nen wer­den jedoch nicht den Anforderun­gen und Bedenken von KMU in Hin­blick auf die Daten­sicher­heit und die damit ver­bun­dene Wahrung von Geschäfts­ge­heimnis­sen gerecht. Im vor­liegen­den Artikel wird der Mehrw­ert der ver­net­zten Nutzung von Maschi­nen­dat­en zur Ermöglichung von vorauss­chauen­der Instand­hal­tung auf ein­er Plat­tform gezeigt. Die Gewährleis­tung der Daten­sicher­heit spielt beim Entwurf der Plat­tform bere­its eine konzep­tionelle Rolle. Es wer­den ver­schiedene Arten der Analyse der Dat­en zur Vorher­sage von Aus­fällen vorgestellt. Der Artikel wird durch eine Betra­ch­tung zur wirtschaftlichen Nutzung der Analy­seergeb­nisse abgeschlossen.},
  address = {Chem­nitz, Ger­many},
  author = {Nagel, Matthias and Arndt, Natanael and Förster, Fabi­an and Nagel, Matthes and Riedel, Ralph},
  book­ti­tle = {Die hybride Fab­rik — men­schliche und kün­stliche Intel­li­genz im Ein­klang: Fach­ta­gung Ber­net­zt pla­nen und pro­duzieren VPP2019},
  key­words = {es},
  month = 11,
  num­ber = {Son­der­heft 25},
  series = {Wis­senschaftliche Schriften­rei­he des Insti­tutes für Betrieb­swis­senschaften und Fab­riksys­teme},
  title = {Ein Plat­tform-Ökosys­tem für Pre­dic­tive Main­te­nance zur Erhöhung der Effizienz und Effek­tiv­ität der Instand­hal­tung in kleinen und mit­tleren Unternehmen (KMU)},
  year = 2019
  }
  

  %0 Con­fer­ence Paper
  %1 nagel-m-2019–predictive-maintenance-
  %A Nagel, Matthias
  %A Arndt, Natanael
  %A Förster, Fabi­an
  %A Nagel, Matthes
  %A Riedel, Ralph
  %B Die hybride Fab­rik — men­schliche und kün­stliche Intel­li­genz im Ein­klang: Fach­ta­gung Ber­net­zt pla­nen und pro­duzieren VPP2019
  %C Chem­nitz, Ger­many
  %D 2019
  %N Son­der­heft 25
  %T Ein Plat­tform-Ökosys­tem für Pre­dic­tive Main­te­nance zur Erhöhung der Effizienz und Effek­tiv­ität der Instand­hal­tung in kleinen und mit­tleren Unternehmen (KMU)
  %U https://svn.aksw.org/papers/2019/VPP_PredictiveMaintenance/public.pdf
  %X Dat­en spie­len im mod­er­nen wirtschaftlichen Han­deln eine immer größere Rolle. Jedoch bleibt der Wert der Dat­en durch den Verbleib beim Eigen­tümer oft ungenutzt. IIoT und Indus­trie 4.0 Ange­bote von großen Tech­nolo­giekonz­er­nen wer­den jedoch nicht den Anforderun­gen und Bedenken von KMU in Hin­blick auf die Daten­sicher­heit und die damit ver­bun­dene Wahrung von Geschäfts­ge­heimnis­sen gerecht. Im vor­liegen­den Artikel wird der Mehrw­ert der ver­net­zten Nutzung von Maschi­nen­dat­en zur Ermöglichung von vorauss­chauen­der Instand­hal­tung auf ein­er Plat­tform gezeigt. Die Gewährleis­tung der Daten­sicher­heit spielt beim Entwurf der Plat­tform bere­its eine konzep­tionelle Rolle. Es wer­den ver­schiedene Arten der Analyse der Dat­en zur Vorher­sage von Aus­fällen vorgestellt. Der Artikel wird durch eine Betra­ch­tung zur wirtschaftlichen Nutzung der Analy­seergeb­nisse abgeschlossen.
  

2018

• A Decen­tral­ized and Remote Con­trolled Webi­nar Approach, Uti­liz­ing Client-side Capa­bil­i­ties: To Increase Par­tic­i­pant Lim­its and Reduce Oper­at­ing CostsIn: Pro­ceed­ings of the 14th Inter­na­tion­al Con­fer­ence on Web Infor­ma­tion Sys­tems and Tech­nolo­gies — Vol­ume 1: WEBIST. Seville, Spain : SciTePress — ISBN 978–989-758–324‑7, pp. 153–160Roy Meiss­ner, Kurt Jung­hanns and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  We present a con­cept and imple­men­ta­tion on increas­ing the effi­cien­cy of webi­nar soft­ware by a remote con­trol approach using the tech­nol­o­gy WebRTC. This tech­nol­o­gy enables strong secu­ri­ty and pri­va­cy, is cross-device usable, uses open-source tech­nol­o­gy and enables a new lev­el of inter­ac­tive­ness to webi­na­rs. We used SlideWi­ki, WebRTC, and brows­er speech to text engines to pro­vide inno­v­a­tive acces­si­bil­i­ty fea­tures like mul­ti­lin­gual pre­sen­ta­tions and live sub­ti­tles. Our solu­tion was rat­ed for real world usage aspects, test­ed with­in the SlideWi­ki project and we deter­mined tech­no­log­i­cal lim­its. Such mea­sure­ments are cur­rent­ly not avail­able and show that our approach out­per­forms open-source mar­ket com­peti­tors by effi­cien­cy and costs.

  @inproceedings{meissner-webist-slidewiki-presentation-rooms,
  abstract = {We present a con­cept and imple­men­ta­tion on increas­ing the effi­cien­cy of webi­nar soft­ware by a remote con­trol approach using the tech­nol­o­gy WebRTC. This tech­nol­o­gy enables strong secu­ri­ty and pri­va­cy, is cross-device usable, uses open-source tech­nol­o­gy and enables a new lev­el of inter­ac­tive­ness to webi­na­rs. We used SlideWi­ki, WebRTC, and brows­er speech to text engines to pro­vide inno­v­a­tive acces­si­bil­i­ty fea­tures like mul­ti­lin­gual pre­sen­ta­tions and live sub­ti­tles. Our solu­tion was rat­ed for real world usage aspects, test­ed with­in the SlideWi­ki project and we deter­mined tech­no­log­i­cal lim­its. Such mea­sure­ments are cur­rent­ly not avail­able and show that our approach out­per­forms open-source mar­ket com­peti­tors by effi­cien­cy and costs.},
  address = {Seville, Spain},
  author = {Meiss­ner, Roy and Jung­hanns, Kurt and Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of the 14th Inter­na­tion­al Con­fer­ence on Web Infor­ma­tion Sys­tems and Tech­nolo­gies — Vol­ume 1: WEBIST},
  key­words = {sys:relevantFor:infai},
  month = {09},
  pages = {153–160},
  pub­lish­er = {SciTePress},
  title = {A Decen­tral­ized and Remote Con­trolled Webi­nar Approach, Uti­liz­ing Client-side Capa­bil­i­ties: To Increase Par­tic­i­pant Lim­its and Reduce Oper­at­ing Costs},
  year = 2018
  }
  

  %0 Con­fer­ence Paper
  %1 meiss­ner-webist-slidewi­ki-pre­sen­ta­tion-rooms
  %A Meiss­ner, Roy
  %A Jung­hanns, Kurt
  %A Mar­tin, Michael
  %B Pro­ceed­ings of the 14th Inter­na­tion­al Con­fer­ence on Web Infor­ma­tion Sys­tems and Tech­nolo­gies — Vol­ume 1: WEBIST
  %C Seville, Spain
  %D 2018
  %I SciTePress
  %P 153–160
  %R 10.5220/0006923901530160
  %T A Decen­tral­ized and Remote Con­trolled Webi­nar Approach, Uti­liz­ing Client-side Capa­bil­i­ties: To Increase Par­tic­i­pant Lim­its and Reduce Oper­at­ing Costs
  %U https://svn.aksw.org/papers/2018/WEBIST_SlideWiki/public.pdf
  %X We present a con­cept and imple­men­ta­tion on increas­ing the effi­cien­cy of webi­nar soft­ware by a remote con­trol approach using the tech­nol­o­gy WebRTC. This tech­nol­o­gy enables strong secu­ri­ty and pri­va­cy, is cross-device usable, uses open-source tech­nol­o­gy and enables a new lev­el of inter­ac­tive­ness to webi­na­rs. We used SlideWi­ki, WebRTC, and brows­er speech to text engines to pro­vide inno­v­a­tive acces­si­bil­i­ty fea­tures like mul­ti­lin­gual pre­sen­ta­tions and live sub­ti­tles. Our solu­tion was rat­ed for real world usage aspects, test­ed with­in the SlideWi­ki project and we deter­mined tech­no­log­i­cal lim­its. Such mea­sure­ments are cur­rent­ly not avail­able and show that our approach out­per­forms open-source mar­ket com­peti­tors by effi­cien­cy and costs.
  %@ 978–989-758–324‑7
  

• Apply­ing Linked Data Par­a­digms for Rea­gion­al Weath­er Data Reanaly­sisIn: Inter­na­tion­al Sym­po­sium on Region­al Reanaly­sis (ISSR) 2018 (ed.) Richard Figu­ra, Alexan­der Will­ner and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Data is the new oil, this quote ascribed to Clive Hum­by most clear­ly describes the increas­ing impact of infor­ma­tion on our soci­ety and econ­o­my. More and more data sets from var­i­ous sources are pub­lished and used for dif­fer­ent kinds of appli­ca­tions. Atmos­pher­ic reanaly­sis rep­re­sents one of the rich­est and most valu­able data sets for the open source com­mu­ni­ty. How­ev­er, trans­form­ing it into valu­able infor­ma­tion and link­ing it to oth­er data sets is a chal­lenge, espe­cial­ly for users from non-mete­o­ro­log­i­cal domains. In this pre­sen­ta­tion, we dis­cuss the advan­tages of apply­ing Linked (Open) Data prin­ci­ples to mete­o­ro­log­i­cal data in order to improve data acqui­si­tion for region­al reanaly­sis (COSMO-REA2). By con­vert­ing a COSMO-REA2 sub­set and link­ing it to fur­ther con­vert­ed linked data, we illus­trate how to gain much more knowl­edge using this approach. Dif­fer­ent demon­strat­ed sce­nar­ios, such as infra­struc­ture plan­ning for wind farm­ing or trans­porta­tion under­line the advan­tage of this approach. Based on that, we argue that data in gen­er­al and mete­o­ro­log­i­cal data in par­tic­u­lar should be acces­si­ble by fol­low­ing the Linked Data paradigms.

  @misc{martin-2018‑b,
  abstract = {Data is the new oil, this quote ascribed to Clive Hum­by most clear­ly describes the increas­ing impact of infor­ma­tion on our soci­ety and econ­o­my. More and more data sets from var­i­ous sources are pub­lished and used for dif­fer­ent kinds of appli­ca­tions. Atmos­pher­ic reanaly­sis rep­re­sents one of the rich­est and most valu­able data sets for the open source com­mu­ni­ty. How­ev­er, trans­form­ing it into valu­able infor­ma­tion and link­ing it to oth­er data sets is a chal­lenge, espe­cial­ly for users from non-mete­o­ro­log­i­cal domains. In this pre­sen­ta­tion, we dis­cuss the advan­tages of apply­ing Linked (Open) Data prin­ci­ples to mete­o­ro­log­i­cal data in order to improve data acqui­si­tion for region­al reanaly­sis (COSMO-REA2). By con­vert­ing a COSMO-REA2 sub­set and link­ing it to fur­ther con­vert­ed linked data, we illus­trate how to gain much more knowl­edge using this approach. Dif­fer­ent demon­strat­ed sce­nar­ios, such as infra­struc­ture plan­ning for wind farm­ing or trans­porta­tion under­line the advan­tage of this approach. Based on that, we argue that data in gen­er­al and mete­o­ro­log­i­cal data in par­tic­u­lar should be acces­si­ble by fol­low­ing the Linked Data par­a­digms.},
  author = {Figu­ra, Richard and Will­ner, Alexan­der and Mar­tin, Michael},
  edi­tor = {on Region­al Reanaly­sis (ISSR) 2018, Inter­na­tion­al Sym­po­sium},
  key­words = {sys:relevantFor:infai},
  title = {Apply­ing Linked Data Par­a­digms for Rea­gion­al Weath­er Data Reanaly­sis},
  year = 2018
  }
  

  %0 Gener­ic
  %1 mar­tin-2018‑b
  %A Figu­ra, Richard
  %A Will­ner, Alexan­der
  %A Mar­tin, Michael
  %D 2018
  %E on Region­al Reanaly­sis (ISSR) 2018, Inter­na­tion­al Sym­po­sium
  %T Apply­ing Linked Data Par­a­digms for Rea­gion­al Weath­er Data Reanaly­sis
  %U https://www2.meteo.uni-bonn.de/isrr/index.php
  %X Data is the new oil, this quote ascribed to Clive Hum­by most clear­ly describes the increas­ing impact of infor­ma­tion on our soci­ety and econ­o­my. More and more data sets from var­i­ous sources are pub­lished and used for dif­fer­ent kinds of appli­ca­tions. Atmos­pher­ic reanaly­sis rep­re­sents one of the rich­est and most valu­able data sets for the open source com­mu­ni­ty. How­ev­er, trans­form­ing it into valu­able infor­ma­tion and link­ing it to oth­er data sets is a chal­lenge, espe­cial­ly for users from non-mete­o­ro­log­i­cal domains. In this pre­sen­ta­tion, we dis­cuss the advan­tages of apply­ing Linked (Open) Data prin­ci­ples to mete­o­ro­log­i­cal data in order to improve data acqui­si­tion for region­al reanaly­sis (COSMO-REA2). By con­vert­ing a COSMO-REA2 sub­set and link­ing it to fur­ther con­vert­ed linked data, we illus­trate how to gain much more knowl­edge using this approach. Dif­fer­ent demon­strat­ed sce­nar­ios, such as infra­struc­ture plan­ning for wind farm­ing or trans­porta­tion under­line the advan­tage of this approach. Based on that, we argue that data in gen­er­al and mete­o­ro­log­i­cal data in par­tic­u­lar should be acces­si­ble by fol­low­ing the Linked Data paradigms.
  

• Decen­tral­ized Col­lab­o­ra­tive Knowl­edge Man­age­ment using GitIn: Jour­nal of Web Seman­ticsNatanael Arndt, Patrick Nau­mann, Nor­man Radtke, Michael Mar­tin and Edgard Marx

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The World Wide Web and the Seman­tic Web are designed as a net­work of dis­trib­uted ser­vices and datasets. The dis­trib­uted char­ac­ter of the Web brings man­i­fold col­lab­o­ra­tive pos­si­bil­i­ties to inter­change data. The com­mon­ly adopt­ed col­lab­o­ra­tive solu­tions for RDF data are cen­tral­ized (e.g. SPARQL end­points and wiki sys­tems). But to sup­port dis­trib­uted col­lab­o­ra­tion, a sys­tem is need­ed, that sup­ports diver­gence of datasets, brings the pos­si­bil­i­ty to con­flate diverged states, and allows dis­trib­uted datasets to be syn­chro­nized. In this paper, we present Quit Store, it was inspired by and it builds upon the suc­cess­ful Git sys­tem. The approach is based on a for­mal expres­sion of evo­lu­tion and con­sol­i­da­tion of dis­trib­uted datasets. Dur­ing the col­lab­o­ra­tive cura­tion process, the sys­tem auto­mat­i­cal­ly ver­sions the RDF dataset and tracks prove­nance infor­ma­tion. It also pro­vides sup­port to branch, merge, and syn­chro­nize dis­trib­uted RDF datasets. The merg­ing process is guard­ed by spe­cif­ic merge strate­gies for RDF data. Final­ly, we use our ref­er­ence imple­men­ta­tion to show over­all good per­for­mance and demon­strate the prac­ti­cal usabil­i­ty of the system.

  @article{arndt-n-2018–jws,
  abstract = {The World Wide Web and the Seman­tic Web are designed as a net­work of dis­trib­uted ser­vices and datasets. The dis­trib­uted char­ac­ter of the Web brings man­i­fold col­lab­o­ra­tive pos­si­bil­i­ties to inter­change data. The com­mon­ly adopt­ed col­lab­o­ra­tive solu­tions for RDF data are cen­tral­ized (e.g. SPARQL end­points and wiki sys­tems). But to sup­port dis­trib­uted col­lab­o­ra­tion, a sys­tem is need­ed, that sup­ports diver­gence of datasets, brings the pos­si­bil­i­ty to con­flate diverged states, and allows dis­trib­uted datasets to be syn­chro­nized. In this paper, we present Quit Store, it was inspired by and it builds upon the suc­cess­ful Git sys­tem. The approach is based on a for­mal expres­sion of evo­lu­tion and con­sol­i­da­tion of dis­trib­uted datasets. Dur­ing the col­lab­o­ra­tive cura­tion process, the sys­tem auto­mat­i­cal­ly ver­sions the RDF dataset and tracks prove­nance infor­ma­tion. It also pro­vides sup­port to branch, merge, and syn­chro­nize dis­trib­uted RDF datasets. The merg­ing process is guard­ed by spe­cif­ic merge strate­gies for RDF data. Final­ly, we use our ref­er­ence imple­men­ta­tion to show over­all good per­for­mance and demon­strate the prac­ti­cal usabil­i­ty of the sys­tem.},
  author = {Arndt, Natanael and Nau­mann, Patrick and Radtke, Nor­man and Mar­tin, Michael and Marx, Edgard},
  jour­nal = {Jour­nal of Web Seman­tics},
  key­words = {es},
  title = {Decen­tral­ized Col­lab­o­ra­tive Knowl­edge Man­age­ment using Git},
  year = 2018
  }
  

  %0 Jour­nal Arti­cle
  %1 arndt-n-2018–jws
  %A Arndt, Natanael
  %A Nau­mann, Patrick
  %A Radtke, Nor­man
  %A Mar­tin, Michael
  %A Marx, Edgard
  %D 2018
  %J Jour­nal of Web Seman­tics
  %R 10.1016/j.websem.2018.08.002
  %T Decen­tral­ized Col­lab­o­ra­tive Knowl­edge Man­age­ment using Git
  %U https://arxiv.org/pdf/1805.03721
  %X The World Wide Web and the Seman­tic Web are designed as a net­work of dis­trib­uted ser­vices and datasets. The dis­trib­uted char­ac­ter of the Web brings man­i­fold col­lab­o­ra­tive pos­si­bil­i­ties to inter­change data. The com­mon­ly adopt­ed col­lab­o­ra­tive solu­tions for RDF data are cen­tral­ized (e.g. SPARQL end­points and wiki sys­tems). But to sup­port dis­trib­uted col­lab­o­ra­tion, a sys­tem is need­ed, that sup­ports diver­gence of datasets, brings the pos­si­bil­i­ty to con­flate diverged states, and allows dis­trib­uted datasets to be syn­chro­nized. In this paper, we present Quit Store, it was inspired by and it builds upon the suc­cess­ful Git sys­tem. The approach is based on a for­mal expres­sion of evo­lu­tion and con­sol­i­da­tion of dis­trib­uted datasets. Dur­ing the col­lab­o­ra­tive cura­tion process, the sys­tem auto­mat­i­cal­ly ver­sions the RDF dataset and tracks prove­nance infor­ma­tion. It also pro­vides sup­port to branch, merge, and syn­chro­nize dis­trib­uted RDF datasets. The merg­ing process is guard­ed by spe­cif­ic merge strate­gies for RDF data. Final­ly, we use our ref­er­ence imple­men­ta­tion to show over­all good per­for­mance and demon­strate the prac­ti­cal usabil­i­ty of the system.
  

2017

• Triple Scor­ing Using a Hybrid Fact Val­i­da­tion Approach — The Cat­sear Triple Scor­er at WSDM Cup 2017In: WSDM Cup, co-locat­ed with the 10th ACM Inter­na­tion­al Con­fer­ence on Web Search and Data Min­ing : ACMEdgard Marx, Tom­ma­so Soru and Andr{é} Valdestilhas

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{MarxWSDM2017,
  author = {Marx, Edgard and Soru, Tom­ma­so and Valdes­til­has, Andr{é}},
  book­ti­tle = {WSDM Cup, co-locat­ed with the 10th ACM Inter­na­tion­al Con­fer­ence on Web Search and Data Min­ing},
  key­words = {triple},
  orga­ni­za­tion = {ACM},
  title = {Triple Scor­ing Using a Hybrid Fact Val­i­da­tion Approach — The Cat­sear Triple Scor­er at WSDM Cup 2017},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 MarxWSDM2017
  %A Marx, Edgard
  %A Soru, Tom­ma­so
  %A Valdes­til­has, Andr{é}
  %B WSDM Cup, co-locat­ed with the 10th ACM Inter­na­tion­al Con­fer­ence on Web Search and Data Min­ing
  %D 2017
  %T Triple Scor­ing Using a Hybrid Fact Val­i­da­tion Approach — The Cat­sear Triple Scor­er at WSDM Cup 2017
  %U https://arxiv.org/abs/1712.08352
  

• Explor­ing the Evo­lu­tion and Prove­nance of Git Ver­sioned RDF DataIn: Javier D. Fer­nán­dez, Jere­my Debat­tista and Jür­gen Umbrich (eds.): 3rd Work­shop on Man­ag­ing the Evo­lu­tion and Preser­va­tion of the Data Web (MEP­DaW) co-locat­ed with 14th Euro­pean Seman­tic Web Con­fer­ence (ESWC 2017). Por­toroz, Slove­niaNatanael Arndt, Patrick Nau­mann and Edgard Marx

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The dis­trib­uted char­ac­ter and the man­i­fold pos­si­bil­i­ties for inter­chang­ing data on the Web lead to the prob­lem of get­ting hold of the prove­nance of the data. Espe­cial­ly in the domain of dig­i­tal human­i­ties and when deal­ing with Linked Data in an enter­prise con­text prove­nance infor­ma­tion is need­ed to sup­port the col­lab­o­ra­tive process of data man­age­ment. We are propos­ing a pos­si­bil­i­ty for cap­tur­ing and explor­ing prove­nance infor­ma­tion, based on the method­ol­o­gy of man­ag­ing RDF data in a tool stack on top of the decen­tral­ized source code man­age­ment sys­tem Git. This com­pris­es a que­ri­able his­to­ry graph, the pos­si­bil­i­ty to query arbi­trary revi­sions of a Git ver­sioned store and in the min­i­mal gran­u­lar­i­ty the pos­si­bil­i­ty to anno­tate indi­vid­ual state­ments with their prove­nance information.

  @inproceedings{arndt-n-2017–provenance,
  abstract = {The dis­trib­uted char­ac­ter and the man­i­fold pos­si­bil­i­ties for inter­chang­ing data on the Web lead to the prob­lem of get­ting hold of the prove­nance of the data. Espe­cial­ly in the domain of dig­i­tal human­i­ties and when deal­ing with Linked Data in an enter­prise con­text prove­nance infor­ma­tion is need­ed to sup­port the col­lab­o­ra­tive process of data man­age­ment. We are propos­ing a pos­si­bil­i­ty for cap­tur­ing and explor­ing prove­nance infor­ma­tion, based on the method­ol­o­gy of man­ag­ing RDF data in a tool stack on top of the decen­tral­ized source code man­age­ment sys­tem Git. This com­pris­es a que­ri­able his­to­ry graph, the pos­si­bil­i­ty to query arbi­trary revi­sions of a Git ver­sioned store and in the min­i­mal gran­u­lar­i­ty the pos­si­bil­i­ty to anno­tate indi­vid­ual state­ments with their prove­nance infor­ma­tion.},
  address = {Por­toroz, Slove­nia},
  author = {Arndt, Natanael and Nau­mann, Patrick and Marx, Edgard},
  book­ti­tle = {3rd Work­shop on Man­ag­ing the Evo­lu­tion and Preser­va­tion of the Data Web (MEP­DaW) co-locat­ed with 14th Euro­pean Seman­tic Web Con­fer­ence (ESWC 2017)},
  edi­tor = {Fer­nán­dez, Javier D. and Debat­tista, Jere­my and Umbrich, Jür­gen},
  key­words = {es},
  month = {05},
  title = {Explor­ing the Evo­lu­tion and Prove­nance of Git Ver­sioned RDF Data},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2017–provenance
  %A Arndt, Natanael
  %A Nau­mann, Patrick
  %A Marx, Edgard
  %B 3rd Work­shop on Man­ag­ing the Evo­lu­tion and Preser­va­tion of the Data Web (MEP­DaW) co-locat­ed with 14th Euro­pean Seman­tic Web Con­fer­ence (ESWC 2017)
  %C Por­toroz, Slove­nia
  %D 2017
  %E Fer­nán­dez, Javier D.
  %E Debat­tista, Jere­my
  %E Umbrich, Jür­gen
  %T Explor­ing the Evo­lu­tion and Prove­nance of Git Ver­sioned RDF Data
  %U http://ceur-ws.org/Vol-1824/mepdaw_paper_2.pdf
  %X The dis­trib­uted char­ac­ter and the man­i­fold pos­si­bil­i­ties for inter­chang­ing data on the Web lead to the prob­lem of get­ting hold of the prove­nance of the data. Espe­cial­ly in the domain of dig­i­tal human­i­ties and when deal­ing with Linked Data in an enter­prise con­text prove­nance infor­ma­tion is need­ed to sup­port the col­lab­o­ra­tive process of data man­age­ment. We are propos­ing a pos­si­bil­i­ty for cap­tur­ing and explor­ing prove­nance infor­ma­tion, based on the method­ol­o­gy of man­ag­ing RDF data in a tool stack on top of the decen­tral­ized source code man­age­ment sys­tem Git. This com­pris­es a que­ri­able his­to­ry graph, the pos­si­bil­i­ty to query arbi­trary revi­sions of a Git ver­sioned store and in the min­i­mal gran­u­lar­i­ty the pos­si­bil­i­ty to anno­tate indi­vid­ual state­ments with their prove­nance information.
  

• Decen­tral­ized Evo­lu­tion and Con­sol­i­da­tion of RDF GraphsIn: 17th Inter­na­tion­al Con­fer­ence on Web Engi­neer­ing (ICWE 2017), ICWE 2017. Rome, ItalyNatanael Arndt and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The World Wide Web and the Seman­tic Web are designed as a net­work of dis­trib­uted ser­vices and datasets. In this net­work and its gen­e­sis, col­lab­o­ra­tion played and still plays a cru­cial role. But cur­rent­ly we only have cen­tral col­lab­o­ra­tion solu­tions for RDF data, such as SPARQL end­points and wiki sys­tems, while decen­tral­ized solu­tions can enable appli­ca­tions for many more use-cas­es. Inspired by a suc­cess­ful dis­trib­uted source code man­age­ment method­ol­o­gy in soft­ware engi­neer­ing a frame­work to sup­port dis­trib­uted evo­lu­tion is pro­posed. The sys­tem is based on Git and pro­vides dis­trib­uted col­lab­o­ra­tion on RDF graphs. This paper cov­ers the for­mal expres­sion of the evo­lu­tion and con­sol­i­da­tion of dis­trib­uted datasets, the syn­chro­niza­tion, as well as oth­er sup­port­ing operations.

  @inproceedings{arndt-n-2017–decentralized,
  abstract = {The World Wide Web and the Seman­tic Web are designed as a net­work of dis­trib­uted ser­vices and datasets. In this net­work and its gen­e­sis, col­lab­o­ra­tion played and still plays a cru­cial role. But cur­rent­ly we only have cen­tral col­lab­o­ra­tion solu­tions for RDF data, such as SPARQL end­points and wiki sys­tems, while decen­tral­ized solu­tions can enable appli­ca­tions for many more use-cas­es. Inspired by a suc­cess­ful dis­trib­uted source code man­age­ment method­ol­o­gy in soft­ware engi­neer­ing a frame­work to sup­port dis­trib­uted evo­lu­tion is pro­posed. The sys­tem is based on Git and pro­vides dis­trib­uted col­lab­o­ra­tion on RDF graphs. This paper cov­ers the for­mal expres­sion of the evo­lu­tion and con­sol­i­da­tion of dis­trib­uted datasets, the syn­chro­niza­tion, as well as oth­er sup­port­ing oper­a­tions.},
  address = {Rome, Italy},
  author = {Arndt, Natanael and Mar­tin, Michael},
  book­ti­tle = {17th Inter­na­tion­al Con­fer­ence on Web Engi­neer­ing (ICWE 2017)},
  key­words = {es},
  month = {06},
  series = {ICWE 2017},
  title = {Decen­tral­ized Evo­lu­tion and Con­sol­i­da­tion of RDF Graphs},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2017–decentralized
  %A Arndt, Natanael
  %A Mar­tin, Michael
  %B 17th Inter­na­tion­al Con­fer­ence on Web Engi­neer­ing (ICWE 2017)
  %C Rome, Italy
  %D 2017
  %R 10.1007/978–3‑319–60131-1_2
  %T Decen­tral­ized Evo­lu­tion and Con­sol­i­da­tion of RDF Graphs
  %U https://svn.aksw.org/papers/2017/ICWE_DecentralizedEvolution/public.pdf
  %X The World Wide Web and the Seman­tic Web are designed as a net­work of dis­trib­uted ser­vices and datasets. In this net­work and its gen­e­sis, col­lab­o­ra­tion played and still plays a cru­cial role. But cur­rent­ly we only have cen­tral col­lab­o­ra­tion solu­tions for RDF data, such as SPARQL end­points and wiki sys­tems, while decen­tral­ized solu­tions can enable appli­ca­tions for many more use-cas­es. Inspired by a suc­cess­ful dis­trib­uted source code man­age­ment method­ol­o­gy in soft­ware engi­neer­ing a frame­work to sup­port dis­trib­uted evo­lu­tion is pro­posed. The sys­tem is based on Git and pro­vides dis­trib­uted col­lab­o­ra­tion on RDF graphs. This paper cov­ers the for­mal expres­sion of the evo­lu­tion and con­sol­i­da­tion of dis­trib­uted datasets, the syn­chro­niza­tion, as well as oth­er sup­port­ing operations.
  

• LEDSPLaY17: Work­shop on Linked Enter­prise Data Ser­vices, Prove­nance, Link­ing and Qual­i­tYIn: INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI). Chem­nitz, Ger­many : Gesellschaft für Infor­matik, p. 1863Natanael Arndt, André Langer, Michael Mar­tin and Sebas­t­ian Tramp

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{arndt-n-2017–ledsplay,
  address = {Bonn, Ger­many},
  author = {Arndt, Natanael and Langer, André and Mar­tin, Michael and Tramp, Sebas­t­ian},
  book­ti­tle = {INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)},
  key­words = {AIKE},
  month = {09},
  pages = 1863,
  pub­lish­er = {Gesellschaft für Infor­matik},
  title = {LEDSPLaY17: Work­shop on Linked Enter­prise Data Ser­vices, Prove­nance, Link­ing and Qual­i­tY},
  type = {Edi­to­r­i­al},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2017–ledsplay
  %A Arndt, Natanael
  %A Langer, André
  %A Mar­tin, Michael
  %A Tramp, Sebas­t­ian
  %B INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)
  %C Bonn, Ger­many
  %D 2017
  %I Gesellschaft für Infor­matik
  %P 1863
  %R 10.18420/in2017_185
  %T LEDSPLaY17: Work­shop on Linked Enter­prise Data Ser­vices, Prove­nance, Link­ing and Qual­i­tY
  %U https://dl.gi.de/bitstream/handle/20.500.12116/3953/B26‑0.pdf
  

• {S}PARQL {U}pdate queries over {R2RML} mapped data sourcesIn: Max­i­m­il­ian Eibl and Mar­tin Gaed­ke (eds.): INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI), Lec­ture Notes in Infor­mat­ics (LNI). Chem­nitz, Ger­many : Gesellschaft für Infor­matik — ISBN 978–3‑88579–669‑5, pp. 1891–1901Joerg Unbe­hauen and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In the Linked Data Life Cycle map­ping and extract­ing data from struc­tured sources is an essen­tial step in build­ing a knowl­edge graph. In exist­ing data life cycles this process is uni­di­rec­tion­al, i.e. the data is extract­ed from the source but changes like clean­ing and link­ing are not fed back into the orig­i­nat­ing sys­tem. SPAR­QL-to-SQL rewrit­ers cre­ate vir­tu­al RDF with­out mate­ri­al­iz­ing data by expos­ing SPARQL end­points. With the Update exten­sion of our Spar­qlMap sys­tem we pro­vide read/write access to struc­tured data sources to enable a tighter inte­gra­tion of the source sys­tems in knowl­edge refine­ment process. in this paper, we dis­cuss three dif­fer­ent update meth­ods and fur­ther describe in two sce­nar­ios how the source sys­tem can ben­e­fit from feed back from the Linked Data integration.

  @inproceedings{unbehauen-k-2017–sparqlUpdate,
  abstract = {In the Linked Data Life Cycle map­ping and extract­ing data from struc­tured sources is an essen­tial step in build­ing a knowl­edge graph. In exist­ing data life cycles this process is uni­di­rec­tion­al, i.e. the data is extract­ed from the source but changes like clean­ing and link­ing are not fed back into the orig­i­nat­ing sys­tem. SPAR­QL-to-SQL rewrit­ers cre­ate vir­tu­al RDF with­out mate­ri­al­iz­ing data by expos­ing SPARQL end­points. With the Update exten­sion of our Spar­qlMap sys­tem we pro­vide read/write access to struc­tured data sources to enable a tighter inte­gra­tion of the source sys­tems in knowl­edge refine­ment process. in this paper, we dis­cuss three dif­fer­ent update meth­ods and fur­ther describe in two sce­nar­ios how the source sys­tem can ben­e­fit from feed back from the Linked Data inte­gra­tion.},
  address = {Chem­nitz, Ger­many},
  author = {Unbe­hauen, Joerg and Mar­tin, Michael},
  book­ti­tle = {INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)},
  edi­tor = {Eibl, Max­i­m­il­ian and Gaed­ke, Mar­tin},
  key­words = {es},
  month = {09},
  pages = {1891–1901},
  pub­lish­er = {Gesellschaft für Infor­matik},
  series = {Lec­ture Notes in Infor­mat­ics (LNI)},
  title = {{S}PARQL {U}pdate queries over {R2RML} mapped data sources},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 unbehauen-k-2017–sparqlUpdate
  %A Unbe­hauen, Joerg
  %A Mar­tin, Michael
  %B INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)
  %C Chem­nitz, Ger­many
  %D 2017
  %E Eibl, Max­i­m­il­ian
  %E Gaed­ke, Mar­tin
  %I Gesellschaft für Infor­matik
  %P 1891–1901
  %R 10.18420/in2017_189
  %T {S}PARQL {U}pdate queries over {R2RML} mapped data sources
  %U https://dl.gi.de/bitstream/handle/20.500.12116/3957/B26‑4.pdf
  %X In the Linked Data Life Cycle map­ping and extract­ing data from struc­tured sources is an essen­tial step in build­ing a knowl­edge graph. In exist­ing data life cycles this process is uni­di­rec­tion­al, i.e. the data is extract­ed from the source but changes like clean­ing and link­ing are not fed back into the orig­i­nat­ing sys­tem. SPAR­QL-to-SQL rewrit­ers cre­ate vir­tu­al RDF with­out mate­ri­al­iz­ing data by expos­ing SPARQL end­points. With the Update exten­sion of our Spar­qlMap sys­tem we pro­vide read/write access to struc­tured data sources to enable a tighter inte­gra­tion of the source sys­tems in knowl­edge refine­ment process. in this paper, we dis­cuss three dif­fer­ent update meth­ods and fur­ther describe in two sce­nar­ios how the source sys­tem can ben­e­fit from feed back from the Linked Data inte­gra­tion.
  %@ 978–3‑88579–669‑5
  

• {D}iscover {B}arrier-free {A}ccessible {L}ocations with the {L}ocation {N}avigatorIn: Max­i­m­il­ian Eibl and Mar­tin Gaed­ke (eds.): INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI), Lec­ture Notes in Infor­mat­ics (LNI). Chem­nitz, Ger­many : Gesellschaft für Infor­matik — ISBN 978–3‑88579–669‑5, pp. 1923–1931Kon­rad Abicht, Sime­on Ack­er­mann and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  We present the cur­rent ver­sion of the Loca­tion Nav­i­ga­tor, which sup­ports users by find­ing loca­tions in Leipzig, that can be accessed with­out bar­ri­ers. Besides this cur­rent ver­sion of the pro­to­type we present addi­tion­al­ly expe­ri­ences regard­ing its engi­neer­ing process and the pre­vi­ous­ly per­formed con­ver­sion of Open Data pro­vid­ed by the reg­is­tered asso­ci­a­tion Behin­derten­ver­band Leipzig e.V. (BVL). Our vision of the under­ly­ing data is an inter-com­mune data net­work, in order to sup­port per­sons with spe­cial needs and, fur­ther­more, to apply devel­op­ments such as the Loca­tion Nav­i­ga­tor to oth­er munic­i­pal­i­ties. For this pur­pose, RDF will be used for the rep­re­sen­ta­tion and link­ing of data in the future. Besides the pre­sen­ta­tion of the Loca­tion Nav­i­ga­tor, we sketch some approach­es we eval­u­at­ed dur­ing the cre­ation of the respec­tive data model.

  @inproceedings{abicht-k-2017–bvl,
  abstract = {We present the cur­rent ver­sion of the Loca­tion Nav­i­ga­tor, which sup­ports users by find­ing loca­tions in Leipzig, that can be accessed with­out bar­ri­ers. Besides this cur­rent ver­sion of the pro­to­type we present addi­tion­al­ly expe­ri­ences regard­ing its engi­neer­ing process and the pre­vi­ous­ly per­formed con­ver­sion of Open Data pro­vid­ed by the reg­is­tered asso­ci­a­tion Behin­derten­ver­band Leipzig e.V. (BVL). Our vision of the under­ly­ing data is an inter-com­mune data net­work, in order to sup­port per­sons with spe­cial needs and, fur­ther­more, to apply devel­op­ments such as the Loca­tion Nav­i­ga­tor to oth­er munic­i­pal­i­ties. For this pur­pose, RDF will be used for the rep­re­sen­ta­tion and link­ing of data in the future. Besides the pre­sen­ta­tion of the Loca­tion Nav­i­ga­tor, we sketch some approach­es we eval­u­at­ed dur­ing the cre­ation of the respec­tive data mod­el.},
  address = {Chem­nitz, Ger­many},
  author = {Abicht, Kon­rad and Ack­er­mann, Sime­on and Mar­tin, Michael},
  book­ti­tle = {INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)},
  edi­tor = {Eibl, Max­i­m­il­ian and Gaed­ke, Mar­tin},
  key­words = {es},
  month = {09},
  pages = {1923–1931},
  pub­lish­er = {Gesellschaft für Infor­matik},
  series = {Lec­ture Notes in Infor­mat­ics (LNI)},
  title = {{D}iscover {B}arrier-free {A}ccessible {L}ocations with the {L}ocation {N}avigator},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 abicht-k-2017–bvl
  %A Abicht, Kon­rad
  %A Ack­er­mann, Sime­on
  %A Mar­tin, Michael
  %B INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)
  %C Chem­nitz, Ger­many
  %D 2017
  %E Eibl, Max­i­m­il­ian
  %E Gaed­ke, Mar­tin
  %I Gesellschaft für Infor­matik
  %P 1923–1931
  %R 10.18420/in2017_192
  %T {D}iscover {B}arrier-free {A}ccessible {L}ocations with the {L}ocation {N}avigator
  %U https://dl.gi.de/bitstream/handle/20.500.12116/3961/B26‑7.pdf
  %X We present the cur­rent ver­sion of the Loca­tion Nav­i­ga­tor, which sup­ports users by find­ing loca­tions in Leipzig, that can be accessed with­out bar­ri­ers. Besides this cur­rent ver­sion of the pro­to­type we present addi­tion­al­ly expe­ri­ences regard­ing its engi­neer­ing process and the pre­vi­ous­ly per­formed con­ver­sion of Open Data pro­vid­ed by the reg­is­tered asso­ci­a­tion Behin­derten­ver­band Leipzig e.V. (BVL). Our vision of the under­ly­ing data is an inter-com­mune data net­work, in order to sup­port per­sons with spe­cial needs and, fur­ther­more, to apply devel­op­ments such as the Loca­tion Nav­i­ga­tor to oth­er munic­i­pal­i­ties. For this pur­pose, RDF will be used for the rep­re­sen­ta­tion and link­ing of data in the future. Besides the pre­sen­ta­tion of the Loca­tion Nav­i­ga­tor, we sketch some approach­es we eval­u­at­ed dur­ing the cre­ation of the respec­tive data mod­el.
  %@ 978–3‑88579–669‑5
  

• A Method for Dis­trib­uted and Col­lab­o­ra­tive Cura­tion of RDF Datasets Uti­liz­ing the Quit StackIn: Max­i­m­il­ian Eibl and Mar­tin Gaed­ke (eds.): INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI), Lec­ture Notes in Infor­mat­ics (LNI). Chem­nitz, Ger­many : Gesellschaft für Infor­matik — ISBN 978–3‑88579–669‑5, pp. 1873–1881Natanael Arndt and Nor­man Radtke

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The dis­trib­uted char­ac­ter and the man­i­fold pos­si­bil­i­ties for inter­chang­ing data on the Web lead to the prob­lem of get­ting hold of the prove­nance of the data. Espe­cial­ly in the domain of dig­i­tal human­i­ties and when deal­ing with Linked Data in an enter­prise con­text prove­nance infor­ma­tion is need­ed to sup­port the col­lab­o­ra­tive process of data man­age­ment. We are propos­ing a pos­si­bil­i­ty for cap­tur­ing and explor­ing prove­nance infor­ma­tion, based on the method­ol­o­gy of man­ag­ing RDF data in a tool stack on top of the decen­tral­ized source code man­age­ment sys­tem Git. This com­pris­es a que­ri­able his­to­ry graph, the pos­si­bil­i­ty to query arbi­trary revi­sions of a Git ver­sioned store and in the min­i­mal gran­u­lar­i­ty the pos­si­bil­i­ty to anno­tate indi­vid­ual state­ments with their prove­nance information.

  @inproceedings{arndt-n-2017–quitstack,
  abstract = {The dis­trib­uted char­ac­ter and the man­i­fold pos­si­bil­i­ties for inter­chang­ing data on the Web lead to the prob­lem of get­ting hold of the prove­nance of the data. Espe­cial­ly in the domain of dig­i­tal human­i­ties and when deal­ing with Linked Data in an enter­prise con­text prove­nance infor­ma­tion is need­ed to sup­port the col­lab­o­ra­tive process of data man­age­ment. We are propos­ing a pos­si­bil­i­ty for cap­tur­ing and explor­ing prove­nance infor­ma­tion, based on the method­ol­o­gy of man­ag­ing RDF data in a tool stack on top of the decen­tral­ized source code man­age­ment sys­tem Git. This com­pris­es a que­ri­able his­to­ry graph, the pos­si­bil­i­ty to query arbi­trary revi­sions of a Git ver­sioned store and in the min­i­mal gran­u­lar­i­ty the pos­si­bil­i­ty to anno­tate indi­vid­ual state­ments with their prove­nance infor­ma­tion.},
  address = {Chem­nitz, Ger­many},
  author = {Arndt, Natanael and Radtke, Nor­man},
  book­ti­tle = {INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)},
  edi­tor = {Eibl, Max­i­m­il­ian and Gaed­ke, Mar­tin},
  key­words = {es},
  month = {09},
  pages = {1873–1881},
  pub­lish­er = {Gesellschaft für Infor­matik},
  series = {Lec­ture Notes in Infor­mat­ics (LNI)},
  title = {A Method for Dis­trib­uted and Col­lab­o­ra­tive Cura­tion of RDF Datasets Uti­liz­ing the Quit Stack},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2017–quitstack
  %A Arndt, Natanael
  %A Radtke, Nor­man
  %B INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)
  %C Chem­nitz, Ger­many
  %D 2017
  %E Eibl, Max­i­m­il­ian
  %E Gaed­ke, Mar­tin
  %I Gesellschaft für Infor­matik
  %P 1873–1881
  %R 10.18420/in2017_187
  %T A Method for Dis­trib­uted and Col­lab­o­ra­tive Cura­tion of RDF Datasets Uti­liz­ing the Quit Stack
  %U https://dl.gi.de/bitstream/handle/20.500.12116/3955/B26‑2.pdf
  %X The dis­trib­uted char­ac­ter and the man­i­fold pos­si­bil­i­ties for inter­chang­ing data on the Web lead to the prob­lem of get­ting hold of the prove­nance of the data. Espe­cial­ly in the domain of dig­i­tal human­i­ties and when deal­ing with Linked Data in an enter­prise con­text prove­nance infor­ma­tion is need­ed to sup­port the col­lab­o­ra­tive process of data man­age­ment. We are propos­ing a pos­si­bil­i­ty for cap­tur­ing and explor­ing prove­nance infor­ma­tion, based on the method­ol­o­gy of man­ag­ing RDF data in a tool stack on top of the decen­tral­ized source code man­age­ment sys­tem Git. This com­pris­es a que­ri­able his­to­ry graph, the pos­si­bil­i­ty to query arbi­trary revi­sions of a Git ver­sioned store and in the min­i­mal gran­u­lar­i­ty the pos­si­bil­i­ty to anno­tate indi­vid­ual state­ments with their prove­nance infor­ma­tion.
  %@ 978–3‑88579–669‑5
  

• A map­ping approach for con­fig­u­ra­tion man­age­ment tools to close the gap between two worlds and to regain trustIn: Max­i­m­il­ian Eibl and Mar­tin Gaed­ke (eds.): INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI), Lec­ture Notes in Infor­mat­ics (LNI). Chem­nitz, Ger­many : Gesellschaft für Infor­matik, Bonn — ISBN 978–3‑88579–669‑5, pp. 1865–1872Roy Meiss­ner and Mar­cus Kastner

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In this paper we present the tool Dock­er­Con­vert­er, an approach and a soft­ware to map a Dock­er con­fig­u­ra­tion to var­i­ous matured sys­tems and also to reverse engi­neer any avail­able Dock­er image in order to increase the con­fi­dence (or trust) into it. We show why a map­ping approach is more promis­ing than con­struct­ing a Domain Spe­cif­ic Lan­guage and why we chose a Dock­er image instead of the Dock­er­file as the source mod­el. Our over­all goal is to enable Seman­tic Web research projects and espe­cial­ly Linked Data enter­prise ser­vices to be bet­ter inte­grat­ed into enter­prise appli­ca­tions and companies.

  @inproceedings{meissner-informatik-DockerConverter,
  abstract = {In this paper we present the tool Dock­er­Con­vert­er, an approach and a soft­ware to map a Dock­er con­fig­u­ra­tion to var­i­ous matured sys­tems and also to reverse engi­neer any avail­able Dock­er image in order to increase the con­fi­dence (or trust) into it. We show why a map­ping approach is more promis­ing than con­struct­ing a Domain Spe­cif­ic Lan­guage and why we chose a Dock­er image instead of the Dock­er­file as the source mod­el. Our over­all goal is to enable Seman­tic Web research projects and espe­cial­ly Linked Data enter­prise ser­vices to be bet­ter inte­grat­ed into enter­prise appli­ca­tions and com­pa­nies.},
  address = {Chem­nitz, Ger­many},
  author = {Meiss­ner, Roy and Kast­ner, Mar­cus},
  book­ti­tle = {INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)},
  edi­tor = {Eibl, Max­i­m­il­ian and Gaed­ke, Mar­tin},
  key­words = {sys:relevantFor:infai},
  month = {09},
  pages = {1865–1872},
  pub­lish­er = {Gesellschaft für Infor­matik, Bonn},
  series = {Lec­ture Notes in Infor­mat­ics (LNI)},
  title = {A map­ping approach for con­fig­u­ra­tion man­age­ment tools to close the gap between two worlds and to regain trust},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 meiss­ner-infor­matik-Dock­er­Con­vert­er
  %A Meiss­ner, Roy
  %A Kast­ner, Mar­cus
  %B INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)
  %C Chem­nitz, Ger­many
  %D 2017
  %E Eibl, Max­i­m­il­ian
  %E Gaed­ke, Mar­tin
  %I Gesellschaft für Infor­matik, Bonn
  %P 1865–1872
  %R 10.18420/in2017_186
  %T A map­ping approach for con­fig­u­ra­tion man­age­ment tools to close the gap between two worlds and to regain trust
  %U https://svn.aksw.org/papers/2017/INFORMATIK_DockerConverter/public.pdf
  %X In this paper we present the tool Dock­er­Con­vert­er, an approach and a soft­ware to map a Dock­er con­fig­u­ra­tion to var­i­ous matured sys­tems and also to reverse engi­neer any avail­able Dock­er image in order to increase the con­fi­dence (or trust) into it. We show why a map­ping approach is more promis­ing than con­struct­ing a Domain Spe­cif­ic Lan­guage and why we chose a Dock­er image instead of the Dock­er­file as the source mod­el. Our over­all goal is to enable Seman­tic Web research projects and espe­cial­ly Linked Data enter­prise ser­vices to be bet­ter inte­grat­ed into enter­prise appli­ca­tions and com­pa­nies.
  %@ 978–3‑88579–669‑5
  

• {C}ube{V}iz.js: {A} {L}ightweight {F}ramework for {D}iscovering and {V}isualizing {RDF} {D}ata {C}ubesIn: Max­i­m­il­ian Eibl and Mar­tin Gaed­ke (eds.): INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI), Lec­ture Notes in Infor­mat­ics (LNI). Chem­nitz, Ger­many : Gesellschaft für Infor­matik — ISBN 978–3‑88579–669‑5, pp. 1915–1921Kon­rad Abicht, Georges Alkhouri, Natanael Arndt, Roy Meiss­ner and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In this paper we present CubeViz.js, the suc­ces­sor of Cube­Viz, as an approach for light­weight visu­al­iza­tion and explo­ration of sta­tis­ti­cal data using the RDF Data Cube vocab­u­lary. In sev­er­al use cas­es, such as the Euro­pean Unions Open Data Por­tal, in which we deployed Cube­Viz, we were able to gath­er var­i­ous require­ments that even­tu­al­ly led to the deci­sion of reim­ple­ment­ing Cube­Viz as JavaScript-only appli­ca­tion. As part of this paper we show­case major func­tion­al­i­ties of CubeViz.js and its improve­ments in com­par­i­son to the pri­or version.

  @inproceedings{abicht-k-2017–cubevizjs,
  abstract = {In this paper we present CubeViz.js, the suc­ces­sor of Cube­Viz, as an approach for light­weight visu­al­iza­tion and explo­ration of sta­tis­ti­cal data using the RDF Data Cube vocab­u­lary. In sev­er­al use cas­es, such as the Euro­pean Unions Open Data Por­tal, in which we deployed Cube­Viz, we were able to gath­er var­i­ous require­ments that even­tu­al­ly led to the deci­sion of reim­ple­ment­ing Cube­Viz as JavaScript-only appli­ca­tion. As part of this paper we show­case major func­tion­al­i­ties of CubeViz.js and its improve­ments in com­par­i­son to the pri­or ver­sion.},
  address = {Chem­nitz, Ger­many},
  author = {Abicht, Kon­rad and Alkhouri, Georges and Arndt, Natanael and Meiss­ner, Roy and Mar­tin, Michael},
  book­ti­tle = {INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)},
  edi­tor = {Eibl, Max­i­m­il­ian and Gaed­ke, Mar­tin},
  key­words = {es},
  month = {09},
  pages = {1915–1921},
  pub­lish­er = {Gesellschaft für Infor­matik},
  series = {Lec­ture Notes in Infor­mat­ics (LNI)},
  title = {{C}ube{V}iz.js: {A} {L}ightweight {F}ramework for {D}iscovering and {V}isualizing {RDF} {D}ata {C}ubes},
  year = 2017
  }
  

  %0 Con­fer­ence Paper
  %1 abicht-k-2017–cubevizjs
  %A Abicht, Kon­rad
  %A Alkhouri, Georges
  %A Arndt, Natanael
  %A Meiss­ner, Roy
  %A Mar­tin, Michael
  %B INFORMATIK 2017, Lec­ture Notes in Infor­mat­ics (LNI)
  %C Chem­nitz, Ger­many
  %D 2017
  %E Eibl, Max­i­m­il­ian
  %E Gaed­ke, Mar­tin
  %I Gesellschaft für Infor­matik
  %P 1915–1921
  %R 10.18420/in2017_191
  %T {C}ube{V}iz.js: {A} {L}ightweight {F}ramework for {D}iscovering and {V}isualizing {RDF} {D}ata {C}ubes
  %U https://dl.gi.de/bitstream/handle/20.500.12116/3960/B26‑6.pdf
  %X In this paper we present CubeViz.js, the suc­ces­sor of Cube­Viz, as an approach for light­weight visu­al­iza­tion and explo­ration of sta­tis­ti­cal data using the RDF Data Cube vocab­u­lary. In sev­er­al use cas­es, such as the Euro­pean Unions Open Data Por­tal, in which we deployed Cube­Viz, we were able to gath­er var­i­ous require­ments that even­tu­al­ly led to the deci­sion of reim­ple­ment­ing Cube­Viz as JavaScript-only appli­ca­tion. As part of this paper we show­case major func­tion­al­i­ties of CubeViz.js and its improve­ments in com­par­i­son to the pri­or ver­sion.
  %@ 978–3‑88579–669‑5
  

2016

• Towards Fed­er­at­ed, Seman­tics-based Sup­ply Chain Ana­lyt­icsIn: Pro­ceed­ings of the 19th Inter­na­tion­al Con­fer­ence on Busi­ness Infor­ma­tion Sys­tems 6–8 July 2016, Leipzig, Ger­manyNiklas Petersen, Christoph Lange, S{ö}ren Auer, Mar­vin Frommhold and Sebas­t­ian Tramp

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  Sup­ply Chain Man­age­ment aims at opti­miz­ing the flow of goods and ser­vices from the pro­duc­er to the con­sumer. Close­ly inter­con­nect­ed enter­pris­es that align their pro­duc­tion, logis­tics and pro­cure­ment with one anoth­er thus enjoy a com­pet­i­tive advan­tage in the mar­ket. To achieve a close align­ment, an instant, robust and effi­cient infor­ma­tion flow along the sup­ply chain between and with­in enter­pris­es is required. How­ev­er, less effi­cient human com­mu­ni­ca­tion is often used instead of auto­mat­ic sys­tems because of the great diver­si­ty of enter­prise sys­tems and mod­els. This paper describes an approach and its imple­men­ta­tion SCM Intel­li­gence App, which enables the con­fig­u­ra­tion of indi­vid­ual sup­ply chains togeth­er with the exe­cu­tion of indus­try accept­ed per­for­mance met­rics. Based on machine-process­able sup­ply chain data mod­el (the SCOR­Voc RDF vocab­u­lary imple­ment­ing the SCOR stan­dard) and W3C stan­dard­ized pro­to­cols such as SPARQL, the approach rep­re­sents an alter­na­tive to closed soft­ware sys­tems, which lack sup­port for inter-orga­ni­za­tion­al sup­ply chain analy­sis. Final­ly, we demon­strate the prac­ti­cal­i­ty of our approach using a pro­to­typ­i­cal imple­men­ta­tion and a test scenario.

  @inproceedings{petersen2016towards,
  abstract = {Sup­ply Chain Man­age­ment aims at opti­miz­ing the flow of goods and ser­vices from the pro­duc­er to the con­sumer. Close­ly inter­con­nect­ed enter­pris­es that align their pro­duc­tion, logis­tics and pro­cure­ment with one anoth­er thus enjoy a com­pet­i­tive advan­tage in the mar­ket. To achieve a close align­ment, an instant, robust and effi­cient infor­ma­tion flow along the sup­ply chain between and with­in enter­pris­es is required. How­ev­er, less effi­cient human com­mu­ni­ca­tion is often used instead of auto­mat­ic sys­tems because of the great diver­si­ty of enter­prise sys­tems and mod­els. This paper describes an approach and its imple­men­ta­tion SCM Intel­li­gence App, which enables the con­fig­u­ra­tion of indi­vid­ual sup­ply chains togeth­er with the exe­cu­tion of indus­try accept­ed per­for­mance met­rics. Based on machine-process­able sup­ply chain data mod­el (the SCOR­Voc RDF vocab­u­lary imple­ment­ing the SCOR stan­dard) and W3C stan­dard­ized pro­to­cols such as SPARQL, the approach rep­re­sents an alter­na­tive to closed soft­ware sys­tems, which lack sup­port for inter-orga­ni­za­tion­al sup­ply chain analy­sis. Final­ly, we demon­strate the prac­ti­cal­i­ty of our approach using a pro­to­typ­i­cal imple­men­ta­tion and a test sce­nario.},
  author = {Petersen, Niklas and Lange, Christoph and Auer, S{ö}ren and Frommhold, Mar­vin and Tramp, Sebas­t­ian},
  book­ti­tle = {Pro­ceed­ings of the 19th Inter­na­tion­al Con­fer­ence on Busi­ness Infor­ma­tion Sys­tems 6–8 July 2016, Leipzig, Ger­many},
  key­words = {sys:relevantFor:infai},
  title = {Towards Fed­er­at­ed, Seman­tics-based Sup­ply Chain Ana­lyt­ics},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 petersen2016towards
  %A Petersen, Niklas
  %A Lange, Christoph
  %A Auer, S{ö}ren
  %A Frommhold, Mar­vin
  %A Tramp, Sebas­t­ian
  %B Pro­ceed­ings of the 19th Inter­na­tion­al Con­fer­ence on Busi­ness Infor­ma­tion Sys­tems 6–8 July 2016, Leipzig, Ger­many
  %D 2016
  %T Towards Fed­er­at­ed, Seman­tics-based Sup­ply Chain Ana­lyt­ics
  %X Sup­ply Chain Man­age­ment aims at opti­miz­ing the flow of goods and ser­vices from the pro­duc­er to the con­sumer. Close­ly inter­con­nect­ed enter­pris­es that align their pro­duc­tion, logis­tics and pro­cure­ment with one anoth­er thus enjoy a com­pet­i­tive advan­tage in the mar­ket. To achieve a close align­ment, an instant, robust and effi­cient infor­ma­tion flow along the sup­ply chain between and with­in enter­pris­es is required. How­ev­er, less effi­cient human com­mu­ni­ca­tion is often used instead of auto­mat­ic sys­tems because of the great diver­si­ty of enter­prise sys­tems and mod­els. This paper describes an approach and its imple­men­ta­tion SCM Intel­li­gence App, which enables the con­fig­u­ra­tion of indi­vid­ual sup­ply chains togeth­er with the exe­cu­tion of indus­try accept­ed per­for­mance met­rics. Based on machine-process­able sup­ply chain data mod­el (the SCOR­Voc RDF vocab­u­lary imple­ment­ing the SCOR stan­dard) and W3C stan­dard­ized pro­to­cols such as SPARQL, the approach rep­re­sents an alter­na­tive to closed soft­ware sys­tems, which lack sup­port for inter-orga­ni­za­tion­al sup­ply chain analy­sis. Final­ly, we demon­strate the prac­ti­cal­i­ty of our approach using a pro­to­typ­i­cal imple­men­ta­tion and a test scenario.
  

• {SCOR­Voc}: {V}ocabulary-based {I}nformation {I}ntegration and {E}xchange in {S}upply {N}etworksIn: Pro­ceed­ings of the 10th Inter­na­tion­al Con­fer­ence on Seman­tic Com­put­ing; Lagu­na Hills, Cal­i­for­nia; Feb­ru­ary 3–5 2016Niklas Petersen, Irlan Grangel-Gon­za­lez, Gokhan Coskun, S{ö}ren Auer, Mar­vin Frommhold, Sebas­t­ian Tramp and Maxime LeFrancois

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{scorvoc,
  author = {Petersen, Niklas and Grangel-Gon­za­lez, Irlan and Coskun, Gokhan and Auer, S{ö}ren and Frommhold, Mar­vin and Tramp, Sebas­t­ian and LeFran­cois, Maxime},
  book­ti­tle = {Pro­ceed­ings of the 10th Inter­na­tion­al Con­fer­ence on Seman­tic Com­put­ing; Lagu­na Hills, Cal­i­for­nia; Feb­ru­ary 3–5 2016},
  key­words = {frommhold},
  title = {{SCOR­Voc}: {V}ocabulary-based {I}nformation {I}ntegration and {E}xchange in {S}upply {N}etworks},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 scor­voc
  %A Petersen, Niklas
  %A Grangel-Gon­za­lez, Irlan
  %A Coskun, Gokhan
  %A Auer, S{ö}ren
  %A Frommhold, Mar­vin
  %A Tramp, Sebas­t­ian
  %A LeFran­cois, Maxime
  %B Pro­ceed­ings of the 10th Inter­na­tion­al Con­fer­ence on Seman­tic Com­put­ing; Lagu­na Hills, Cal­i­for­nia; Feb­ru­ary 3–5 2016
  %D 2016
  %T {SCOR­Voc}: {V}ocabulary-based {I}nformation {I}ntegration and {E}xchange in {S}upply {N}etworks
  %U http://eis.iai.uni-bonn.de/upload/paper/ICSC_2016_paper_63.pdf
  

• Quit Diff: Cal­cu­lat­ing the Delta Between RDF Datasets under Ver­sion Con­trolIn: 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016), SEMAN­TiCS ’16. Leipzig, Ger­many — ISBN 978–1‑4503–4752‑5/16/09Natanael Arndt and Nor­man Radtke

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Dis­trib­uted actors work­ing on a com­mon RDF dataset reg­u­lar­ly encounter the issue to com­pare the sta­tus of one graph with anoth­er or gen­er­al­ly to syn­chro­nize copies of a dataset. A ver­sion­ing sys­tem helps to syn­chro­nize the copies of a dataset, com­bined with a dif­fer­ence cal­cu­la­tion sys­tem it is also pos­si­ble to com­pare ver­sions in a log and to deter­mine, in which ver­sion a cer­tain state­ment was intro­duced or removed. In this demo we present Quit Diff, a tool to com­pare ver­sions of a Git ver­sioned quad store, while it is also applic­a­ble to sim­ple unver­sioned RDF datasets. We are fol­low­ing an approach to abstract from dif­fer­ences on a syn­tac­ti­cal lev­el to dif­fer­ences on the lev­el of the RDF data mod­el, while we leave fur­ther seman­tic inter­pre­ta­tion on the schema and instance lev­el to spe­cial­ized appli­ca­tions. Quit Diff can gen­er­ate patch­es in var­i­ous out­put for­mats and can be direct­ly inte­grat­ed in the dis­trib­uted ver­sion con­trol sys­tem Git which pro­vides a foun­da­tion for a com­pre­hen­sive co-evo­lu­tion work flow on RDF datasets.

  @inproceedings{arndt-n-2016–quitdiff,
  abstract = {Dis­trib­uted actors work­ing on a com­mon RDF dataset reg­u­lar­ly encounter the issue to com­pare the sta­tus of one graph with anoth­er or gen­er­al­ly to syn­chro­nize copies of a dataset. A ver­sion­ing sys­tem helps to syn­chro­nize the copies of a dataset, com­bined with a dif­fer­ence cal­cu­la­tion sys­tem it is also pos­si­ble to com­pare ver­sions in a log and to deter­mine, in which ver­sion a cer­tain state­ment was intro­duced or removed. In this demo we present Quit Diff, a tool to com­pare ver­sions of a Git ver­sioned quad store, while it is also applic­a­ble to sim­ple unver­sioned RDF datasets. We are fol­low­ing an approach to abstract from dif­fer­ences on a syn­tac­ti­cal lev­el to dif­fer­ences on the lev­el of the RDF data mod­el, while we leave fur­ther seman­tic inter­pre­ta­tion on the schema and instance lev­el to spe­cial­ized appli­ca­tions. Quit Diff can gen­er­ate patch­es in var­i­ous out­put for­mats and can be direct­ly inte­grat­ed in the dis­trib­uted ver­sion con­trol sys­tem Git which pro­vides a foun­da­tion for a com­pre­hen­sive co-evo­lu­tion work flow on RDF datasets.},
  address = {Leipzig, Ger­many},
  author = {Arndt, Natanael and Radtke, Nor­man},
  book­ti­tle = {12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)},
  key­words = {es},
  month = {09},
  series = {SEMAN­TiCS ’16},
  title = {Quit Diff: Cal­cu­lat­ing the Delta Between RDF Datasets under Ver­sion Con­trol},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2016–quitdiff
  %A Arndt, Natanael
  %A Radtke, Nor­man
  %B 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)
  %C Leipzig, Ger­many
  %D 2016
  %R 10.1145/2993318.2993349
  %T Quit Diff: Cal­cu­lat­ing the Delta Between RDF Datasets under Ver­sion Con­trol
  %U https://svn.aksw.org/papers/2016/Semantics_Demo_QuitDiff/public.pdf
  %X Dis­trib­uted actors work­ing on a com­mon RDF dataset reg­u­lar­ly encounter the issue to com­pare the sta­tus of one graph with anoth­er or gen­er­al­ly to syn­chro­nize copies of a dataset. A ver­sion­ing sys­tem helps to syn­chro­nize the copies of a dataset, com­bined with a dif­fer­ence cal­cu­la­tion sys­tem it is also pos­si­ble to com­pare ver­sions in a log and to deter­mine, in which ver­sion a cer­tain state­ment was intro­duced or removed. In this demo we present Quit Diff, a tool to com­pare ver­sions of a Git ver­sioned quad store, while it is also applic­a­ble to sim­ple unver­sioned RDF datasets. We are fol­low­ing an approach to abstract from dif­fer­ences on a syn­tac­ti­cal lev­el to dif­fer­ences on the lev­el of the RDF data mod­el, while we leave fur­ther seman­tic inter­pre­ta­tion on the schema and instance lev­el to spe­cial­ized appli­ca­tions. Quit Diff can gen­er­ate patch­es in var­i­ous out­put for­mats and can be direct­ly inte­grat­ed in the dis­trib­uted ver­sion con­trol sys­tem Git which pro­vides a foun­da­tion for a com­pre­hen­sive co-evo­lu­tion work flow on RDF datasets.
  %@ 978–1‑4503–4752‑5/16/09
  

• Struc­tured Feed­back: A Dis­trib­uted Pro­to­col for Feed­back and Patch­es on the Web of DataIn: Pro­ceed­ings of the Work­shop on Linked Data on the Web co-locat­ed with the 25th Inter­na­tion­al World Wide Web Con­fer­ence (WWW 2016), CEUR Work­shop Pro­ceed­ings. vol. 1593. Mon­tre­al, Cana­daNatanael Arndt, Kurt Jung­hanns, Roy Meiss­ner, Philipp Frischmuth, Nor­man Radtke, Mar­vin Frommhold and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The World Wide Web is an infra­struc­ture to pub­lish and retrieve infor­ma­tion through web resources. It evolved from a sta­t­ic Web 1.0 to a mul­ti­modal and inter­ac­tive com­mu­ni­ca­tion and infor­ma­tion space which is used to col­lab­o­ra­tive­ly con­tribute and dis­cuss web resources, which is bet­ter known as Web 2.0. The evo­lu­tion into a Seman­tic Web (Web 3.0) pro­ceeds. One of its remark­able advan­tages is the decen­tral­ized and inter­linked data com­po­si­tion. Hence, in con­trast to its data dis­tri­b­u­tion, work­flows and tech­nolo­gies for decen­tral­ized col­lab­o­ra­tive con­tri­bu­tion are miss­ing. In this paper we pro­pose the Struc­tured Feed­back pro­to­col as an inter­ac­tive addi­tion to the Web of Data. It offers sup­port for users to con­tribute to the evo­lu­tion of web resources, by pro­vid­ing struc­tured data arti­facts as patch­es for web resources, as well as sim­ple plain text com­ments. Based on this approach it enables crowd-sup­port­ed qual­i­ty assess­ment and web data cleans­ing process­es in an ad-hoc fash­ion most web users are famil­iar with.

  @inproceedings{arndt-2016-ldow-structured-feedback–,
  abstract = {The World Wide Web is an infra­struc­ture to pub­lish and retrieve infor­ma­tion through web resources. It evolved from a sta­t­ic Web 1.0 to a mul­ti­modal and inter­ac­tive com­mu­ni­ca­tion and infor­ma­tion space which is used to col­lab­o­ra­tive­ly con­tribute and dis­cuss web resources, which is bet­ter known as Web 2.0. The evo­lu­tion into a Seman­tic Web (Web 3.0) pro­ceeds. One of its remark­able advan­tages is the decen­tral­ized and inter­linked data com­po­si­tion. Hence, in con­trast to its data dis­tri­b­u­tion, work­flows and tech­nolo­gies for decen­tral­ized col­lab­o­ra­tive con­tri­bu­tion are miss­ing. In this paper we pro­pose the Struc­tured Feed­back pro­to­col as an inter­ac­tive addi­tion to the Web of Data. It offers sup­port for users to con­tribute to the evo­lu­tion of web resources, by pro­vid­ing struc­tured data arti­facts as patch­es for web resources, as well as sim­ple plain text com­ments. Based on this approach it enables crowd-sup­port­ed qual­i­ty assess­ment and web data cleans­ing process­es in an ad-hoc fash­ion most web users are famil­iar with.},
  address = {Mon­tre­al, Cana­da},
  author = {Arndt, Natanael and Jung­hanns, Kurt and Meiss­ner, Roy and Frischmuth, Philipp and Radtke, Nor­man and Frommhold, Mar­vin and Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of the Work­shop on Linked Data on the Web co-locat­ed with the 25th Inter­na­tion­al World Wide Web Con­fer­ence (WWW 2016)},
  key­words = {seebiproject_FederatedSocialWeb},
  month = {04},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {Struc­tured Feed­back: A Dis­trib­uted Pro­to­col for Feed­back and Patch­es on the Web of Data},
  vol­ume = 1593,
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-2016-ldow-struc­tured-feed­back–
  %A Arndt, Natanael
  %A Jung­hanns, Kurt
  %A Meiss­ner, Roy
  %A Frischmuth, Philipp
  %A Radtke, Nor­man
  %A Frommhold, Mar­vin
  %A Mar­tin, Michael
  %B Pro­ceed­ings of the Work­shop on Linked Data on the Web co-locat­ed with the 25th Inter­na­tion­al World Wide Web Con­fer­ence (WWW 2016)
  %C Mon­tre­al, Cana­da
  %D 2016
  %T Struc­tured Feed­back: A Dis­trib­uted Pro­to­col for Feed­back and Patch­es on the Web of Data
  %U http://ceur-ws.org/Vol-1593/article-02.pdf
  %V 1593
  %X The World Wide Web is an infra­struc­ture to pub­lish and retrieve infor­ma­tion through web resources. It evolved from a sta­t­ic Web 1.0 to a mul­ti­modal and inter­ac­tive com­mu­ni­ca­tion and infor­ma­tion space which is used to col­lab­o­ra­tive­ly con­tribute and dis­cuss web resources, which is bet­ter known as Web 2.0. The evo­lu­tion into a Seman­tic Web (Web 3.0) pro­ceeds. One of its remark­able advan­tages is the decen­tral­ized and inter­linked data com­po­si­tion. Hence, in con­trast to its data dis­tri­b­u­tion, work­flows and tech­nolo­gies for decen­tral­ized col­lab­o­ra­tive con­tri­bu­tion are miss­ing. In this paper we pro­pose the Struc­tured Feed­back pro­to­col as an inter­ac­tive addi­tion to the Web of Data. It offers sup­port for users to con­tribute to the evo­lu­tion of web resources, by pro­vid­ing struc­tured data arti­facts as patch­es for web resources, as well as sim­ple plain text com­ments. Based on this approach it enables crowd-sup­port­ed qual­i­ty assess­ment and web data cleans­ing process­es in an ad-hoc fash­ion most web users are famil­iar with.
  

• Cre­at­ing Linked Data Mor­pho­log­i­cal Lan­guage Resources with MMoOn — The Hebrew Mor­pheme Inven­to­ryIn: The 10th edi­tion of the Lan­guage Resources and Eval­u­a­tion Con­fer­ence, 23–28 May 2016, Slove­nia, Portoro{\v{z}}Bet­ti­na Klimek, Natanael Arndt, Sebas­t­ian Krause and Tim­o­theus Arndt

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The devel­op­ment of stan­dard mod­els for describ­ing gen­er­al lex­i­cal resources has led to the emer­gence of numer­ous lex­i­cal datasets of var­i­ous lan­guages in the Seman­tic Web. How­ev­er, there are no mod­els that describe the domain of mor­phol­o­gy in a sim­i­lar man­ner. As a result, there are hard­ly any lan­guage resources of mor­phemic data avail­able in RDF to date. This paper presents the cre­ation of the Hebrew Mor­pheme Inven­to­ry from a man­u­al­ly com­piled tab­u­lar dataset com­pris­ing around 52.000 entries. It is an ongo­ing effort of rep­re­sent­ing the lex­emes, word-forms and mor­phologi­gal pat­terns togeth­er with their under­ly­ing rela­tions based on the new­ly cre­at­ed Mul­ti­lin­gual Mor­pheme Ontol­ogy (MMoOn). It will be shown how seg­ment­ed Hebrew lan­guage data can be gran­u­lar­ly described in a Linked Data for­mat, thus, serv­ing as an exem­plary case for cre­at­ing mor­pheme inven­to­ries of any inflec­tion­al lan­guage with MMoOn. The result­ing dataset is described a) accord­ing to the struc­ture of the under­ly­ing data for­mat, b) with respect to the Hebrew lan­guage char­ac­ter­is­tic of build­ing word-forms direct­ly from roots, c) by exem­pli­fy­ing how inflec­tion­al infor­ma­tion is real­ized and d) with regard to its enrich­ment with exter­nal links to sense resources.

  @inproceedings{MMoOn_heb,
  abstract = {The devel­op­ment of stan­dard mod­els for describ­ing gen­er­al lex­i­cal resources has led to the emer­gence of numer­ous lex­i­cal datasets of var­i­ous lan­guages in the Seman­tic Web. How­ev­er, there are no mod­els that describe the domain of mor­phol­o­gy in a sim­i­lar man­ner. As a result, there are hard­ly any lan­guage resources of mor­phemic data avail­able in RDF to date. This paper presents the cre­ation of the Hebrew Mor­pheme Inven­to­ry from a man­u­al­ly com­piled tab­u­lar dataset com­pris­ing around 52.000 entries. It is an ongo­ing effort of rep­re­sent­ing the lex­emes, word-forms and mor­phologi­gal pat­terns togeth­er with their under­ly­ing rela­tions based on the new­ly cre­at­ed Mul­ti­lin­gual Mor­pheme Ontol­ogy (MMoOn). It will be shown how seg­ment­ed Hebrew lan­guage data can be gran­u­lar­ly described in a Linked Data for­mat, thus, serv­ing as an exem­plary case for cre­at­ing mor­pheme inven­to­ries of any inflec­tion­al lan­guage with MMoOn. The result­ing dataset is described a) accord­ing to the struc­ture of the under­ly­ing data for­mat, b) with respect to the Hebrew lan­guage char­ac­ter­is­tic of build­ing word-forms direct­ly from roots, c) by exem­pli­fy­ing how inflec­tion­al infor­ma­tion is real­ized and d) with regard to its enrich­ment with exter­nal links to sense resources.},
  author = {Klimek, Bet­ti­na and Arndt, Natanael and Krause, Sebas­t­ian and Arndt, Tim­o­theus},
  book­ti­tle = {The 10th edi­tion of the Lan­guage Resources and Eval­u­a­tion Con­fer­ence, 23–28 May 2016, Slove­nia, Portoro{\v{z}}},
  key­words = {sys:relevantFor:infai},
  month = {05},
  title = {Cre­at­ing Linked Data Mor­pho­log­i­cal Lan­guage Resources with MMoOn — The Hebrew Mor­pheme Inven­to­ry},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 MMoOn_heb
  %A Klimek, Bet­ti­na
  %A Arndt, Natanael
  %A Krause, Sebas­t­ian
  %A Arndt, Tim­o­theus
  %B The 10th edi­tion of the Lan­guage Resources and Eval­u­a­tion Con­fer­ence, 23–28 May 2016, Slove­nia, Portoro{\v{z}}
  %D 2016
  %T Cre­at­ing Linked Data Mor­pho­log­i­cal Lan­guage Resources with MMoOn — The Hebrew Mor­pheme Inven­to­ry
  %U http://svn.aksw.org/papers/2016/LREC_MMoOnHebrew/public.pdf
  %X The devel­op­ment of stan­dard mod­els for describ­ing gen­er­al lex­i­cal resources has led to the emer­gence of numer­ous lex­i­cal datasets of var­i­ous lan­guages in the Seman­tic Web. How­ev­er, there are no mod­els that describe the domain of mor­phol­o­gy in a sim­i­lar man­ner. As a result, there are hard­ly any lan­guage resources of mor­phemic data avail­able in RDF to date. This paper presents the cre­ation of the Hebrew Mor­pheme Inven­to­ry from a man­u­al­ly com­piled tab­u­lar dataset com­pris­ing around 52.000 entries. It is an ongo­ing effort of rep­re­sent­ing the lex­emes, word-forms and mor­phologi­gal pat­terns togeth­er with their under­ly­ing rela­tions based on the new­ly cre­at­ed Mul­ti­lin­gual Mor­pheme Ontol­ogy (MMoOn). It will be shown how seg­ment­ed Hebrew lan­guage data can be gran­u­lar­ly described in a Linked Data for­mat, thus, serv­ing as an exem­plary case for cre­at­ing mor­pheme inven­to­ries of any inflec­tion­al lan­guage with MMoOn. The result­ing dataset is described a) accord­ing to the struc­ture of the under­ly­ing data for­mat, b) with respect to the Hebrew lan­guage char­ac­ter­is­tic of build­ing word-forms direct­ly from roots, c) by exem­pli­fy­ing how inflec­tion­al infor­ma­tion is real­ized and d) with regard to its enrich­ment with exter­nal links to sense resources.
  

• Towards {V}ersioning of {A}rbitrary {RDF} {D}ataIn: 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016), SEMAN­TiCS ’16. Leipzig, Ger­manyMar­vin Frommhold, Rub{{é}}n Navar­ro Piris, Natanael Arndt, Sebas­t­ian Tramp, Niklas Petersen and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Coher­ent and con­sis­tent track­ing of prove­nance data and in par­tic­u­lar update his­to­ry infor­ma­tion is a cru­cial build­ing block for any seri­ous infor­ma­tion sys­tem archi­tec­ture. Ver­sion Con­trol Sys­tems can be a part of such an archi­tec­ture enabling users to query and manip­u­late ver­sion­ing infor­ma­tion as well as con­tent revi­sions. In this paper, we intro­duce an RDF ver­sion­ing approach as a foun­da­tion for a full fea­tured RDF Ver­sion Con­trol Sys­tem. We argue that such a sys­tem needs sup­port for all con­cepts of the RDF spec­i­fi­ca­tion includ­ing sup­port for RDF datasets and blank nodes. Fur­ther­more, we placed spe­cial empha­sis on the pro­tec­tion against unper­ceived his­to­ry manip­u­la­tion by hash­ing the result­ing patch­es. In addi­tion to the con­cep­tu­al analy­sis and an RDF vocab­u­lary for rep­re­sent­ing ver­sion­ing infor­ma­tion, we present a mature imple­men­ta­tion which cap­tures ver­sion­ing infor­ma­tion for changes to arbi­trary RDF datasets.

  @inproceedings{towardsversioning,
  abstract = {Coher­ent and con­sis­tent track­ing of prove­nance data and in par­tic­u­lar update his­to­ry infor­ma­tion is a cru­cial build­ing block for any seri­ous infor­ma­tion sys­tem archi­tec­ture. Ver­sion Con­trol Sys­tems can be a part of such an archi­tec­ture enabling users to query and manip­u­late ver­sion­ing infor­ma­tion as well as con­tent revi­sions. In this paper, we intro­duce an RDF ver­sion­ing approach as a foun­da­tion for a full fea­tured RDF Ver­sion Con­trol Sys­tem. We argue that such a sys­tem needs sup­port for all con­cepts of the RDF spec­i­fi­ca­tion includ­ing sup­port for RDF datasets and blank nodes. Fur­ther­more, we placed spe­cial empha­sis on the pro­tec­tion against unper­ceived his­to­ry manip­u­la­tion by hash­ing the result­ing patch­es. In addi­tion to the con­cep­tu­al analy­sis and an RDF vocab­u­lary for rep­re­sent­ing ver­sion­ing infor­ma­tion, we present a mature imple­men­ta­tion which cap­tures ver­sion­ing infor­ma­tion for changes to arbi­trary RDF datasets.},
  address = {Leipzig, Ger­many},
  author = {Frommhold, Mar­vin and Piris, Rub{{é}}n Navar­ro and Arndt, Natanael and Tramp, Sebas­t­ian and Petersen, Niklas and Mar­tin, Michael},
  book­ti­tle = {12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)},
  key­words = {lucid},
  month = {09},
  series = {SEMAN­TiCS ’16},
  title = {Towards {V}ersioning of {A}rbitrary {RDF} {D}ata},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 towardsver­sion­ing
  %A Frommhold, Mar­vin
  %A Piris, Rub{{é}}n Navar­ro
  %A Arndt, Natanael
  %A Tramp, Sebas­t­ian
  %A Petersen, Niklas
  %A Mar­tin, Michael
  %B 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)
  %C Leipzig, Ger­many
  %D 2016
  %T Towards {V}ersioning of {A}rbitrary {RDF} {D}ata
  %U https://www.researchgate.net/publication/303924732_Towards_Versioning_of_Arbitrary_RDF_Data
  %X Coher­ent and con­sis­tent track­ing of prove­nance data and in par­tic­u­lar update his­to­ry infor­ma­tion is a cru­cial build­ing block for any seri­ous infor­ma­tion sys­tem archi­tec­ture. Ver­sion Con­trol Sys­tems can be a part of such an archi­tec­ture enabling users to query and manip­u­late ver­sion­ing infor­ma­tion as well as con­tent revi­sions. In this paper, we intro­duce an RDF ver­sion­ing approach as a foun­da­tion for a full fea­tured RDF Ver­sion Con­trol Sys­tem. We argue that such a sys­tem needs sup­port for all con­cepts of the RDF spec­i­fi­ca­tion includ­ing sup­port for RDF datasets and blank nodes. Fur­ther­more, we placed spe­cial empha­sis on the pro­tec­tion against unper­ceived his­to­ry manip­u­la­tion by hash­ing the result­ing patch­es. In addi­tion to the con­cep­tu­al analy­sis and an RDF vocab­u­lary for rep­re­sent­ing ver­sion­ing infor­ma­tion, we present a mature imple­men­ta­tion which cap­tures ver­sion­ing infor­ma­tion for changes to arbi­trary RDF datasets.
  

• Pub­lish and {S}ubscribe for {RDF} in {E}nterprise {V}alue {N}etworksIn: Pro­ceed­ings of the Work­shop on Linked Data on the Web co-locat­ed with the 25th Inter­na­tion­al World Wide Web Con­fer­ence (WWW 2016)Mar­vin Frommhold, Natanael Arndt, Sebas­t­ian Tramp and Niklas Petersen

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Shar­ing infor­ma­tion secure­ly between busi­ness part­ners and man­ag­ing large sup­ply chains effi­cient­ly will be a cru­cial com­pet­i­tive advan­tage for enter­pris­es in the near future. In this paper, we present a con­cept that allows for build­ing val­ue net­works between busi­ness part­ners in a dis­trib­uted man­ner. Com­pa­nies are able to pub­lish Linked Data which par­tic­i­pants of the net­work can clone and sub­scribe to. Sub­scribers get noti­fied as soon as new infor­ma­tion becomes avail­able. This pro­vides a tech­ni­cal infra­struc­ture for busi­ness com­mu­ni­ca­tion acts such as sup­ply chain com­mu­ni­ca­tion or mas­ter data man­age­ment. In addi­tion to the con­cep­tu­al analy­sis, we pro­vide an imple­men­ta­tion enabling com­pa­nies to cre­ate such dynam­ic seman­tic val­ue networks.

  @inproceedings{frommhold-m-pubsub-2016,
  abstract = {Shar­ing infor­ma­tion secure­ly between busi­ness part­ners and man­ag­ing large sup­ply chains effi­cient­ly will be a cru­cial com­pet­i­tive advan­tage for enter­pris­es in the near future. In this paper, we present a con­cept that allows for build­ing val­ue net­works between busi­ness part­ners in a dis­trib­uted man­ner. Com­pa­nies are able to pub­lish Linked Data which par­tic­i­pants of the net­work can clone and sub­scribe to. Sub­scribers get noti­fied as soon as new infor­ma­tion becomes avail­able. This pro­vides a tech­ni­cal infra­struc­ture for busi­ness com­mu­ni­ca­tion acts such as sup­ply chain com­mu­ni­ca­tion or mas­ter data man­age­ment. In addi­tion to the con­cep­tu­al analy­sis, we pro­vide an imple­men­ta­tion enabling com­pa­nies to cre­ate such dynam­ic seman­tic val­ue net­works.},
  author = {Frommhold, Mar­vin and Arndt, Natanael and Tramp, Sebas­t­ian and Petersen, Niklas},
  book­ti­tle = {Pro­ceed­ings of the Work­shop on Linked Data on the Web co-locat­ed with the 25th Inter­na­tion­al World Wide Web Con­fer­ence (WWW 2016)},
  key­words = {sys:relevantFor:infai},
  month = {04},
  title = {Pub­lish and {S}ubscribe for {RDF} in {E}nterprise {V}alue {N}etworks},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 frommhold-m-pub­sub-2016
  %A Frommhold, Mar­vin
  %A Arndt, Natanael
  %A Tramp, Sebas­t­ian
  %A Petersen, Niklas
  %B Pro­ceed­ings of the Work­shop on Linked Data on the Web co-locat­ed with the 25th Inter­na­tion­al World Wide Web Con­fer­ence (WWW 2016)
  %D 2016
  %T Pub­lish and {S}ubscribe for {RDF} in {E}nterprise {V}alue {N}etworks
  %U http://events.linkeddata.org/ldow2016/papers/LDOW2016_paper_05.pdf
  %X Shar­ing infor­ma­tion secure­ly between busi­ness part­ners and man­ag­ing large sup­ply chains effi­cient­ly will be a cru­cial com­pet­i­tive advan­tage for enter­pris­es in the near future. In this paper, we present a con­cept that allows for build­ing val­ue net­works between busi­ness part­ners in a dis­trib­uted man­ner. Com­pa­nies are able to pub­lish Linked Data which par­tic­i­pants of the net­work can clone and sub­scribe to. Sub­scribers get noti­fied as soon as new infor­ma­tion becomes avail­able. This pro­vides a tech­ni­cal infra­struc­ture for busi­ness com­mu­ni­ca­tion acts such as sup­ply chain com­mu­ni­ca­tion or mas­ter data man­age­ment. In addi­tion to the con­cep­tu­al analy­sis, we pro­vide an imple­men­ta­tion enabling com­pa­nies to cre­ate such dynam­ic seman­tic val­ue networks.
  

• Dis­trib­uted Col­lab­o­ra­tion on RDF Datasets Using Git: Towards the Quit StoreIn: 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016), SEMAN­TiCS ’16. Leipzig, Ger­many — ISBN 978–1‑4503–4752‑5Natanael Arndt, Nor­man Radtke and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Col­lab­o­ra­tion is one of the most impor­tant top­ics regard­ing the evo­lu­tion of the World Wide Web and thus also for the Web of Data. In sce­nar­ios of dis­trib­uted col­lab­o­ra­tion on datasets it is nec­es­sary to pro­vide sup­port for mul­ti­ple dif­fer­ent ver­sions of datasets to exist simul­ta­ne­ous­ly, while also pro­vid­ing sup­port for merg­ing diverged datasets. In this paper we present an approach that uses SPARQL 1.1 in com­bi­na­tion with the ver­sion con­trol sys­tem Git, that cre­ates com­mits for all changes applied to an RDF dataset con­tain­ing mul­ti­ple named graphs. Fur­ther the oper­a­tions pro­vid­ed by Git are used to dis­trib­ute the com­mits among col­lab­o­ra­tors and merge diverged ver­sions of the dataset. We show the advan­tages of (pub­lic) Git repos­i­to­ries for RDF datasets and how this rep­re­sents a way to col­lab­o­rate on RDF data and con­sume it. With SPARQL 1.1 and Git in com­bi­na­tion, users are giv­en sev­er­al oppor­tu­ni­ties to par­tic­i­pate in the evo­lu­tion of RDF data.

  @inproceedings{arndt-n-2016–quit,
  abstract = {Col­lab­o­ra­tion is one of the most impor­tant top­ics regard­ing the evo­lu­tion of the World Wide Web and thus also for the Web of Data. In sce­nar­ios of dis­trib­uted col­lab­o­ra­tion on datasets it is nec­es­sary to pro­vide sup­port for mul­ti­ple dif­fer­ent ver­sions of datasets to exist simul­ta­ne­ous­ly, while also pro­vid­ing sup­port for merg­ing diverged datasets. In this paper we present an approach that uses SPARQL 1.1 in com­bi­na­tion with the ver­sion con­trol sys­tem Git, that cre­ates com­mits for all changes applied to an RDF dataset con­tain­ing mul­ti­ple named graphs. Fur­ther the oper­a­tions pro­vid­ed by Git are used to dis­trib­ute the com­mits among col­lab­o­ra­tors and merge diverged ver­sions of the dataset. We show the advan­tages of (pub­lic) Git repos­i­to­ries for RDF datasets and how this rep­re­sents a way to col­lab­o­rate on RDF data and con­sume it. With SPARQL 1.1 and Git in com­bi­na­tion, users are giv­en sev­er­al oppor­tu­ni­ties to par­tic­i­pate in the evo­lu­tion of RDF data.},
  address = {Leipzig, Ger­many},
  author = {Arndt, Natanael and Radtke, Nor­man and Mar­tin, Michael},
  book­ti­tle = {12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)},
  key­words = {quit},
  month = {09},
  series = {SEMAN­TiCS ’16},
  title = {Dis­trib­uted Col­lab­o­ra­tion on RDF Datasets Using Git: Towards the Quit Store},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2016–quit
  %A Arndt, Natanael
  %A Radtke, Nor­man
  %A Mar­tin, Michael
  %B 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)
  %C Leipzig, Ger­many
  %D 2016
  %R 10.1145/2993318.2993328
  %T Dis­trib­uted Col­lab­o­ra­tion on RDF Datasets Using Git: Towards the Quit Store
  %U https://svn.aksw.org/papers/2016/Semantics_Quit/public.pdf
  %X Col­lab­o­ra­tion is one of the most impor­tant top­ics regard­ing the evo­lu­tion of the World Wide Web and thus also for the Web of Data. In sce­nar­ios of dis­trib­uted col­lab­o­ra­tion on datasets it is nec­es­sary to pro­vide sup­port for mul­ti­ple dif­fer­ent ver­sions of datasets to exist simul­ta­ne­ous­ly, while also pro­vid­ing sup­port for merg­ing diverged datasets. In this paper we present an approach that uses SPARQL 1.1 in com­bi­na­tion with the ver­sion con­trol sys­tem Git, that cre­ates com­mits for all changes applied to an RDF dataset con­tain­ing mul­ti­ple named graphs. Fur­ther the oper­a­tions pro­vid­ed by Git are used to dis­trib­ute the com­mits among col­lab­o­ra­tors and merge diverged ver­sions of the dataset. We show the advan­tages of (pub­lic) Git repos­i­to­ries for RDF datasets and how this rep­re­sents a way to col­lab­o­rate on RDF data and con­sume it. With SPARQL 1.1 and Git in com­bi­na­tion, users are giv­en sev­er­al oppor­tu­ni­ties to par­tic­i­pate in the evo­lu­tion of RDF data.
  %@ 978–1‑4503–4752‑5
  

• Using DevOps Prin­ci­ples to Con­tin­u­ous­ly Mon­i­tor RDF Data Qual­i­tyIn: 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016), CEUR Work­shop Pro­ceed­ings. Leipzig, Ger­manyRoy Meiss­ner and Kurt Junghanns

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  One approach to con­tin­u­ous­ly achieve a cer­tain data qual­i­ty lev­el is to use an inte­gra­tion pipeline that con­tin­u­ous­ly checks and mon­i­tors the qual­i­ty of a data set accord­ing to defined met­rics. This approach is inspired by Con­tin­u­ous Inte­gra­tion pipelines, that have been intro­duced in the area of soft­ware devel­op­ment and DevOps to per­form con­tin­u­ous source code checks. By inves­ti­gat­ing in pos­si­ble tools to use and dis­cussing the spe­cif­ic require­ments for RDF data sets, an inte­gra­tion pipeline is derived that joins cur­rent approach­es of the areas of soft­ware-devel­op­ment and seman­tic-web as well as reuses exist­ing tools. As these tools have not been built explic­it­ly for CI usage, we eval­u­ate their usabil­i­ty and pro­pose pos­si­ble workarounds and improve­ments. Fur­ther­more, a real-world usage sce­nario is dis­cussed, out­lin­ing the ben­e­fit of the usage of such a pipeline.

  @inproceedings{meissner-semantics-2016-DevOps,
  abstract = {One approach to con­tin­u­ous­ly achieve a cer­tain data qual­i­ty lev­el is to use an inte­gra­tion pipeline that con­tin­u­ous­ly checks and mon­i­tors the qual­i­ty of a data set accord­ing to defined met­rics. This approach is inspired by Con­tin­u­ous Inte­gra­tion pipelines, that have been intro­duced in the area of soft­ware devel­op­ment and DevOps to per­form con­tin­u­ous source code checks. By inves­ti­gat­ing in pos­si­ble tools to use and dis­cussing the spe­cif­ic require­ments for RDF data sets, an inte­gra­tion pipeline is derived that joins cur­rent approach­es of the areas of soft­ware-devel­op­ment and seman­tic-web as well as reuses exist­ing tools. As these tools have not been built explic­it­ly for CI usage, we eval­u­ate their usabil­i­ty and pro­pose pos­si­ble workarounds and improve­ments. Fur­ther­more, a real-world usage sce­nario is dis­cussed, out­lin­ing the ben­e­fit of the usage of such a pipeline.},
  address = {Leipzig, Ger­many},
  author = {Meiss­ner, Roy and Jung­hanns, Kurt},
  book­ti­tle = {12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)},
  key­words = {es},
  month = {09},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {Using DevOps Prin­ci­ples to Con­tin­u­ous­ly Mon­i­tor RDF Data Qual­i­ty},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 meiss­ner-seman­tics-2016-DevOps
  %A Meiss­ner, Roy
  %A Jung­hanns, Kurt
  %B 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)
  %C Leipzig, Ger­many
  %D 2016
  %R 10.1145/2993318.2993351
  %T Using DevOps Prin­ci­ples to Con­tin­u­ous­ly Mon­i­tor RDF Data Qual­i­ty
  %U https://svn.aksw.org/papers/2016/Semantics_DevOps/public.pdf
  %X One approach to con­tin­u­ous­ly achieve a cer­tain data qual­i­ty lev­el is to use an inte­gra­tion pipeline that con­tin­u­ous­ly checks and mon­i­tors the qual­i­ty of a data set accord­ing to defined met­rics. This approach is inspired by Con­tin­u­ous Inte­gra­tion pipelines, that have been intro­duced in the area of soft­ware devel­op­ment and DevOps to per­form con­tin­u­ous source code checks. By inves­ti­gat­ing in pos­si­ble tools to use and dis­cussing the spe­cif­ic require­ments for RDF data sets, an inte­gra­tion pipeline is derived that joins cur­rent approach­es of the areas of soft­ware-devel­op­ment and seman­tic-web as well as reuses exist­ing tools. As these tools have not been built explic­it­ly for CI usage, we eval­u­ate their usabil­i­ty and pro­pose pos­si­ble workarounds and improve­ments. Fur­ther­more, a real-world usage sce­nario is dis­cussed, out­lin­ing the ben­e­fit of the usage of such a pipeline.
  

• OntoWi­ki 1.0: 10 Years of Devel­op­ment — What’s New in OntoWi­kiIn: Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16), CEUR Work­shop Pro­ceed­ings. Leipzig, Ger­manyPhilipp Frischmuth, Natanael Arndt and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In this demon­stra­tion (with sup­port­ive poster) we present the seman­tic data wiki OntoWi­ki, which was released in ver­sion 1.0 just recent­ly. We focus on the changes intro­duced to the tool in the lat­est release and show­case the gener­ic data wiki, improve­ments we made with regard to the doc­u­men­ta­tion as well as three suc­cess sto­ries where OntoWi­ki was adapt­ed and deployed.

  @inproceedings{frischmuth-semantics-2016-ontowiki,
  abstract = {In this demon­stra­tion (with sup­port­ive poster) we present the seman­tic data wiki OntoWi­ki, which was released in ver­sion 1.0 just recent­ly. We focus on the changes intro­duced to the tool in the lat­est release and show­case the gener­ic data wiki, improve­ments we made with regard to the doc­u­men­ta­tion as well as three suc­cess sto­ries where OntoWi­ki was adapt­ed and deployed.},
  address = {Leipzig, Ger­many},
  author = {Frischmuth, Philipp and Arndt, Natanael and Mar­tin, Michael},
  book­ti­tle = {Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16)},
  key­words = {es},
  month = {09},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {OntoWi­ki 1.0: 10 Years of Devel­op­ment — What’s New in OntoWi­ki},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 frischmuth-seman­tics-2016-ontowi­ki
  %A Frischmuth, Philipp
  %A Arndt, Natanael
  %A Mar­tin, Michael
  %B Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16)
  %C Leipzig, Ger­many
  %D 2016
  %T OntoWi­ki 1.0: 10 Years of Devel­op­ment — What’s New in OntoWi­ki
  %U http://ceur-ws.org/Vol-1695/paper11.pdf
  %X In this demon­stra­tion (with sup­port­ive poster) we present the seman­tic data wiki OntoWi­ki, which was released in ver­sion 1.0 just recent­ly. We focus on the changes intro­duced to the tool in the lat­est release and show­case the gener­ic data wiki, improve­ments we made with regard to the doc­u­men­ta­tion as well as three suc­cess sto­ries where OntoWi­ki was adapt­ed and deployed.
  

• Exe­cut­ing SPARQL queries over Mapped Doc­u­ment Stores with SparqlMap‑MIn: 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016), SEMAN­TiCS ’16. Leipzig, Ger­manyJ{ö}rg Unbe­hauen and Michael Martin

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  With the increas­ing adop­tion of NoSQL data base sys­tems like Mon­goDB or CouchDB more and more appli­ca­tions store struc­tured data accord­ing to a non-rela­tion­al, doc­u­ment ori­ent­ed mod­el. Expos­ing this struc­tured data as Linked Data is cur­rent­ly inhib­it­ed by a lack of stan­dards as well as tools and requires the imple­men­ta­tion of cus­tom solu­tions. While recent efforts aim at express­ing trans­for­ma­tions of such data mod­els into RDF in a stan­dard­ized man­ner, there is a lack of approach­es which facil­i­tate SPARQL exe­cu­tion over mapped non-rela­tion­al data sources. With SparqlMap‑M we show how dynam­ic SPARQL access to non-rela­tion­al data can be achieved. SparqlMap‑M is an exten­sion to our SPAR­QL-to-SQL rewriter Spar­qlMap that per­forms a (par­tial) trans­for­ma­tion of SPARQL queries by using a rela­tion­al abstrac­tion over a doc­u­ment store. Fur­ther, dupli­cate data in the doc­u­ment store is used to reduce the num­ber of joins and cus­tom opti­miza­tions are intro­duced. Our show­case sce­nario employs the Berlin SPARQL Bench­mark (BSBM) with dif­fer­ent adap­tions to a doc­u­ment data mod­el. We use this sce­nario to demon­strate the via­bil­i­ty of our approach and com­pare it to dif­fer­ent Mon­goDB setups and native SQL.

  @inproceedings{unbehauen-semantics-2016-sparqlmap‑m,
  abstract = {With the increas­ing adop­tion of NoSQL data base sys­tems like Mon­goDB or CouchDB more and more appli­ca­tions store struc­tured data accord­ing to a non-rela­tion­al, doc­u­ment ori­ent­ed mod­el. Expos­ing this struc­tured data as Linked Data is cur­rent­ly inhib­it­ed by a lack of stan­dards as well as tools and requires the imple­men­ta­tion of cus­tom solu­tions. While recent efforts aim at express­ing trans­for­ma­tions of such data mod­els into RDF in a stan­dard­ized man­ner, there is a lack of approach­es which facil­i­tate SPARQL exe­cu­tion over mapped non-rela­tion­al data sources. With SparqlMap‑M we show how dynam­ic SPARQL access to non-rela­tion­al data can be achieved. SparqlMap‑M is an exten­sion to our SPAR­QL-to-SQL rewriter Spar­qlMap that per­forms a (par­tial) trans­for­ma­tion of SPARQL queries by using a rela­tion­al abstrac­tion over a doc­u­ment store. Fur­ther, dupli­cate data in the doc­u­ment store is used to reduce the num­ber of joins and cus­tom opti­miza­tions are intro­duced. Our show­case sce­nario employs the Berlin SPARQL Bench­mark (BSBM) with dif­fer­ent adap­tions to a doc­u­ment data mod­el. We use this sce­nario to demon­strate the via­bil­i­ty of our approach and com­pare it to dif­fer­ent Mon­goDB setups and native SQL.},
  address = {Leipzig, Ger­many},
  author = {Unbe­hauen, J{ö}rg and Mar­tin, Michael},
  book­ti­tle = {12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)},
  key­words = {sys:relevantFor:infai},
  month = {09},
  series = {SEMAN­TiCS ’16},
  title = {Exe­cut­ing SPARQL queries over Mapped Doc­u­ment Stores with SparqlMap‑M},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 unbe­hauen-seman­tics-2016-spar­qlmap‑m
  %A Unbe­hauen, J{ö}rg
  %A Mar­tin, Michael
  %B 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings (SEMAN­TiCS 2016)
  %C Leipzig, Ger­many
  %D 2016
  %T Exe­cut­ing SPARQL queries over Mapped Doc­u­ment Stores with SparqlMap‑M
  %X With the increas­ing adop­tion of NoSQL data base sys­tems like Mon­goDB or CouchDB more and more appli­ca­tions store struc­tured data accord­ing to a non-rela­tion­al, doc­u­ment ori­ent­ed mod­el. Expos­ing this struc­tured data as Linked Data is cur­rent­ly inhib­it­ed by a lack of stan­dards as well as tools and requires the imple­men­ta­tion of cus­tom solu­tions. While recent efforts aim at express­ing trans­for­ma­tions of such data mod­els into RDF in a stan­dard­ized man­ner, there is a lack of approach­es which facil­i­tate SPARQL exe­cu­tion over mapped non-rela­tion­al data sources. With SparqlMap‑M we show how dynam­ic SPARQL access to non-rela­tion­al data can be achieved. SparqlMap‑M is an exten­sion to our SPAR­QL-to-SQL rewriter Spar­qlMap that per­forms a (par­tial) trans­for­ma­tion of SPARQL queries by using a rela­tion­al abstrac­tion over a doc­u­ment store. Fur­ther, dupli­cate data in the doc­u­ment store is used to reduce the num­ber of joins and cus­tom opti­miza­tions are intro­duced. Our show­case sce­nario employs the Berlin SPARQL Bench­mark (BSBM) with dif­fer­ent adap­tions to a doc­u­ment data mod­el. We use this sce­nario to demon­strate the via­bil­i­ty of our approach and com­pare it to dif­fer­ent Mon­goDB setups and native SQL.
  

• Enforc­ing scal­able autho­riza­tion on SPARQL queriesIn: Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16), CEUR Work­shop Pro­ceed­ings. Leipzig, Ger­manyJ{ö}rg Unbe­hauen, Mar­vin Frommhold and Michael Martin

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  With the adop­tion of the Linked Data Par­a­digm in the enter­prise con­text effec­tive mea­sures for secur­ing sen­si­tive data are in high­er demand than ever before. Exem­plary, inte­grat­ing enter­prise sys­tems con­tain­ing mil­lions of assets and fine gran­u­lar access con­trol rules with large pub­lic back­ground knowl­edge graphs leads to both a high num­ber of triples and a high num­ber of access con­trol axioms, which tra­di­tion­al meth­ods strug­gle to process. There­fore, we intro­duce nov­el approach­es for enforc­ing access con­trol on SPARQL queries and eval­u­ate their imple­men­ta­tion using an exten­sion of the Berlin SPARQL Bench­mark. Addi­tion­al­ly, we dis­cuss strengths and weak­ness­es of the respec­tive approach­es and out­line future work.

  @inproceedings{unbehauen-semantics-2016-auth,
  abstract = {With the adop­tion of the Linked Data Par­a­digm in the enter­prise con­text effec­tive mea­sures for secur­ing sen­si­tive data are in high­er demand than ever before. Exem­plary, inte­grat­ing enter­prise sys­tems con­tain­ing mil­lions of assets and fine gran­u­lar access con­trol rules with large pub­lic back­ground knowl­edge graphs leads to both a high num­ber of triples and a high num­ber of access con­trol axioms, which tra­di­tion­al meth­ods strug­gle to process. There­fore, we intro­duce nov­el approach­es for enforc­ing access con­trol on SPARQL queries and eval­u­ate their imple­men­ta­tion using an exten­sion of the Berlin SPARQL Bench­mark. Addi­tion­al­ly, we dis­cuss strengths and weak­ness­es of the respec­tive approach­es and out­line future work.},
  address = {Leipzig, Ger­many},
  author = {Unbe­hauen, J{ö}rg and Frommhold, Mar­vin and Mar­tin, Michael},
  book­ti­tle = {Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16)},
  key­words = {frommhold},
  month = {09},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {Enforc­ing scal­able autho­riza­tion on SPARQL queries},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 unbe­hauen-seman­tics-2016-auth
  %A Unbe­hauen, J{ö}rg
  %A Frommhold, Mar­vin
  %A Mar­tin, Michael
  %B Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16)
  %C Leipzig, Ger­many
  %D 2016
  %T Enforc­ing scal­able autho­riza­tion on SPARQL queries
  %X With the adop­tion of the Linked Data Par­a­digm in the enter­prise con­text effec­tive mea­sures for secur­ing sen­si­tive data are in high­er demand than ever before. Exem­plary, inte­grat­ing enter­prise sys­tems con­tain­ing mil­lions of assets and fine gran­u­lar access con­trol rules with large pub­lic back­ground knowl­edge graphs leads to both a high num­ber of triples and a high num­ber of access con­trol axioms, which tra­di­tion­al meth­ods strug­gle to process. There­fore, we intro­duce nov­el approach­es for enforc­ing access con­trol on SPARQL queries and eval­u­ate their imple­men­ta­tion using an exten­sion of the Berlin SPARQL Bench­mark. Addi­tion­al­ly, we dis­cuss strengths and weak­ness­es of the respec­tive approach­es and out­line future work.
  

• Open­Re­search: Col­lab­o­ra­tive Man­age­ment of Schol­ar­ly Com­mu­ni­ca­tion Meta­da­taIn: Eva Blomqvist, Fabio Vitali and Pao­lo Cian­car­i­ni (eds.): Pro­ceed­ings of 20th Inter­na­tion­al Con­fer­ence on Knowl­edge Engi­neer­ing and Knowl­edge Man­age­ment (EKAW’2016), Lec­ture Notes in Com­put­er Sci­ence. Hei­del­berg : Springer Ver­lag — ISBN 978–3‑319–49003‑8Sahar Vah­dati, Natanael Arndt, S{ö}ren Auer and Christoph Lange

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Schol­ars often need to search for match­ing, high-pro­file sci­en­tif­ic events to pub­lish their research results. Infor­ma­tion about top­i­cal focus and qual­i­ty of events is not made suf­fi­cient­ly explic­it in the exist­ing com­mu­ni­ca­tion chan­nels where events are announced. There­fore, schol­ars have to spend a lot of time on read­ing and assess­ing calls for papers but might still not find the right event. Addi­tion­al­ly, events might be over­looked because of the large num­ber of events announced every day. We intro­duce Open­Re­search, a crowd sourc­ing plat­form that sup­ports researchers in col­lect­ing, orga­niz­ing, shar­ing and dis­sem­i­nat­ing infor­ma­tion about sci­en­tif­ic events in a struc­tured way. It enables qual­i­ty-relat­ed queries over a mul­ti­dis­ci­pli­nary col­lec­tion of events accord­ing to a broad range of cri­te­ria such as accep­tance rate, sus­tain­abil­i­ty of event series, and rep­u­ta­tion of peo­ple and orga­ni­za­tions. Events are rep­re­sent­ed in dif­fer­ent views using map exten­sions, cal­en­dar and time-line visu­al­iza­tions. We have sys­tem­at­i­cal­ly eval­u­at­ed the time­li­ness, usabil­i­ty and per­for­mance of OpenResearch.

  @inproceedings{vahdati-2016-openresearch,
  abstract = {Schol­ars often need to search for match­ing, high-pro­file sci­en­tif­ic events to pub­lish their research results. Infor­ma­tion about top­i­cal focus and qual­i­ty of events is not made suf­fi­cient­ly explic­it in the exist­ing com­mu­ni­ca­tion chan­nels where events are announced. There­fore, schol­ars have to spend a lot of time on read­ing and assess­ing calls for papers but might still not find the right event. Addi­tion­al­ly, events might be over­looked because of the large num­ber of events announced every day. We intro­duce Open­Re­search, a crowd sourc­ing plat­form that sup­ports researchers in col­lect­ing, orga­niz­ing, shar­ing and dis­sem­i­nat­ing infor­ma­tion about sci­en­tif­ic events in a struc­tured way. It enables qual­i­ty-relat­ed queries over a mul­ti­dis­ci­pli­nary col­lec­tion of events accord­ing to a broad range of cri­te­ria such as accep­tance rate, sus­tain­abil­i­ty of event series, and rep­u­ta­tion of peo­ple and orga­ni­za­tions. Events are rep­re­sent­ed in dif­fer­ent views using map exten­sions, cal­en­dar and time-line visu­al­iza­tions. We have sys­tem­at­i­cal­ly eval­u­at­ed the time­li­ness, usabil­i­ty and per­for­mance of Open­Re­search.},
  address = {Hei­del­berg},
  author = {Vah­dati, Sahar and Arndt, Natanael and Auer, S{ö}ren and Lange, Christoph},
  book­ti­tle = {Pro­ceed­ings of 20th Inter­na­tion­al Con­fer­ence on Knowl­edge Engi­neer­ing and Knowl­edge Man­age­ment (EKAW’2016)},
  cross­ref = {ekaw2016},
  edi­tor = {Blomqvist, Eva and Vitali, Fabio and Cian­car­i­ni, Pao­lo},
  key­words = {research},
  month = 11,
  num­ber = 10024,
  pub­lish­er = {Springer Ver­lag},
  series = {Lec­ture Notes in Com­put­er Sci­ence},
  title = {Open­Re­search: Col­lab­o­ra­tive Man­age­ment of Schol­ar­ly Com­mu­ni­ca­tion Meta­da­ta},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 vah­dati-2016-open­re­search
  %A Vah­dati, Sahar
  %A Arndt, Natanael
  %A Auer, S{ö}ren
  %A Lange, Christoph
  %B Pro­ceed­ings of 20th Inter­na­tion­al Con­fer­ence on Knowl­edge Engi­neer­ing and Knowl­edge Man­age­ment (EKAW’2016)
  %C Hei­del­berg
  %D 2016
  %E Blomqvist, Eva
  %E Vitali, Fabio
  %E Cian­car­i­ni, Pao­lo
  %I Springer Ver­lag
  %N 10024
  %R 10.1007/978–3‑319–49004-5_50
  %T Open­Re­search: Col­lab­o­ra­tive Man­age­ment of Schol­ar­ly Com­mu­ni­ca­tion Meta­da­ta
  %U http://ul.qucosa.de/api/qucosa%3A15939/attachment/ATT‑0/
  %X Schol­ars often need to search for match­ing, high-pro­file sci­en­tif­ic events to pub­lish their research results. Infor­ma­tion about top­i­cal focus and qual­i­ty of events is not made suf­fi­cient­ly explic­it in the exist­ing com­mu­ni­ca­tion chan­nels where events are announced. There­fore, schol­ars have to spend a lot of time on read­ing and assess­ing calls for papers but might still not find the right event. Addi­tion­al­ly, events might be over­looked because of the large num­ber of events announced every day. We intro­duce Open­Re­search, a crowd sourc­ing plat­form that sup­ports researchers in col­lect­ing, orga­niz­ing, shar­ing and dis­sem­i­nat­ing infor­ma­tion about sci­en­tif­ic events in a struc­tured way. It enables qual­i­ty-relat­ed queries over a mul­ti­dis­ci­pli­nary col­lec­tion of events accord­ing to a broad range of cri­te­ria such as accep­tance rate, sus­tain­abil­i­ty of event series, and rep­u­ta­tion of peo­ple and orga­ni­za­tions. Events are rep­re­sent­ed in dif­fer­ent views using map exten­sions, cal­en­dar and time-line visu­al­iza­tions. We have sys­tem­at­i­cal­ly eval­u­at­ed the time­li­ness, usabil­i­ty and per­for­mance of Open­Re­search.
  %@ 978–3‑319–49003‑8
  

• Adding Seman­tics to Mod­el-Dri­ven Soft­ware Devel­op­ment: A Prac­ti­cal Expe­ri­ence ReportIn: Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16), CEUR Work­shop Pro­ceed­ings. Leipzig, Ger­manyAndreas Nareike, J{ö}rg Unbe­hauen and Johannes Schmidt

  Bib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{nareike-semantics-2016-modeldriven,
  address = {Leipzig, Ger­many},
  author = {Nareike, Andreas and Unbe­hauen, J{ö}rg and Schmidt, Johannes},
  book­ti­tle = {Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16)},
  key­words = {es},
  month = {09},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {Adding Seman­tics to Mod­el-Dri­ven Soft­ware Devel­op­ment: A Prac­ti­cal Expe­ri­ence Report},
  year = 2016
  }
  

  %0 Con­fer­ence Paper
  %1 nareike-seman­tics-2016-mod­eldriv­en
  %A Nareike, Andreas
  %A Unbe­hauen, J{ö}rg
  %A Schmidt, Johannes
  %B Joint Pro­ceed­ings of the Posters and Demos Track of the 12th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems — SEMANTiCS2016 and the 1st Inter­na­tion­al Work­shop on Seman­tic Change \& Evolv­ing Seman­tics (SuCCESS’16)
  %C Leipzig, Ger­many
  %D 2016
  %T Adding Seman­tics to Mod­el-Dri­ven Soft­ware Devel­op­ment: A Prac­ti­cal Expe­ri­ence Report
  

2015

• {OntoWi­ki — An Author­ing, Pub­li­ca­tion and Visu­al­iza­tion Inter­face for the Data Web}In: Seman­tic Web Jour­nal vol. 6, Nr. 3, pp. 215–240Philipp Frischmuth, Michael Mar­tin, Sebas­t­ian Tramp, Thomas Riechert and S{ö}ren Auer

  URLBib­TeXEnd­NoteBib­Son­o­my

  @article{ontowiki-swj,
  author = {Frischmuth, Philipp and Mar­tin, Michael and Tramp, Sebas­t­ian and Riechert, Thomas and Auer, S{ö}ren},
  jour­nal = {Seman­tic Web Jour­nal},
  key­words = {topic_Exploration},
  num­ber = 3,
  pages = {215–240},
  title = {{OntoWi­ki — An Author­ing, Pub­li­ca­tion and Visu­al­iza­tion Inter­face for the Data Web}},
  vol­ume = 6,
  year = 2015
  }
  

  %0 Jour­nal Arti­cle
  %1 ontowi­ki-swj
  %A Frischmuth, Philipp
  %A Mar­tin, Michael
  %A Tramp, Sebas­t­ian
  %A Riechert, Thomas
  %A Auer, S{ö}ren
  %D 2015
  %J Seman­tic Web Jour­nal
  %N 3
  %P 215–240
  %R 10.3233/SW-140145
  %T {OntoWi­ki — An Author­ing, Pub­li­ca­tion and Visu­al­iza­tion Inter­face for the Data Web}
  %U http://www.semantic-web-journal.net/system/files/swj490_0.pdf
  %V 6
  

• Dis­trib­uted {L}inked {D}ata {B}usiness {C}ommunication {N}etworks: The {LUCID} {E}ndpointIn: The Seman­tic Web: {ESWC} 2015 Satel­lite Events — {ESWC} 2015 Satel­lite Events Portoro{\v{z}}, Slove­nia, May 31 — June 4, 2015, Revised Select­ed Papers, pp. 154–158Sebas­t­ian Tramp, Rub{{é}}n Navar­ro Piris, Tim­o­fey Ermilov, Niklas Petersen, Mar­vin Frommhold and S{{ö}}ren Auer

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{DBLP:conf/esws/TrampPEPFA15,
  author = {Tramp, Sebas­t­ian and Piris, Rub{{é}}n Navar­ro and Ermilov, Tim­o­fey and Petersen, Niklas and Frommhold, Mar­vin and Auer, S{{ö}}ren},
  book­ti­tle = {The Seman­tic Web: {ESWC} 2015 Satel­lite Events — {ESWC} 2015 Satel­lite Events Portoro{\v{z}}, Slove­nia, May 31 — June 4, 2015, Revised Select­ed Papers},
  cross­ref = {DBLP:conf/esws/2015s},
  key­words = {frommhold},
  pages = {154–158},
  title = {Dis­trib­uted {L}inked {D}ata {B}usiness {C}ommunication {N}etworks: The {LUCID} {E}ndpoint},
  year = 2015
  }
  

  %0 Con­fer­ence Paper
  %1 DBLP:conf/esws/TrampPEPFA15
  %A Tramp, Sebas­t­ian
  %A Piris, Rub{{é}}n Navar­ro
  %A Ermilov, Tim­o­fey
  %A Petersen, Niklas
  %A Frommhold, Mar­vin
  %A Auer, S{{ö}}ren
  %B The Seman­tic Web: {ESWC} 2015 Satel­lite Events — {ESWC} 2015 Satel­lite Events Portoro{\v{z}}, Slove­nia, May 31 — June 4, 2015, Revised Select­ed Papers
  %D 2015
  %P 154–158
  %R 10.1007/978–3‑319–25639-9_30
  %T Dis­trib­uted {L}inked {D}ata {B}usiness {C}ommunication {N}etworks: The {LUCID} {E}ndpoint
  %U http://dx.doi.org/10.1007/978–3‑319–25639-9_30
  

• Cube­Viz — Explo­ration and Visu­al­iza­tion of Sta­tis­ti­cal Linked DataIn: Pro­ceed­ings of the 24th Inter­na­tion­al Con­fer­ence on World Wide Web, WWW 2015Michael Mar­tin, Kon­rad Abicht, Claus Stadler, S{ö}ren Auer, Axel‑C. Ngonga Ngo­mo and Tom­ma­so Soru

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Cube­Viz is a flex­i­ble explo­ration and visu­al­iza­tion plat­form for sta­tis­ti­cal data rep­re­sent­ed adher­ing to the RDF Data Cube vocab­u­lary. If sta­tis­ti­cal data is pro­vid­ed adher­ing to the Data Cube vocab­u­lary, Cube­Viz exhibits a faceted brows­ing wid­get allow­ing to inter­ac­tive­ly fil­ter obser­va­tions to be visu­al­ized in charts. Based on the select­ed struc­tur­al part, Cube­Viz offers suit­able chart types and options for con­fig­ur­ing the visu­al­iza­tion by users. In this demo we present the Cube­Viz visu­al­iza­tion archi­tec­ture and com­po­nents, sketch its under­ly­ing API and the libraries used to gen­er­ate the desired out­put. By employ­ing advanced intro­spec­tion, analy­sis and visu­al­iza­tion boot­strap­ping tech­niques Cube­Viz hides the schema com­plex­i­ty of the encod­ed data in order to sup­port a user-friend­ly explo­ration experience.

  @inproceedings{martin-www-2015-demo-cubeviz,
  abstract = {Cube­Viz is a flex­i­ble explo­ration and visu­al­iza­tion plat­form for sta­tis­ti­cal data rep­re­sent­ed adher­ing to the RDF Data Cube vocab­u­lary. If sta­tis­ti­cal data is pro­vid­ed adher­ing to the Data Cube vocab­u­lary, Cube­Viz exhibits a faceted brows­ing wid­get allow­ing to inter­ac­tive­ly fil­ter obser­va­tions to be visu­al­ized in charts. Based on the select­ed struc­tur­al part, Cube­Viz offers suit­able chart types and options for con­fig­ur­ing the visu­al­iza­tion by users. In this demo we present the Cube­Viz visu­al­iza­tion archi­tec­ture and com­po­nents, sketch its under­ly­ing API and the libraries used to gen­er­ate the desired out­put. By employ­ing advanced intro­spec­tion, analy­sis and visu­al­iza­tion boot­strap­ping tech­niques Cube­Viz hides the schema com­plex­i­ty of the encod­ed data in order to sup­port a user-friend­ly explo­ration expe­ri­ence.},
  author = {Mar­tin, Michael and Abicht, Kon­rad and Stadler, Claus and Auer, S{ö}ren and Ngonga Ngo­mo, Axel‑C. and Soru, Tom­ma­so},
  book­ti­tle = {Pro­ceed­ings of the 24th Inter­na­tion­al Con­fer­ence on World Wide Web, WWW 2015},
  key­words = {topic_Exploration},
  title = {Cube­Viz — Explo­ration and Visu­al­iza­tion of Sta­tis­ti­cal Linked Data},
  year = 2015
  }
  

  %0 Con­fer­ence Paper
  %1 mar­tin-www-2015-demo-cube­viz
  %A Mar­tin, Michael
  %A Abicht, Kon­rad
  %A Stadler, Claus
  %A Auer, S{ö}ren
  %A Ngonga Ngo­mo, Axel‑C.
  %A Soru, Tom­ma­so
  %B Pro­ceed­ings of the 24th Inter­na­tion­al Con­fer­ence on World Wide Web, WWW 2015
  %D 2015
  %T Cube­Viz — Explo­ration and Visu­al­iza­tion of Sta­tis­ti­cal Linked Data
  %U https://svn.aksw.org/papers/2015/WWW_Demo_CubeViz/public.pdf
  %X Cube­Viz is a flex­i­ble explo­ration and visu­al­iza­tion plat­form for sta­tis­ti­cal data rep­re­sent­ed adher­ing to the RDF Data Cube vocab­u­lary. If sta­tis­ti­cal data is pro­vid­ed adher­ing to the Data Cube vocab­u­lary, Cube­Viz exhibits a faceted brows­ing wid­get allow­ing to inter­ac­tive­ly fil­ter obser­va­tions to be visu­al­ized in charts. Based on the select­ed struc­tur­al part, Cube­Viz offers suit­able chart types and options for con­fig­ur­ing the visu­al­iza­tion by users. In this demo we present the Cube­Viz visu­al­iza­tion archi­tec­ture and com­po­nents, sketch its under­ly­ing API and the libraries used to gen­er­ate the desired out­put. By employ­ing advanced intro­spec­tion, analy­sis and visu­al­iza­tion boot­strap­ping tech­niques Cube­Viz hides the schema com­plex­i­ty of the encod­ed data in order to sup­port a user-friend­ly explo­ration experience.
  

• RDF Edit­ing on the WebIn: SEMANTICS 2015, SEM ’15. Vien­na, Aus­tria : ACMClaus Stadler, Natanael Arndt, Michael Mar­tin and Jens Lehmann

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  While sev­er­al tools for sim­pli­fy­ing the task of visu­al­iz­ing (SPARQL acces­si­ble) RDF data on the Web are avail­able today, there is a lack of cor­re­spond­ing tools for exploit­ing stan­dard HTML forms direct­ly for RDF edit­ing. The few relat­ed exist­ing sys­tems rough­ly fall in the cat­e­gories of (a) appli­ca­tions that are not aimed at being reused as com­po­nents, (b) form gen­er­a­tors, which auto­mat­i­cal­ly cre­ate forms from a giv­en schema — pos­si­bly derived from instance data — or © form tem­plate proces­sors which cre­ate forms from a man­u­al­ly cre­at­ed spec­i­fi­ca­tion. Fur­ther­more, these sys­tems usu­al­ly come with their own wid­get library, which can only be extend­ed by wrap­ping exist­ing wid­gets. In this paper, we present the Angu­lar­JS-based \emph{Rdf Edit eXten­sion} (REX) sys­tem, which facil­i­tates the enhance­ment of stan­dard HTML forms as well as many exist­ing Angu­lar­JS wid­gets with RDF edit­ing sup­port by means of a set of HTML attrib­ut­es. We demon­strate our sys­tem though the real­iza­tion of sev­er­al usage scenarios.

  @inproceedings{rex_pd,
  abstract = {While sev­er­al tools for sim­pli­fy­ing the task of visu­al­iz­ing (SPARQL acces­si­ble) RDF data on the Web are avail­able today, there is a lack of cor­re­spond­ing tools for exploit­ing stan­dard HTML forms direct­ly for RDF edit­ing. The few relat­ed exist­ing sys­tems rough­ly fall in the cat­e­gories of (a) appli­ca­tions that are not aimed at being reused as com­po­nents, (b) form gen­er­a­tors, which auto­mat­i­cal­ly cre­ate forms from a giv­en schema — pos­si­bly derived from instance data — or © form tem­plate proces­sors which cre­ate forms from a man­u­al­ly cre­at­ed spec­i­fi­ca­tion. Fur­ther­more, these sys­tems usu­al­ly come with their own wid­get library, which can only be extend­ed by wrap­ping exist­ing wid­gets. In this paper, we present the Angu­lar­JS-based \emph{Rdf Edit eXten­sion} (REX) sys­tem, which facil­i­tates the enhance­ment of stan­dard HTML forms as well as many exist­ing Angu­lar­JS wid­gets with RDF edit­ing sup­port by means of a set of HTML attrib­ut­es. We demon­strate our sys­tem though the real­iza­tion of sev­er­al usage sce­nar­ios.},
  author = {Stadler, Claus and Arndt, Natanael and Mar­tin, Michael and Lehmann, Jens},
  book­ti­tle = {SEMANTICS 2015},
  key­words = {sys:relevantFor:infai},
  month = {09},
  pub­lish­er = {ACM},
  series = {SEM ’15},
  title = {RDF Edit­ing on the Web},
  year = 2015
  }
  

  %0 Con­fer­ence Paper
  %1 rex_pd
  %A Stadler, Claus
  %A Arndt, Natanael
  %A Mar­tin, Michael
  %A Lehmann, Jens
  %B SEMANTICS 2015
  %D 2015
  %I ACM
  %T RDF Edit­ing on the Web
  %U http://ceur-ws.org/Vol-1481/paper29.pdf
  %X While sev­er­al tools for sim­pli­fy­ing the task of visu­al­iz­ing (SPARQL acces­si­ble) RDF data on the Web are avail­able today, there is a lack of cor­re­spond­ing tools for exploit­ing stan­dard HTML forms direct­ly for RDF edit­ing. The few relat­ed exist­ing sys­tems rough­ly fall in the cat­e­gories of (a) appli­ca­tions that are not aimed at being reused as com­po­nents, (b) form gen­er­a­tors, which auto­mat­i­cal­ly cre­ate forms from a giv­en schema — pos­si­bly derived from instance data — or © form tem­plate proces­sors which cre­ate forms from a man­u­al­ly cre­at­ed spec­i­fi­ca­tion. Fur­ther­more, these sys­tems usu­al­ly come with their own wid­get library, which can only be extend­ed by wrap­ping exist­ing wid­gets. In this paper, we present the Angu­lar­JS-based \emph{Rdf Edit eXten­sion} (REX) sys­tem, which facil­i­tates the enhance­ment of stan­dard HTML forms as well as many exist­ing Angu­lar­JS wid­gets with RDF edit­ing sup­port by means of a set of HTML attrib­ut­es. We demon­strate our sys­tem though the real­iza­tion of sev­er­al usage scenarios.
  

• DBpe­di­aSameAs: An approach to tack­le het­ero­gene­ity in DBpe­dia iden­ti­fiersIn: SEMAN­TiCS 2015Andre Valdes­til­has, Natanael Arndt and Dim­itris Kontokostas

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The DBpe­dia dataset has mul­ti­ple URIs with­in the dataset and from oth­er datasets con­nect­ed with (tran­si­tive) owl:sameAs rela­tions and thus refer­ring to the same con­cepts. With this het­ero­gene­ity of iden­ti­fiers it is com­pli­cat­ed for users and agents to find the unique iden­ti­fi­er which should be prefer­ably used. We are intro­duc­ing the con­cept of DBpe­dia Unique Iden­ti­fi­er (DUI) and a dataset of linksets relat­ing URIs to DUIs. In order to improve the qual­i­ty of our dataset we devel­oped a mech­a­nism that allows the user to rate and sug­gest links. As proof of con­cept an imple­men­ta­tion with a graph­i­cal web user inter­face is pro­vid­ed for access­ing the linkset and rat­ing the links. The DBpe­dia sameAs ser­vice is avail­able at http://dbpsa.aksw.org/SameAsService.

  @inproceedings{AndreDBpediaSameAs,
  abstract = {The DBpe­dia dataset has mul­ti­ple URIs with­in the dataset and from oth­er datasets con­nect­ed with (tran­si­tive) owl:sameAs rela­tions and thus refer­ring to the same con­cepts. With this het­ero­gene­ity of iden­ti­fiers it is com­pli­cat­ed for users and agents to find the unique iden­ti­fi­er which should be prefer­ably used. We are intro­duc­ing the con­cept of DBpe­dia Unique Iden­ti­fi­er (DUI) and a dataset of linksets relat­ing URIs to DUIs. In order to improve the qual­i­ty of our dataset we devel­oped a mech­a­nism that allows the user to rate and sug­gest links. As proof of con­cept an imple­men­ta­tion with a graph­i­cal web user inter­face is pro­vid­ed for access­ing the linkset and rat­ing the links. The DBpe­dia sameAs ser­vice is avail­able at http://dbpsa.aksw.org/SameAsService.},
  author = {Valdes­til­has, Andre and Arndt, Natanael and Kon­tokostas, Dim­itris},
  book­ti­tle = {SEMAN­TiCS 2015},
  key­words = {sys:relevantFor:infai},
  month = {09},
  title = {DBpe­di­aSameAs: An approach to tack­le het­ero­gene­ity in DBpe­dia iden­ti­fiers},
  year = 2015
  }
  

  %0 Con­fer­ence Paper
  %1 AndreDB­pe­di­aSameAs
  %A Valdes­til­has, Andre
  %A Arndt, Natanael
  %A Kon­tokostas, Dim­itris
  %B SEMAN­TiCS 2015
  %D 2015
  %R 10.13140/RG.2.1.1639.6002
  %T DBpe­di­aSameAs: An approach to tack­le het­ero­gene­ity in DBpe­dia iden­ti­fiers
  %U http://svn.aksw.org/papers/2015/SEMANTICS_DBpediaSameAs/public.pdf
  %X The DBpe­dia dataset has mul­ti­ple URIs with­in the dataset and from oth­er datasets con­nect­ed with (tran­si­tive) owl:sameAs rela­tions and thus refer­ring to the same con­cepts. With this het­ero­gene­ity of iden­ti­fiers it is com­pli­cat­ed for users and agents to find the unique iden­ti­fi­er which should be prefer­ably used. We are intro­duc­ing the con­cept of DBpe­dia Unique Iden­ti­fi­er (DUI) and a dataset of linksets relat­ing URIs to DUIs. In order to improve the qual­i­ty of our dataset we devel­oped a mech­a­nism that allows the user to rate and sug­gest links. As proof of con­cept an imple­men­ta­tion with a graph­i­cal web user inter­face is pro­vid­ed for access­ing the linkset and rat­ing the links. The DBpe­dia sameAs ser­vice is avail­able at http://dbpsa.aksw.org/SameAsService.
  

• Knowl­edge Base Ship­ping to the Linked Open Data CloudIn: Sebas­t­ian Hell­mann, Josiane Xavier Par­reira and Axel Polleres (eds.): SEMANTICS ’15: Pro­ceed­ings of the 11th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems, Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings. Vien­na, Aus­tria : ACM — ISBN 978–1‑4503–3462‑4, pp. 73–80Natanael Arndt, Markus Ack­er­mann, Mar­tin Br{ü}mmer and Thomas Riechert

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Pop­u­lar knowl­edge bases that pro­vide SPARQL end­points for the web are usu­al­ly expe­ri­enc­ing a high num­ber of requests, which often results in low avail­abil­i­ty of their inter­faces. A com­mon approach to counter the avail­abfedil­i­ty issue is to run a local mir­ror of the knowl­edge base. Run­ning a SPARQL end­point is cur­rent­ly a com­plex task which requires a lot of effort and tech­ni­cal sup­port for domain experts who just want to use the SPARQL inter­face. With our approach of con­tainer­ised knowl­edge base ship­ping we are intro­duc­ing a sim­ple to set­up method­ol­o­gy for run­ning a local mir­ror of an RDF knowl­edge base and SPARQL end­point with inter­change­able explo­ration com­po­nents. The flex­i­bil­i­ty of the pre­sent­ed approach fur­ther helps main­tain­ing the pub­li­ca­tion infra­struc­ture for dataset projects. We are demon­strat­ing and eval­u­at­ing the pre­sent­ed method­ol­o­gy at the exam­ple of the dataset projects DBpe­dia, Cat­a­lo­gus Pro­fes­so­rum Lip­sien­si­um and S{ä}chsisches Pfarrerbuch.

  @inproceedings{arndt-n-2015–k,
  abstract = {Pop­u­lar knowl­edge bases that pro­vide SPARQL end­points for the web are usu­al­ly expe­ri­enc­ing a high num­ber of requests, which often results in low avail­abil­i­ty of their inter­faces. A com­mon approach to counter the avail­abfedil­i­ty issue is to run a local mir­ror of the knowl­edge base. Run­ning a SPARQL end­point is cur­rent­ly a com­plex task which requires a lot of effort and tech­ni­cal sup­port for domain experts who just want to use the SPARQL inter­face. With our approach of con­tainer­ised knowl­edge base ship­ping we are intro­duc­ing a sim­ple to set­up method­ol­o­gy for run­ning a local mir­ror of an RDF knowl­edge base and SPARQL end­point with inter­change­able explo­ration com­po­nents. The flex­i­bil­i­ty of the pre­sent­ed approach fur­ther helps main­tain­ing the pub­li­ca­tion infra­struc­ture for dataset projects. We are demon­strat­ing and eval­u­at­ing the pre­sent­ed method­ol­o­gy at the exam­ple of the dataset projects DBpe­dia, Cat­a­lo­gus Pro­fes­so­rum Lip­sien­si­um and S{ä}chsisches Pfar­rerbuch.},
  address = {Vien­na, Aus­tria},
  author = {Arndt, Natanael and Ack­er­mann, Markus and Br{ü}mmer, Mar­tin and Riechert, Thomas},
  book­ti­tle = {SEMANTICS ’15: Pro­ceed­ings of the 11th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems},
  cross­ref = {seman­tics-2015},
  edi­tor = {Hell­mann, Sebas­t­ian and Par­reira, Josiane Xavier and Polleres, Axel},
  key­words = {ack­er­mann},
  month = {09},
  pages = {73–80},
  pub­lish­er = {ACM},
  series = {Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems Pro­ceed­ings},
  title = {Knowl­edge Base Ship­ping to the Linked Open Data Cloud},
  year = 2015
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2015–k
  %A Arndt, Natanael
  %A Ack­er­mann, Markus
  %A Br{ü}mmer, Mar­tin
  %A Riechert, Thomas
  %B SEMANTICS ’15: Pro­ceed­ings of the 11th Inter­na­tion­al Con­fer­ence on Seman­tic Sys­tems
  %C Vien­na, Aus­tria
  %D 2015
  %E Hell­mann, Sebas­t­ian
  %E Par­reira, Josiane Xavier
  %E Polleres, Axel
  %I ACM
  %P 73–80
  %R 10.1145/2814864.2814885
  %T Knowl­edge Base Ship­ping to the Linked Open Data Cloud
  %U http://svn.aksw.org/papers/2015/SEMANTICS_DockerizingLOD/public.pdf
  %X Pop­u­lar knowl­edge bases that pro­vide SPARQL end­points for the web are usu­al­ly expe­ri­enc­ing a high num­ber of requests, which often results in low avail­abil­i­ty of their inter­faces. A com­mon approach to counter the avail­abfedil­i­ty issue is to run a local mir­ror of the knowl­edge base. Run­ning a SPARQL end­point is cur­rent­ly a com­plex task which requires a lot of effort and tech­ni­cal sup­port for domain experts who just want to use the SPARQL inter­face. With our approach of con­tainer­ised knowl­edge base ship­ping we are intro­duc­ing a sim­ple to set­up method­ol­o­gy for run­ning a local mir­ror of an RDF knowl­edge base and SPARQL end­point with inter­change­able explo­ration com­po­nents. The flex­i­bil­i­ty of the pre­sent­ed approach fur­ther helps main­tain­ing the pub­li­ca­tion infra­struc­ture for dataset projects. We are demon­strat­ing and eval­u­at­ing the pre­sent­ed method­ol­o­gy at the exam­ple of the dataset projects DBpe­dia, Cat­a­lo­gus Pro­fes­so­rum Lip­sien­si­um and S{ä}chsisches Pfar­rerbuch.
  %@ 978–1‑4503–3462‑4
  

• Improv­ing the Inter­op­er­abil­i­ty of Open Data Por­talsIn: Share PSIDiet­mar Gat­twinkel, Kon­rad Abicht, Rene Piet­zsch and Michael Martin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In the con­text of the Euro­pean Dig­i­tal Agen­da gov­ern­men­tal author­i­ties as well as vir­tu­al com­mu­ni­ties (e.g. datahub.io) have pub­lished a large amount of open datasets. This is a fun­da­men­tal­ly pos­i­tive devel­op­ment, how­ev­er one can observe that many dif­fer­ent that both for the meta­da­ta and the data itself dif­fer­ent vocab­u­lar­ies are in use. Fur­ther­more, the estab­lished vocab­u­lar­ies are often aug­ment­ed with por­tal spe­cif­ic meta­da­ta stan­dards and pub­lished in dif­fer­ent (local) lan­guages. If Open Data are to be inte­grat­ed and aggre­gat­ed across por­tals, this entails a lot of effort. In this paper we present exam­ples how the prob­lems of inter­op­er­abil­i­ty and mul­ti­lin­gual­ism could be addressed for key open data asset descrip­tors. We focus on the analy­sis of today’s prob­lems and ways to solve them.

  @article{martin-2015-sharepsi,
  abstract = {In the con­text of the Euro­pean Dig­i­tal Agen­da gov­ern­men­tal author­i­ties as well as vir­tu­al com­mu­ni­ties (e.g. datahub.io) have pub­lished a large amount of open datasets. This is a fun­da­men­tal­ly pos­i­tive devel­op­ment, how­ev­er one can observe that many dif­fer­ent that both for the meta­da­ta and the data itself dif­fer­ent vocab­u­lar­ies are in use. Fur­ther­more, the estab­lished vocab­u­lar­ies are often aug­ment­ed with por­tal spe­cif­ic meta­da­ta stan­dards and pub­lished in dif­fer­ent (local) lan­guages. If Open Data are to be inte­grat­ed and aggre­gat­ed across por­tals, this entails a lot of effort. In this paper we present exam­ples how the prob­lems of inter­op­er­abil­i­ty and mul­ti­lin­gual­ism could be addressed for key open data asset descrip­tors. We focus on the analy­sis of today’s prob­lems and ways to solve them.},
  author = {Gat­twinkel, Diet­mar and Abicht, Kon­rad and Piet­zsch, Rene and Mar­tin, Michael},
  jour­nal = {Share PSI},
  key­words = {sys:relevantFor:infai},
  month = 11,
  title = {Improv­ing the Inter­op­er­abil­i­ty of Open Data Por­tals},
  year = 2015
  }
  

  %0 Jour­nal Arti­cle
  %1 mar­tin-2015-sharep­si
  %A Gat­twinkel, Diet­mar
  %A Abicht, Kon­rad
  %A Piet­zsch, Rene
  %A Mar­tin, Michael
  %D 2015
  %J Share PSI
  %T Improv­ing the Inter­op­er­abil­i­ty of Open Data Por­tals
  %U https://www.w3.org/2013/share-psi/wiki/images/8/8e/Key_Descriptors.pdf
  %X In the con­text of the Euro­pean Dig­i­tal Agen­da gov­ern­men­tal author­i­ties as well as vir­tu­al com­mu­ni­ties (e.g. datahub.io) have pub­lished a large amount of open datasets. This is a fun­da­men­tal­ly pos­i­tive devel­op­ment, how­ev­er one can observe that many dif­fer­ent that both for the meta­da­ta and the data itself dif­fer­ent vocab­u­lar­ies are in use. Fur­ther­more, the estab­lished vocab­u­lar­ies are often aug­ment­ed with por­tal spe­cif­ic meta­da­ta stan­dards and pub­lished in dif­fer­ent (local) lan­guages. If Open Data are to be inte­grat­ed and aggre­gat­ed across por­tals, this entails a lot of effort. In this paper we present exam­ples how the prob­lems of inter­op­er­abil­i­ty and mul­ti­lin­gual­ism could be addressed for key open data asset descrip­tors. We focus on the analy­sis of today’s prob­lems and ways to solve them.
  

2014

• User-Cen­tric and per­son­al­ized access to mobile mul­ti­me­dia sys­tems based on a mul­ti­me­dia mid­dle­wareIn: Com­pu­ta­tion­al Sci­ence and Its Appli­ca­tions (ICCSA), 2014 14th Inter­na­tion­al Con­fer­ence on : IEEE, pp. 260–263Andre Valdes­til­has, Har­ald Kosch and Paulo Marcotti

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{valdestilhas2014user,
  author = {Valdes­til­has, Andre and Kosch, Har­ald and Mar­cot­ti, Paulo},
  book­ti­tle = {Com­pu­ta­tion­al Sci­ence and Its Appli­ca­tions (ICCSA), 2014 14th Inter­na­tion­al Con­fer­ence on},
  key­words = {sys:relevantFor:infai},
  orga­ni­za­tion = {IEEE},
  pages = {260–263},
  title = {User-Cen­tric and per­son­al­ized access to mobile mul­ti­me­dia sys­tems based on a mul­ti­me­dia mid­dle­ware},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 valdestilhas2014user
  %A Valdes­til­has, Andre
  %A Kosch, Har­ald
  %A Mar­cot­ti, Paulo
  %B Com­pu­ta­tion­al Sci­ence and Its Appli­ca­tions (ICCSA), 2014 14th Inter­na­tion­al Con­fer­ence on
  %D 2014
  %P 260–263
  %T User-Cen­tric and per­son­al­ized access to mobile mul­ti­me­dia sys­tems based on a mul­ti­me­dia mid­dle­ware
  %U http://dx.doi.org/10.1109/ICCSA.2014.60
  

• Sup­port­ing the Linked Data Life Cycle Using an Inte­grat­ed Tool StackIn: S{ö}ren Auer, Vol­ha Bryl and Sebas­t­ian Tramp (eds.): Linked Open Data — Cre­at­ing Knowl­edge Out of Inter­linked Data, Lec­ture Notes in Com­put­er Sci­ence : Springer Inter­na­tion­al Pub­lish­ing — ISBN 978–3‑319–09845‑6, pp. 108–129Bert Van Nuffe­len, Valenti­na Janev, Michael Mar­tin, Vuk Mijovic and Sebas­t­ian Tramp

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The core of a Linked Data appli­ca­tion is the pro­cess­ing of the knowl­edge expressed as Linked Data. There­fore the cre­ation, man­age­ment, cura­tion and pub­li­ca­tion of Linked Data are crit­i­cal aspects for an application’s suc­cess. For all of these aspects the LOD2 project pro­vides com­po­nents. These com­po­nents have been col­lect­ed and placed under one dis­tri­b­u­tion umbrel­la: the LOD2 stack. In this chap­ter we will intro­duce this com­po­nent stack. We will show how to get access; which com­po­nent cov­ers which aspect of the Linked Data life cycle and how using the stack eas­es the access to Linked Data man­age­ment tools. Fur­ther­more we will elab­o­rate how the stack can be used to sup­port a knowl­edge domain. The illus­trat­ed domain is sta­tis­ti­cal data.

  @incollection{LOD2Book-LODCycleToolstack,
  abstract = {The core of a Linked Data appli­ca­tion is the pro­cess­ing of the knowl­edge expressed as Linked Data. There­fore the cre­ation, man­age­ment, cura­tion and pub­li­ca­tion of Linked Data are crit­i­cal aspects for an application’s suc­cess. For all of these aspects the LOD2 project pro­vides com­po­nents. These com­po­nents have been col­lect­ed and placed under one dis­tri­b­u­tion umbrel­la: the LOD2 stack. In this chap­ter we will intro­duce this com­po­nent stack. We will show how to get access; which com­po­nent cov­ers which aspect of the Linked Data life cycle and how using the stack eas­es the access to Linked Data man­age­ment tools. Fur­ther­more we will elab­o­rate how the stack can be used to sup­port a knowl­edge domain. The illus­trat­ed domain is sta­tis­ti­cal data.},
  author = {Nuffe­len, Bert Van and Janev, Valenti­na and Mar­tin, Michael and Mijovic, Vuk and Tramp, Sebas­t­ian},
  book­ti­tle = {Linked Open Data — Cre­at­ing Knowl­edge Out of Inter­linked Data},
  edi­tor = {Auer, S{ö}ren and Bryl, Vol­ha and Tramp, Sebas­t­ian},
  key­words = {sys:relevantFor:lod2},
  pages = {108–129},
  pub­lish­er = {Springer Inter­na­tion­al Pub­lish­ing},
  series = {Lec­ture Notes in Com­put­er Sci­ence},
  title = {Sup­port­ing the Linked Data Life Cycle Using an Inte­grat­ed Tool Stack},
  year = 2014
  }
  

  %0 Book Sec­tion
  %1 LOD2­Book-LOD­Cy­cle­Tool­stack
  %A Nuffe­len, Bert Van
  %A Janev, Valenti­na
  %A Mar­tin, Michael
  %A Mijovic, Vuk
  %A Tramp, Sebas­t­ian
  %B Linked Open Data — Cre­at­ing Knowl­edge Out of Inter­linked Data
  %D 2014
  %E Auer, S{ö}ren
  %E Bryl, Vol­ha
  %E Tramp, Sebas­t­ian
  %I Springer Inter­na­tion­al Pub­lish­ing
  %P 108–129
  %R 10.1007/978–3‑319–09846-3_6
  %T Sup­port­ing the Linked Data Life Cycle Using an Inte­grat­ed Tool Stack
  %U http://dx.doi.org/10.1007/978–3‑319–09846-3_6
  %X The core of a Linked Data appli­ca­tion is the pro­cess­ing of the knowl­edge expressed as Linked Data. There­fore the cre­ation, man­age­ment, cura­tion and pub­li­ca­tion of Linked Data are crit­i­cal aspects for an application’s suc­cess. For all of these aspects the LOD2 project pro­vides com­po­nents. These com­po­nents have been col­lect­ed and placed under one dis­tri­b­u­tion umbrel­la: the LOD2 stack. In this chap­ter we will intro­duce this com­po­nent stack. We will show how to get access; which com­po­nent cov­ers which aspect of the Linked Data life cycle and how using the stack eas­es the access to Linked Data man­age­ment tools. Fur­ther­more we will elab­o­rate how the stack can be used to sup­port a knowl­edge domain. The illus­trat­ed domain is sta­tis­ti­cal data.
  %@ 978–3‑319–09845‑6
  

• Facil­i­tat­ing the Explo­ration and Visu­al­iza­tion of Linked DataIn: S{ö}ren Auer, Vol­ha Bryl and Sebas­t­ian Tramp (eds.): Linked Open Data—Creating Knowl­edge Out of Inter­linked Data, Lec­ture Notes in Com­put­er Sci­ence : Springer Inter­na­tion­al Pub­lish­ing — ISBN 978–3‑319–09845‑6, pp. 90–107Chris­t­ian Mad­er, Michael Mar­tin and Claus Stadler

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The cre­ation and the improve­ment of tools that cov­er explorato­ry and visu­al­iza­tion tasks for Linked Data were one of the major goals focused in the LOD2 project. Tools that sup­port those tasks are regard­ed as essen­tial for the Web of Data, since they can act as a user-ori­ent­ed start­ing point for data cus­tomers. Dur­ing the project, sev­er­al devel­op­ment efforts were made, whose results either facil­i­tate the explo­ration and visu­al­iza­tion direct­ly (such as OntoWi­ki, the Piv­ot Brows­er) or can be used to sup­port such tasks. In this chap­ter we present the three select­ed solu­tions rsine, Cube­Viz and Facete.

  @incollection{LOD2Book-ExplorationVisualization,
  abstract = {The cre­ation and the improve­ment of tools that cov­er explorato­ry and visu­al­iza­tion tasks for Linked Data were one of the major goals focused in the LOD2 project. Tools that sup­port those tasks are regard­ed as essen­tial for the Web of Data, since they can act as a user-ori­ent­ed start­ing point for data cus­tomers. Dur­ing the project, sev­er­al devel­op­ment efforts were made, whose results either facil­i­tate the explo­ration and visu­al­iza­tion direct­ly (such as OntoWi­ki, the Piv­ot Brows­er) or can be used to sup­port such tasks. In this chap­ter we present the three select­ed solu­tions rsine, Cube­Viz and Facete.},
  author = {Mad­er, Chris­t­ian and Mar­tin, Michael and Stadler, Claus},
  book­ti­tle = {Linked Open Data—Creating Knowl­edge Out of Inter­linked Data},
  edi­tor = {Auer, S{ö}ren and Bryl, Vol­ha and Tramp, Sebas­t­ian},
  key­words = {facete},
  pages = {90–107},
  pub­lish­er = {Springer Inter­na­tion­al Pub­lish­ing},
  series = {Lec­ture Notes in Com­put­er Sci­ence},
  title = {Facil­i­tat­ing the Explo­ration and Visu­al­iza­tion of Linked Data},
  year = 2014
  }
  

  %0 Book Sec­tion
  %1 LOD2­Book-Explo­rationVi­su­al­iza­tion
  %A Mad­er, Chris­t­ian
  %A Mar­tin, Michael
  %A Stadler, Claus
  %B Linked Open Data—Creating Knowl­edge Out of Inter­linked Data
  %D 2014
  %E Auer, S{ö}ren
  %E Bryl, Vol­ha
  %E Tramp, Sebas­t­ian
  %I Springer Inter­na­tion­al Pub­lish­ing
  %P 90–107
  %R 10.1007/978–3‑319–09846-3_5
  %T Facil­i­tat­ing the Explo­ration and Visu­al­iza­tion of Linked Data
  %U https://svn.aksw.org/papers/2014/LOD_rsine/public.pdf
  %X The cre­ation and the improve­ment of tools that cov­er explorato­ry and visu­al­iza­tion tasks for Linked Data were one of the major goals focused in the LOD2 project. Tools that sup­port those tasks are regard­ed as essen­tial for the Web of Data, since they can act as a user-ori­ent­ed start­ing point for data cus­tomers. Dur­ing the project, sev­er­al devel­op­ment efforts were made, whose results either facil­i­tate the explo­ration and visu­al­iza­tion direct­ly (such as OntoWi­ki, the Piv­ot Brows­er) or can be used to sup­port such tasks. In this chap­ter we present the three select­ed solu­tions rsine, Cube­Viz and Facete.
  %@ 978–3‑319–09845‑6
  

• An Adap­tive Graph­i­cal User Inter­face Based on Atten­tion Lev­el and Diam­e­ter of Eye PupilIn: Inter­na­tion­al Con­fer­ence on Adap­tive Sci­ence and Tech­nol­o­gy (ICAST 2014). vol. 6 : IEEE, p. 4Fran­cis­co Isidro Mas­se­to} {Andre Valdestilhas

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{andre2014adaptive,
  author = {{Andre Valdes­til­has, Fran­cis­co Isidro Mas­se­to}, Air­ton Fer­reira Junior},
  book­ti­tle = {Inter­na­tion­al Con­fer­ence on Adap­tive Sci­ence and Tech­nol­o­gy (ICAST 2014)},
  key­words = {sys:relevantFor:infai},
  num­ber = 6,
  orga­ni­za­tion = {IEEE},
  pages = 4,
  title = {An Adap­tive Graph­i­cal User Inter­face Based on Atten­tion Lev­el and Diam­e­ter of Eye Pupil},
  vol­ume = 6,
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 andre2014adaptive
  %A {Andre Valdes­til­has, Fran­cis­co Isidro Mas­se­to}
  %B Inter­na­tion­al Con­fer­ence on Adap­tive Sci­ence and Tech­nol­o­gy (ICAST 2014)
  %D 2014
  %N 6
  %P 4
  %T An Adap­tive Graph­i­cal User Inter­face Based on Atten­tion Lev­el and Diam­e­ter of Eye Pupil
  %U http://dx.doi.org/10.1109/ICASTECH.2014.7068126
  %V 6
  

• An adap­tive graph­i­cal user inter­face based on atten­tion lev­el and diam­e­ter of eye pupilIn: Adap­tive Sci­ence \& Tech­nol­o­gy (ICAST), 2014 IEEE 6th Inter­na­tion­al Con­fer­ence on : IEEE, pp. 1–4Andre Valdes­til­has, Fran­cis­co Isidro Mas­se­to and Air­ton Ferreira

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{valdestilhas2014adaptive,
  author = {Valdes­til­has, Andre and Mas­se­to, Fran­cis­co Isidro and Fer­reira, Air­ton},
  book­ti­tle = {Adap­tive Sci­ence \& Tech­nol­o­gy (ICAST), 2014 IEEE 6th Inter­na­tion­al Con­fer­ence on},
  key­words = {sys:relevantFor:infai},
  orga­ni­za­tion = {IEEE},
  pages = {1–4},
  title = {An adap­tive graph­i­cal user inter­face based on atten­tion lev­el and diam­e­ter of eye pupil},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 valdestilhas2014adaptive
  %A Valdes­til­has, Andre
  %A Mas­se­to, Fran­cis­co Isidro
  %A Fer­reira, Air­ton
  %B Adap­tive Sci­ence \& Tech­nol­o­gy (ICAST), 2014 IEEE 6th Inter­na­tion­al Con­fer­ence on
  %D 2014
  %P 1–4
  %T An adap­tive graph­i­cal user inter­face based on atten­tion lev­el and diam­e­ter of eye pupil
  %U http://dx.doi.org/10.1109/ICASTECH.2014.7068126
  

• A spi­der diver­si­ty mod­el for the Cau­ca­sus Ecore­gionIn: Jour­nal of Insect Con­ser­va­tion vol. 18, Nr. 3, pp. 407–416Geor­gi Cha­l­adze, Ste­fan Otto and Sebas­t­ian Tramp

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Pre­cise infor­ma­tion on spa­tial pat­terns of species rich­ness and endem­ic species dis­tri­b­u­tion is impor­tant for effec­tive species con­ser­va­tion. In the Cau­ca­sus Ecore­gion such infor­ma­tion is vir­tu­al­ly non-exis­tent for inver­te­brate taxa. Using occur­rence data from a large data­base we cal­cu­lat­ed species dis­tri­b­u­tion mod­els with the GARP algo­rithm for 471 spi­der species to visu­al­ize the diver­si­ty dis­tri­b­u­tion of spi­der species in this region. Over­all species diver­si­ty was high­est in moun­tain forests of the North Cau­ca­sus, east-cen­tral Geor­gia, the south­ern slopes of the east­ern Great Cau­ca­sus and south-east Azer­bai­jan. A regres­sion tree analy­sis Chi squared auto­mat­ic inter­ac­tion detec­tor method revealed the mean tem­per­a­ture of the dri­est quar­ter and pre­cip­i­ta­tion para­me­ters to be the main envi­ron­men­tal fac­tors shap­ing these pat­terns. Diver­si­ty of endem­ic species was cor­re­lat­ed with over­all species diver­si­ty but hotspots of endem­ic species (10+ per­cent of all species) exists in high-moun­tain areas, sug­gest­ing post-glacial spe­ci­a­tion events in the high moun­tains as the main sources of high endemism in Cau­ca­sus. Fur­ther infor­ma­tion on the spa­tial dis­tri­b­u­tion of species diver­si­ty of inver­te­brate taxa in the Cau­ca­sus Ecore­gion is need­ed to improve con­ser­va­tion efforts in this bio­di­ver­si­ty hotspot.

  @article{Chaladze2014,
  abstract = {Pre­cise infor­ma­tion on spa­tial pat­terns of species rich­ness and endem­ic species dis­tri­b­u­tion is impor­tant for effec­tive species con­ser­va­tion. In the Cau­ca­sus Ecore­gion such infor­ma­tion is vir­tu­al­ly non-exis­tent for inver­te­brate taxa. Using occur­rence data from a large data­base we cal­cu­lat­ed species dis­tri­b­u­tion mod­els with the GARP algo­rithm for 471 spi­der species to visu­al­ize the diver­si­ty dis­tri­b­u­tion of spi­der species in this region. Over­all species diver­si­ty was high­est in moun­tain forests of the North Cau­ca­sus, east-cen­tral Geor­gia, the south­ern slopes of the east­ern Great Cau­ca­sus and south-east Azer­bai­jan. A regres­sion tree analy­sis Chi squared auto­mat­ic inter­ac­tion detec­tor method revealed the mean tem­per­a­ture of the dri­est quar­ter and pre­cip­i­ta­tion para­me­ters to be the main envi­ron­men­tal fac­tors shap­ing these pat­terns. Diver­si­ty of endem­ic species was cor­re­lat­ed with over­all species diver­si­ty but hotspots of endem­ic species (10+ per­cent of all species) exists in high-moun­tain areas, sug­gest­ing post-glacial spe­ci­a­tion events in the high moun­tains as the main sources of high endemism in Cau­ca­sus. Fur­ther infor­ma­tion on the spa­tial dis­tri­b­u­tion of species diver­si­ty of inver­te­brate taxa in the Cau­ca­sus Ecore­gion is need­ed to improve con­ser­va­tion efforts in this bio­di­ver­si­ty hotspot.},
  author = {Cha­l­adze, Geor­gi and Otto, Ste­fan and Tramp, Sebas­t­ian},
  jour­nal = {Jour­nal of Insect Con­ser­va­tion},
  key­words = {es},
  num­ber = 3,
  pages = {407–416},
  title = {A spi­der diver­si­ty mod­el for the Cau­ca­sus Ecore­gion},
  vol­ume = 18,
  year = 2014
  }
  

  %0 Jour­nal Arti­cle
  %1 Chaladze2014
  %A Cha­l­adze, Geor­gi
  %A Otto, Ste­fan
  %A Tramp, Sebas­t­ian
  %D 2014
  %J Jour­nal of Insect Con­ser­va­tion
  %N 3
  %P 407–416
  %R 10.1007/s10841-014‑9649‑1
  %T A spi­der diver­si­ty mod­el for the Cau­ca­sus Ecore­gion
  %U http://dx.doi.org/10.1007/s10841-014‑9649‑1
  %V 18
  %X Pre­cise infor­ma­tion on spa­tial pat­terns of species rich­ness and endem­ic species dis­tri­b­u­tion is impor­tant for effec­tive species con­ser­va­tion. In the Cau­ca­sus Ecore­gion such infor­ma­tion is vir­tu­al­ly non-exis­tent for inver­te­brate taxa. Using occur­rence data from a large data­base we cal­cu­lat­ed species dis­tri­b­u­tion mod­els with the GARP algo­rithm for 471 spi­der species to visu­al­ize the diver­si­ty dis­tri­b­u­tion of spi­der species in this region. Over­all species diver­si­ty was high­est in moun­tain forests of the North Cau­ca­sus, east-cen­tral Geor­gia, the south­ern slopes of the east­ern Great Cau­ca­sus and south-east Azer­bai­jan. A regres­sion tree analy­sis Chi squared auto­mat­ic inter­ac­tion detec­tor method revealed the mean tem­per­a­ture of the dri­est quar­ter and pre­cip­i­ta­tion para­me­ters to be the main envi­ron­men­tal fac­tors shap­ing these pat­terns. Diver­si­ty of endem­ic species was cor­re­lat­ed with over­all species diver­si­ty but hotspots of endem­ic species (10+ per­cent of all species) exists in high-moun­tain areas, sug­gest­ing post-glacial spe­ci­a­tion events in the high moun­tains as the main sources of high endemism in Cau­ca­sus. Fur­ther infor­ma­tion on the spa­tial dis­tri­b­u­tion of species diver­si­ty of inver­te­brate taxa in the Cau­ca­sus Ecore­gion is need­ed to improve con­ser­va­tion efforts in this bio­di­ver­si­ty hotspot.
  

• {Explor­ing the Web of Spa­tial Data with Facete}In: Com­pan­ion pro­ceed­ings of 23rd Inter­na­tion­al World Wide Web Con­fer­ence (WWW), pp. 175–178Claus Stadler, Michael Mar­tin and S{ö}ren Auer

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{stadler-www,
  author = {Stadler, Claus and Mar­tin, Michael and Auer, S{ö}ren},
  book­ti­tle = {Com­pan­ion pro­ceed­ings of 23rd Inter­na­tion­al World Wide Web Con­fer­ence (WWW)},
  key­words = {facete},
  pages = {175–178},
  title = {{Explor­ing the Web of Spa­tial Data with Facete}},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 stadler-www
  %A Stadler, Claus
  %A Mar­tin, Michael
  %A Auer, S{ö}ren
  %B Com­pan­ion pro­ceed­ings of 23rd Inter­na­tion­al World Wide Web Con­fer­ence (WWW)
  %D 2014
  %P 175–178
  %T {Explor­ing the Web of Spa­tial Data with Facete}
  %U https://svn.aksw.org/papers/2014/WWW_Facete/public.pdf
  

• Linked Open Data — Cre­at­ing Knowl­edge Out of Inter­linked Data — Results of the {LOD2} Project, Lec­ture Notes in Com­put­er Sci­ence. vol. 8661 : Springer — ISBN 978–3‑319–09845-6S{{ö}}ren Auer, Vol­ha Bryl and Sebas­t­ian Tramp (eds.)

  URLBib­TeXEnd­NoteBib­Son­o­my

  @book{DBLP:series/lncs/8661,
  book­ti­tle = {Linked Open Data},
  edi­tor = {Auer, S{{ö}}ren and Bryl, Vol­ha and Tramp, Sebas­t­ian},
  key­words = {seebiproject_OntoWiki},
  pub­lish­er = {Springer},
  series = {Lec­ture Notes in Com­put­er Sci­ence},
  title = {Linked Open Data — Cre­at­ing Knowl­edge Out of Inter­linked Data — Results of the {LOD2} Project},
  vol­ume = 8661,
  year = 2014
  }
  

  %0 Book
  %1 DBLP:series/lncs/8661
  %B Linked Open Data
  %D 2014
  %E Auer, S{{ö}}ren
  %E Bryl, Vol­ha
  %E Tramp, Sebas­t­ian
  %I Springer
  %R 10.1007/978–3‑319–09846‑3
  %T Linked Open Data — Cre­at­ing Knowl­edge Out of Inter­linked Data — Results of the {LOD2} Project
  %U http://dx.doi.org/10.1007/978–3‑319–09846‑3
  %V 8661
  %@ 978–3‑319–09845‑6
  

• {E}ntwicklung laufzeitop­ti­miert­er seman­tis­ch­er {W}eb-{A}pplikationen: {K}onzepte, {L}{ö}sungsans{ä}tze und {A}nwendungsf{ä}lle. Leipzig, Ger­many, Uni­ver­si­ty of Leipzig, PhD dis­ser­ta­tion. — \url{http://d‑nb.info/1059148110}Michael Mar­tin

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The main cri­te­ria for the suc­cess­ful use of Seman­tic Web tech­nolo­gies are a user-friend­ly and intu­itive design of user inter­faces (espe­cial­ly for web appli­ca­tions) and an accept­able per­for­mance with regard to the pro­duc­tion, pro­cess­ing and pub­li­ca­tion of seman­ti­cal­ly rep­re­sent­ed data. Data man­age­ment schema­ta used in the Seman­tic Web (Triple Stores) gen­er­al­ly offer a high degree of flex­i­bil­i­ty for the man­age­ment of infor­ma­tion by means of RDF graphs, tax­onomies, vocab­u­lar­ies or ontolo­gies. How­ev­er, this aspect is accom­pa­nied by chal­lenges con­cern­ing the usabil­i­ty and per­for­mance in the devel­op­ment of Seman­tic Web appli­ca­tions, espe­cial­ly when com­plex infor­ma­tion struc­tures and cor­re­spond­ing queries have to be processed. There­fore, if pri­or­i­ty is giv­en to eas­ing the use and per­for­mance of the soft­ware, devel­op­ment risks have to be tak­en into account. To min­i­mize these risks, this the­sis pro­pos­es a cat­e­go­riza­tion mod­el which can be used to assist in the spec­i­fi­ca­tion of require­ments. Fur­ther­more, approach­es are pre­sent­ed that fos­ter the reduc­tion and opti­miza­tion of SPARQL queries on the appli­ca­tion side, and thus pos­i­tive­ly influ­ence the process of run-time opti­miza­tion of Seman­tic Web appli­ca­tions. Ded­i­cat­ed strate­gies are devel­oped for the explo­ration and visu­al­iza­tion of spe­cif­ic data modal­i­ties, such as spa­tial, sta­tis­ti­cal, and mul­ti­lin­gual data. Based on these con­cepts, soft­ware com­po­nents are devel­oped, opti­mized and inte­grat­ed into exist­ing web appli­ca­tions. The approach­es elab­o­rat­ed in this work are eval­u­at­ed by using the Berlin SPARQL Bench­mark as well as Web appli­ca­tions from dif­fer­ent domains such as tourism, finance and statistics.

  @phdthesis{martin-m-2014-thesis,
  abstract = {The main cri­te­ria for the suc­cess­ful use of Seman­tic Web tech­nolo­gies are a user-friend­ly and intu­itive design of user inter­faces (espe­cial­ly for web appli­ca­tions) and an accept­able per­for­mance with regard to the pro­duc­tion, pro­cess­ing and pub­li­ca­tion of seman­ti­cal­ly rep­re­sent­ed data. Data man­age­ment schema­ta used in the Seman­tic Web (Triple Stores) gen­er­al­ly offer a high degree of flex­i­bil­i­ty for the man­age­ment of infor­ma­tion by means of RDF graphs, tax­onomies, vocab­u­lar­ies or ontolo­gies. How­ev­er, this aspect is accom­pa­nied by chal­lenges con­cern­ing the usabil­i­ty and per­for­mance in the devel­op­ment of Seman­tic Web appli­ca­tions, espe­cial­ly when com­plex infor­ma­tion struc­tures and cor­re­spond­ing queries have to be processed. There­fore, if pri­or­i­ty is giv­en to eas­ing the use and per­for­mance of the soft­ware, devel­op­ment risks have to be tak­en into account. To min­i­mize these risks, this the­sis pro­pos­es a cat­e­go­riza­tion mod­el which can be used to assist in the spec­i­fi­ca­tion of require­ments. Fur­ther­more, approach­es are pre­sent­ed that fos­ter the reduc­tion and opti­miza­tion of SPARQL queries on the appli­ca­tion side, and thus pos­i­tive­ly influ­ence the process of run-time opti­miza­tion of Seman­tic Web appli­ca­tions. Ded­i­cat­ed strate­gies are devel­oped for the explo­ration and visu­al­iza­tion of spe­cif­ic data modal­i­ties, such as spa­tial, sta­tis­ti­cal, and mul­ti­lin­gual data. Based on these con­cepts, soft­ware com­po­nents are devel­oped, opti­mized and inte­grat­ed into exist­ing web appli­ca­tions. The approach­es elab­o­rat­ed in this work are eval­u­at­ed by using the Berlin SPARQL Bench­mark as well as Web appli­ca­tions from dif­fer­ent domains such as tourism, finance and sta­tis­tics.},
  address = {Leipzig, Ger­many},
  author = {Mar­tin, Michael},
  key­words = {sys:relevantFor:infai},
  month = {07},
  note = {\url{http://d‑nb.info/1059148110}},
  school = {Uni­ver­si­ty of Leipzig},
  title = {{E}ntwicklung laufzeitop­ti­miert­er seman­tis­ch­er {W}eb-{A}pplikationen: {K}onzepte, {L}{ö}sungsans{ä}tze und {A}nwendungsf{ä}lle},
  type = {PhD The­sis},
  year = 2014
  }
  

  %0 The­sis
  %1 mar­tin-m-2014-the­sis
  %A Mar­tin, Michael
  %C Leipzig, Ger­many
  %D 2014
  %T {E}ntwicklung laufzeitop­ti­miert­er seman­tis­ch­er {W}eb-{A}pplikationen: {K}onzepte, {L}{ö}sungsans{ä}tze und {A}nwendungsf{ä}lle
  %U http://d‑nb.info/1059148110
  %X The main cri­te­ria for the suc­cess­ful use of Seman­tic Web tech­nolo­gies are a user-friend­ly and intu­itive design of user inter­faces (espe­cial­ly for web appli­ca­tions) and an accept­able per­for­mance with regard to the pro­duc­tion, pro­cess­ing and pub­li­ca­tion of seman­ti­cal­ly rep­re­sent­ed data. Data man­age­ment schema­ta used in the Seman­tic Web (Triple Stores) gen­er­al­ly offer a high degree of flex­i­bil­i­ty for the man­age­ment of infor­ma­tion by means of RDF graphs, tax­onomies, vocab­u­lar­ies or ontolo­gies. How­ev­er, this aspect is accom­pa­nied by chal­lenges con­cern­ing the usabil­i­ty and per­for­mance in the devel­op­ment of Seman­tic Web appli­ca­tions, espe­cial­ly when com­plex infor­ma­tion struc­tures and cor­re­spond­ing queries have to be processed. There­fore, if pri­or­i­ty is giv­en to eas­ing the use and per­for­mance of the soft­ware, devel­op­ment risks have to be tak­en into account. To min­i­mize these risks, this the­sis pro­pos­es a cat­e­go­riza­tion mod­el which can be used to assist in the spec­i­fi­ca­tion of require­ments. Fur­ther­more, approach­es are pre­sent­ed that fos­ter the reduc­tion and opti­miza­tion of SPARQL queries on the appli­ca­tion side, and thus pos­i­tive­ly influ­ence the process of run-time opti­miza­tion of Seman­tic Web appli­ca­tions. Ded­i­cat­ed strate­gies are devel­oped for the explo­ration and visu­al­iza­tion of spe­cif­ic data modal­i­ties, such as spa­tial, sta­tis­ti­cal, and mul­ti­lin­gual data. Based on these con­cepts, soft­ware com­po­nents are devel­oped, opti­mized and inte­grat­ed into exist­ing web appli­ca­tions. The approach­es elab­o­rat­ed in this work are eval­u­at­ed by using the Berlin SPARQL Bench­mark as well as Web appli­ca­tions from dif­fer­ent domains such as tourism, finance and statistics.
  

• {AMSL}: Man­ag­ing Elec­tron­ic Resources for Libraries Based on Seman­tic WebIn: Erhard Pl{ö}dereder, Lars Grunske, Eric Schnei­der and Dominik Ull (eds.): Pro­ceed­ings of the INFORMATIK 2014: Big Data — Komplexit{ä}t meis­tern, GI-Edition—Lecture Notes in Infor­mat­ics. vol. P‑232. Stuttgart, Ger­many : Gesellschaft für Infor­matik e.V.. — {\copy­right} 2014 Gesellschaft f{ü}r Infor­matik — ISBN 978–3‑88579–626‑8, pp. 1017–1026Andreas Nareike, Natanael Arndt, Nor­man Radtke, Sebas­t­ian Nuck, Lean­der Seige and Thomas Riechert

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  In libraries a change from phys­i­cal resources to elec­tron­ic resources, with new licens­ing mod­els and lend­ing process­es, has tak­en places. The exist­ing man­ag­ing infra­struc­ture is not yet suit­able for the upcom­ing require­ments and does not pro­vide sup­port for flex­i­ble and exten­si­ble data mod­els for being future-proof. In this paper we present a sys­tem that uses the gener­ic RDF resource man­age­ment sys­tem OntoWi­ki for man­ag­ing library resources. OntoWi­ki is extend­ed by com­po­nents for adapt­ing the gener­ic sys­tem to the giv­en domain, e.g.~by using data tem­plates. In addi­tion the Linked Data capa­bil­i­ty of OntoWi­ki is used and extend­ed to import var­i­ous meta­da­ta to enrich the man­ag­ing resource. Con­se­quent­ly using Linked Data fur­ther enables libraries to build up a Linked Data infra­struc­ture in the library domain.

  @inproceedings{nareike-a-2014–a,
  abstract = {In libraries a change from phys­i­cal resources to elec­tron­ic resources, with new licens­ing mod­els and lend­ing process­es, has tak­en places. The exist­ing man­ag­ing infra­struc­ture is not yet suit­able for the upcom­ing require­ments and does not pro­vide sup­port for flex­i­ble and exten­si­ble data mod­els for being future-proof. In this paper we present a sys­tem that uses the gener­ic RDF resource man­age­ment sys­tem OntoWi­ki for man­ag­ing library resources. OntoWi­ki is extend­ed by com­po­nents for adapt­ing the gener­ic sys­tem to the giv­en domain, e.g.~by using data tem­plates. In addi­tion the Linked Data capa­bil­i­ty of OntoWi­ki is used and extend­ed to import var­i­ous meta­da­ta to enrich the man­ag­ing resource. Con­se­quent­ly using Linked Data fur­ther enables libraries to build up a Linked Data infra­struc­ture in the library domain.},
  address = {Stuttgart, Ger­many},
  author = {Nareike, Andreas and Arndt, Natanael and Radtke, Nor­man and Nuck, Sebas­t­ian and Seige, Lean­der and Riechert, Thomas},
  book­ti­tle = {Pro­ceed­ings of the INFORMATIK 2014: Big Data — Komplexit{ä}t meis­tern},
  edi­tor = {Pl{ö}dereder, Erhard and Grunske, Lars and Schnei­der, Eric and Ull, Dominik},
  key­words = {erm},
  month = {09},
  note = {{\copy­right} 2014 Gesellschaft f{ü}r Infor­matik},
  orga­ni­za­tion = {Gesellschaft f{ü}r Infor­matik e.V.},
  pages = {1017–1026},
  pub­lish­er = {Gesellschaft für Infor­matik e.V.},
  series = {GI-Edition—Lecture Notes in Infor­mat­ics},
  title = {{AMSL}: Man­ag­ing Elec­tron­ic Resources for Libraries Based on Seman­tic Web},
  vol­ume = {P‑232},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 nareike-a-2014–a
  %A Nareike, Andreas
  %A Arndt, Natanael
  %A Radtke, Nor­man
  %A Nuck, Sebas­t­ian
  %A Seige, Lean­der
  %A Riechert, Thomas
  %B Pro­ceed­ings of the INFORMATIK 2014: Big Data — Komplexit{ä}t meis­tern
  %C Stuttgart, Ger­many
  %D 2014
  %E Pl{ö}dereder, Erhard
  %E Grunske, Lars
  %E Schnei­der, Eric
  %E Ull, Dominik
  %I Gesellschaft für Infor­matik e.V.
  %P 1017–1026
  %T {AMSL}: Man­ag­ing Elec­tron­ic Resources for Libraries Based on Seman­tic Web
  %U https://dl.gi.de/bitstream/handle/20.500.12116/2713/1017.pdf
  %V P‑232
  %X In libraries a change from phys­i­cal resources to elec­tron­ic resources, with new licens­ing mod­els and lend­ing process­es, has tak­en places. The exist­ing man­ag­ing infra­struc­ture is not yet suit­able for the upcom­ing require­ments and does not pro­vide sup­port for flex­i­ble and exten­si­ble data mod­els for being future-proof. In this paper we present a sys­tem that uses the gener­ic RDF resource man­age­ment sys­tem OntoWi­ki for man­ag­ing library resources. OntoWi­ki is extend­ed by com­po­nents for adapt­ing the gener­ic sys­tem to the giv­en domain, e.g.~by using data tem­plates. In addi­tion the Linked Data capa­bil­i­ty of OntoWi­ki is used and extend­ed to import var­i­ous meta­da­ta to enrich the man­ag­ing resource. Con­se­quent­ly using Linked Data fur­ther enables libraries to build up a Linked Data infra­struc­ture in the library domain.
  %@ 978–3‑88579–626‑8
  

• {AMSL}: Cre­at­ing a Linked Data Infra­struc­ture for Man­ag­ing Elec­tron­ic Resources in LibrariesIn: Matthew Hor­ridge, Mar­co Rospocher and Jac­co van Ossen­bruggen (eds.): Pro­ceed­ings of the ISWC 2014 Posters \& Demon­stra­tions Track, CEUR Work­shop Pro­ceed­ings. vol. Vol-1272. Riva del Gar­da, Italy, pp. 309–312Natanael Arndt, Sebas­t­ian Nuck, Andreas Nareike, Nor­man Radtke, Lean­der Seige and Thomas Riechert

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Elec­tron­ic resources (e.g. e‑journals, e‑books or data­bas­es) are gain­ing more an more impor­tance in libraries. With AMSL we demon­strate a flex­i­ble elec­tron­ic resource man­age­ment sys­tem which enables libraries to man­age their elec­tron­ic resources with a domain adapt­ed soft­ware based on the OntoWi­ki appli­ca­tion frame­work. Due to its gener­ic design and first of all flex­i­ble data mod­el the AMSL sys­tem can be eas­i­ly adjust­ed to upcom­ing require­ments. The con­se­quent use of Linked Data fur­ther enables libraries to build up a Linked Open Data infra­struc­ture for exchange of meta data.

  @inproceedings{arndt-n-2014–a,
  abstract = {Elec­tron­ic resources (e.g. e‑journals, e‑books or data­bas­es) are gain­ing more an more impor­tance in libraries. With AMSL we demon­strate a flex­i­ble elec­tron­ic resource man­age­ment sys­tem which enables libraries to man­age their elec­tron­ic resources with a domain adapt­ed soft­ware based on the OntoWi­ki appli­ca­tion frame­work. Due to its gener­ic design and first of all flex­i­ble data mod­el the AMSL sys­tem can be eas­i­ly adjust­ed to upcom­ing require­ments. The con­se­quent use of Linked Data fur­ther enables libraries to build up a Linked Open Data infra­struc­ture for exchange of meta data.},
  address = {Riva del Gar­da, Italy},
  author = {Arndt, Natanael and Nuck, Sebas­t­ian and Nareike, Andreas and Radtke, Nor­man and Seige, Lean­der and Riechert, Thomas},
  book­ti­tle = {Pro­ceed­ings of the ISWC 2014 Posters \& Demon­stra­tions Track},
  cross­ref = {ISWC2014_PD},
  edi­tor = {Hor­ridge, Matthew and Rospocher, Mar­co and van Ossen­bruggen, Jac­co},
  key­words = {erm},
  month = 10,
  pages = {309–312},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {{AMSL}: Cre­at­ing a Linked Data Infra­struc­ture for Man­ag­ing Elec­tron­ic Resources in Libraries},
  vol­ume = {Vol-1272},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2014–a
  %A Arndt, Natanael
  %A Nuck, Sebas­t­ian
  %A Nareike, Andreas
  %A Radtke, Nor­man
  %A Seige, Lean­der
  %A Riechert, Thomas
  %B Pro­ceed­ings of the ISWC 2014 Posters \& Demon­stra­tions Track
  %C Riva del Gar­da, Italy
  %D 2014
  %E Hor­ridge, Matthew
  %E Rospocher, Mar­co
  %E van Ossen­bruggen, Jac­co
  %P 309–312
  %R 10.13140/2.1.2542.6882
  %T {AMSL}: Cre­at­ing a Linked Data Infra­struc­ture for Man­ag­ing Elec­tron­ic Resources in Libraries
  %U http://ceur-ws.org/Vol-1272/paper_66.pdf
  %V Vol-1272
  %X Elec­tron­ic resources (e.g. e‑journals, e‑books or data­bas­es) are gain­ing more an more impor­tance in libraries. With AMSL we demon­strate a flex­i­ble elec­tron­ic resource man­age­ment sys­tem which enables libraries to man­age their elec­tron­ic resources with a domain adapt­ed soft­ware based on the OntoWi­ki appli­ca­tion frame­work. Due to its gener­ic design and first of all flex­i­ble data mod­el the AMSL sys­tem can be eas­i­ly adjust­ed to upcom­ing require­ments. The con­se­quent use of Linked Data fur­ther enables libraries to build up a Linked Open Data infra­struc­ture for exchange of meta data.
  

• {Xodx}: A node for the Dis­trib­uted Seman­tic Social Net­workIn: Matthew Hor­ridge, Mar­co Rospocher and Jac­co van Ossen­bruggen (eds.): Pro­ceed­ings of the ISWC 2014 Posters \& Demon­stra­tions Track, CEUR Work­shop Pro­ceed­ings. vol. Vol-1272. Riva del Gar­da, Italy, pp. 465–468Natanael Arndt and Sebas­t­ian Tramp

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  We present Xodx (http://aksw.org/Projects/Xodx) an imple­men­ta­tion of a node for the Dis­trib­uted Seman­tic Social Net­work (DSSN). DSSN is a gen­er­al archi­tec­ture for build­ing an online social net­work using Seman­tic Web stan­dards and addi­tion­al pro­to­cols for real-time com­mu­ni­ca­tion such as Seman­tic Ping­back and Pub­Sub­Hub­bub. Xodx pro­vides func­tion­al­i­ty for pub­lish­ing and edit­ing per­son­al pro­files, adding friends to the friend list, send­ing and receiv­ing friend­ship requests, pub­lish­ing posts and sub­scrib­ing to update feeds across dis­trib­uted nodes.

  @inproceedings{arndt-n-2014–b,
  abstract = {We present Xodx (http://aksw.org/Projects/Xodx) an imple­men­ta­tion of a node for the Dis­trib­uted Seman­tic Social Net­work (DSSN). DSSN is a gen­er­al archi­tec­ture for build­ing an online social net­work using Seman­tic Web stan­dards and addi­tion­al pro­to­cols for real-time com­mu­ni­ca­tion such as Seman­tic Ping­back and Pub­Sub­Hub­bub. Xodx pro­vides func­tion­al­i­ty for pub­lish­ing and edit­ing per­son­al pro­files, adding friends to the friend list, send­ing and receiv­ing friend­ship requests, pub­lish­ing posts and sub­scrib­ing to update feeds across dis­trib­uted nodes.},
  address = {Riva del Gar­da, Italy},
  author = {Arndt, Natanael and Tramp, Sebas­t­ian},
  book­ti­tle = {Pro­ceed­ings of the ISWC 2014 Posters \& Demon­stra­tions Track},
  edi­tor = {Hor­ridge, Matthew and Rospocher, Mar­co and van Ossen­bruggen, Jac­co},
  key­words = {es},
  month = 10,
  pages = {465–468},
  series = {CEUR Work­shop Pro­ceed­ings},
  title = {{Xodx}: A node for the Dis­trib­uted Seman­tic Social Net­work},
  vol­ume = {Vol-1272},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2014–b
  %A Arndt, Natanael
  %A Tramp, Sebas­t­ian
  %B Pro­ceed­ings of the ISWC 2014 Posters \& Demon­stra­tions Track
  %C Riva del Gar­da, Italy
  %D 2014
  %E Hor­ridge, Matthew
  %E Rospocher, Mar­co
  %E van Ossen­bruggen, Jac­co
  %P 465–468
  %R 10.13140/2.1.4115.5524
  %T {Xodx}: A node for the Dis­trib­uted Seman­tic Social Net­work
  %U http://ceur-ws.org/Vol-1272/paper_154.pdf
  %V Vol-1272
  %X We present Xodx (http://aksw.org/Projects/Xodx) an imple­men­ta­tion of a node for the Dis­trib­uted Seman­tic Social Net­work (DSSN). DSSN is a gen­er­al archi­tec­ture for build­ing an online social net­work using Seman­tic Web stan­dards and addi­tion­al pro­to­cols for real-time com­mu­ni­ca­tion such as Seman­tic Ping­back and Pub­Sub­Hub­bub. Xodx pro­vides func­tion­al­i­ty for pub­lish­ing and edit­ing per­son­al pro­files, adding friends to the friend list, send­ing and receiv­ing friend­ship requests, pub­lish­ing posts and sub­scrib­ing to update feeds across dis­trib­uted nodes.
  

• con­TEXT — Light­weight Text Ana­lyt­ics using Linked DataIn: Extend­ed Seman­tic Web Con­fer­ence (ESWC 2014)Ali Khalili, S{ö}ren Auer and Axel-Cyrille {Ngonga Ngomo}

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The Web democ­ra­tized pub­lish­ing — every­body can eas­i­ly pub­lish infor­ma­tion on a Web­site, Blog, in social net­works or microblog­ging sys­tems. The more the amount of pub­lished infor­ma­tion grows, the more impor­tant are tech­nolo­gies for access­ing, analysing, sum­maris­ing and visu­al­is­ing infor­ma­tion. While sub­stan­tial progress has been made in the last years in each of these areas indi­vid­u­al­ly, we argue, that only the intel­li­gent com­bi­na­tion of approach­es will make this progress tru­ly use­ful and lever­age fur­ther syn­er­gies between tech­niques. In this paper we devel­op a text ana­lyt­ics archi­tec­ture of par­tic­i­pa­tion, which allows ordi­nary peo­ple to use sophis­ti­cat­ed NLP tech­niques for analysing and visu­al­iz­ing their con­tent, be it a Blog, Twit­ter feed, Web­site or arti­cle col­lec­tion. The archi­tec­ture com­pris­es inter­faces for infor­ma­tion access, nat­ur­al lan­guage pro­cess­ing and visu­al­iza­tion. Dif­fer­ent exchange­able com­po­nents can be plugged into this archi­tec­ture, mak­ing it easy to tai­lor for indi­vid­ual needs. We eval­u­ate the use­ful­ness of our approach by com­par­ing both the effec­tive­ness and effi­cien­cy of end users with­in a task-solv­ing set­ting. More­over, we eval­u­ate the usabil­i­ty of our approach using a ques­tion­naire-dri­ven approach. Both eval­u­a­tions sug­gest that ordi­nary Web users are empow­ered to analyse their data and per­form tasks, which were pre­vi­ous­ly out of reach.

  @inproceedings{conTEXT2014,
  abstract = {The Web democ­ra­tized pub­lish­ing — every­body can eas­i­ly pub­lish infor­ma­tion on a Web­site, Blog, in social net­works or microblog­ging sys­tems. The more the amount of pub­lished infor­ma­tion grows, the more impor­tant are tech­nolo­gies for access­ing, analysing, sum­maris­ing and visu­al­is­ing infor­ma­tion. While sub­stan­tial progress has been made in the last years in each of these areas indi­vid­u­al­ly, we argue, that only the intel­li­gent com­bi­na­tion of approach­es will make this progress tru­ly use­ful and lever­age fur­ther syn­er­gies between tech­niques. In this paper we devel­op a text ana­lyt­ics archi­tec­ture of par­tic­i­pa­tion, which allows ordi­nary peo­ple to use sophis­ti­cat­ed NLP tech­niques for analysing and visu­al­iz­ing their con­tent, be it a Blog, Twit­ter feed, Web­site or arti­cle col­lec­tion. The archi­tec­ture com­pris­es inter­faces for infor­ma­tion access, nat­ur­al lan­guage pro­cess­ing and visu­al­iza­tion. Dif­fer­ent exchange­able com­po­nents can be plugged into this archi­tec­ture, mak­ing it easy to tai­lor for indi­vid­ual needs. We eval­u­ate the use­ful­ness of our approach by com­par­ing both the effec­tive­ness and effi­cien­cy of end users with­in a task-solv­ing set­ting. More­over, we eval­u­ate the usabil­i­ty of our approach using a ques­tion­naire-dri­ven approach. Both eval­u­a­tions sug­gest that ordi­nary Web users are empow­ered to analyse their data and per­form tasks, which were pre­vi­ous­ly out of reach.},
  author = {Khalili, Ali and Auer, S{ö}ren and {Ngonga Ngo­mo}, Axel-Cyrille},
  book­ti­tle = {Extend­ed Seman­tic Web Con­fer­ence (ESWC 2014)},
  key­words = {sys:relevantFor:infai},
  title = {con­TEXT — Light­weight Text Ana­lyt­ics using Linked Data},
  year = 2014
  }
  

  %0 Con­fer­ence Paper
  %1 conTEXT2014
  %A Khalili, Ali
  %A Auer, S{ö}ren
  %A {Ngonga Ngo­mo}, Axel-Cyrille
  %B Extend­ed Seman­tic Web Con­fer­ence (ESWC 2014)
  %D 2014
  %T con­TEXT — Light­weight Text Ana­lyt­ics using Linked Data
  %U http://svn.aksw.org/papers/2014/ESWC_conTEXT/public.pdf
  %X The Web democ­ra­tized pub­lish­ing — every­body can eas­i­ly pub­lish infor­ma­tion on a Web­site, Blog, in social net­works or microblog­ging sys­tems. The more the amount of pub­lished infor­ma­tion grows, the more impor­tant are tech­nolo­gies for access­ing, analysing, sum­maris­ing and visu­al­is­ing infor­ma­tion. While sub­stan­tial progress has been made in the last years in each of these areas indi­vid­u­al­ly, we argue, that only the intel­li­gent com­bi­na­tion of approach­es will make this progress tru­ly use­ful and lever­age fur­ther syn­er­gies between tech­niques. In this paper we devel­op a text ana­lyt­ics archi­tec­ture of par­tic­i­pa­tion, which allows ordi­nary peo­ple to use sophis­ti­cat­ed NLP tech­niques for analysing and visu­al­iz­ing their con­tent, be it a Blog, Twit­ter feed, Web­site or arti­cle col­lec­tion. The archi­tec­ture com­pris­es inter­faces for infor­ma­tion access, nat­ur­al lan­guage pro­cess­ing and visu­al­iza­tion. Dif­fer­ent exchange­able com­po­nents can be plugged into this archi­tec­ture, mak­ing it easy to tai­lor for indi­vid­ual needs. We eval­u­ate the use­ful­ness of our approach by com­par­ing both the effec­tive­ness and effi­cien­cy of end users with­in a task-solv­ing set­ting. More­over, we eval­u­ate the usabil­i­ty of our approach using a ques­tion­naire-dri­ven approach. Both eval­u­a­tions sug­gest that ordi­nary Web users are empow­ered to analyse their data and per­form tasks, which were pre­vi­ous­ly out of reach.
  

2013

• Towards an {E}fficient {RDF} {D}ataset {S}licingIn: Inter­na­tion­al Jour­nal of Seman­tic Com­put­ing vol. 07, Nr. 04, pp. 455–477Edgard Marx, Tom­ma­so Soru, Saedeeh Shekar­pour, Sören Auer, Axel-Cyrille {Ngonga Ngo­mo} and Karin Breitman

  URLBib­TeXEnd­NoteBib­Son­o­my

  @article{doi:10.1142/S1793351X13400151,
  author = {Marx, Edgard and Soru, Tom­ma­so and Shekar­pour, Saedeeh and Auer, Sören and {Ngonga Ngo­mo}, Axel-Cyrille and Bre­it­man, Karin},
  jour­nal = {Inter­na­tion­al Jour­nal of Seman­tic Com­put­ing},
  key­words = {sys:relevantFor:lod2},
  num­ber = {04},
  pages = {455–477},
  title = {Towards an {E}fficient {RDF} {D}ataset {S}licing},
  vol­ume = {07},
  year = 2013
  }
  

  %0 Jour­nal Arti­cle
  %1 doi:10.1142/S1793351X13400151
  %A Marx, Edgard
  %A Soru, Tom­ma­so
  %A Shekar­pour, Saedeeh
  %A Auer, Sören
  %A {Ngonga Ngo­mo}, Axel-Cyrille
  %A Bre­it­man, Karin
  %D 2013
  %J Inter­na­tion­al Jour­nal of Seman­tic Com­put­ing
  %N 04
  %P 455–477
  %R 10.1142/S1793351X13400151
  %T Towards an {E}fficient {RDF} {D}ataset {S}licing
  %U http://www.worldscientific.com/doi/abs/10.1142/S1793351X13400151
  %V 07
  

• Increas­ing the Finan­cial Trans­paren­cy of Euro­pean Com­mis­sion Project Fund­ingIn: Seman­tic Web Jour­nal vol. Spe­cial Call for Linked Dataset descrip­tions, Nr. 2, pp. 157–164Michael Mar­tin, Claus Stadler, Philipp Frischmuth and Jens Lehmann

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The Finan­cial Trans­paren­cy Sys­tem (FTS) of the Euro­pean Com­mis­sion con­tains infor­ma­tion about grants for Euro­pean Union projects start­ing from 2007. It allows users to get an overview on EU fund­ing, includ­ing infor­ma­tion on ben­e­fi­cia­ries as well as the amount and type of expen­di­ture and infor­ma­tion on the respon­si­ble EU depart­ment. The orig­i­nal dataset is freely avail­able on the Euro­pean Com­mis­sion web­site, where users can query the data using an HTML form and down­load it in CSV and most recent­ly XML for­mat. In this arti­cle, we describe the trans­for­ma­tion of this data to RDF and its inter­link­ing with oth­er datasets. We show that this allows inter­est­ing queries over the data, which were very dif­fi­cult with­out this con­ver­sion. The main ben­e­fit of the dataset is an increased finan­cial trans­paren­cy of EU project fund­ing. The RDF ver­sion of the FTS dataset will become part of the EU Open Data Por­tal and even­tu­al­ly be host­ed and main­tained by the Euro­pean Union itself.

  @article{martin-fts,
  abstract = {The Finan­cial Trans­paren­cy Sys­tem (FTS) of the Euro­pean Com­mis­sion con­tains infor­ma­tion about grants for Euro­pean Union projects start­ing from 2007. It allows users to get an overview on EU fund­ing, includ­ing infor­ma­tion on ben­e­fi­cia­ries as well as the amount and type of expen­di­ture and infor­ma­tion on the respon­si­ble EU depart­ment. The orig­i­nal dataset is freely avail­able on the Euro­pean Com­mis­sion web­site, where users can query the data using an HTML form and down­load it in CSV and most recent­ly XML for­mat. In this arti­cle, we describe the trans­for­ma­tion of this data to RDF and its inter­link­ing with oth­er datasets. We show that this allows inter­est­ing queries over the data, which were very dif­fi­cult with­out this con­ver­sion. The main ben­e­fit of the dataset is an increased finan­cial trans­paren­cy of EU project fund­ing. The RDF ver­sion of the FTS dataset will become part of the EU Open Data Por­tal and even­tu­al­ly be host­ed and main­tained by the Euro­pean Union itself.},
  author = {Mar­tin, Michael and Stadler, Claus and Frischmuth, Philipp and Lehmann, Jens},
  jour­nal = {Seman­tic Web Jour­nal},
  key­words = {MOLE},
  num­ber = 2,
  pages = {157–164},
  title = {Increas­ing the Finan­cial Trans­paren­cy of Euro­pean Com­mis­sion Project Fund­ing},
  vol­ume = {Spe­cial Call for Linked Dataset descrip­tions},
  year = 2013
  }
  

  %0 Jour­nal Arti­cle
  %1 mar­tin-fts
  %A Mar­tin, Michael
  %A Stadler, Claus
  %A Frischmuth, Philipp
  %A Lehmann, Jens
  %D 2013
  %J Seman­tic Web Jour­nal
  %N 2
  %P 157–164
  %T Increas­ing the Finan­cial Trans­paren­cy of Euro­pean Com­mis­sion Project Fund­ing
  %U http://www.semantic-web-journal.net/system/files/swj435.pdf
  %V Spe­cial Call for Linked Dataset descrip­tions
  %X The Finan­cial Trans­paren­cy Sys­tem (FTS) of the Euro­pean Com­mis­sion con­tains infor­ma­tion about grants for Euro­pean Union projects start­ing from 2007. It allows users to get an overview on EU fund­ing, includ­ing infor­ma­tion on ben­e­fi­cia­ries as well as the amount and type of expen­di­ture and infor­ma­tion on the respon­si­ble EU depart­ment. The orig­i­nal dataset is freely avail­able on the Euro­pean Com­mis­sion web­site, where users can query the data using an HTML form and down­load it in CSV and most recent­ly XML for­mat. In this arti­cle, we describe the trans­for­ma­tion of this data to RDF and its inter­link­ing with oth­er datasets. We show that this allows inter­est­ing queries over the data, which were very dif­fi­cult with­out this con­ver­sion. The main ben­e­fit of the dataset is an increased finan­cial trans­paren­cy of EU project fund­ing. The RDF ver­sion of the FTS dataset will become part of the EU Open Data Por­tal and even­tu­al­ly be host­ed and main­tained by the Euro­pean Union itself.
  

• Using Semi­otic Pro­files to Design Graph­i­cal User Inter­faces for Social Media Data Spaces on Mobile Phone ScreensIn: Inter­na­tion­al Con­fer­ence on Com­pu­ta­tion­al Sci­ence and Its Appli­ca­tions (ICCSA). vol. 13 : IEEE, p. 4Andre Valdes­til­has, Ans­gar Scherp, Paulo Mar­cot­ti and So Paulo-Brazil

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{valdestilhas2013using,
  author = {Valdes­til­has, Andre and Scherp, Ans­gar and Mar­cot­ti, Paulo and Paulo-Brazil, So},
  book­ti­tle = {Inter­na­tion­al Con­fer­ence on Com­pu­ta­tion­al Sci­ence and Its Appli­ca­tions (ICCSA)},
  key­words = {sys:relevantFor:infai},
  orga­ni­za­tion = {IEEE},
  pages = 4,
  title = {Using Semi­otic Pro­files to Design Graph­i­cal User Inter­faces for Social Media Data Spaces on Mobile Phone Screens},
  vol­ume = 13,
  year = 2013
  }
  

  %0 Con­fer­ence Paper
  %1 valdestilhas2013using
  %A Valdes­til­has, Andre
  %A Scherp, Ans­gar
  %A Mar­cot­ti, Paulo
  %A Paulo-Brazil, So
  %B Inter­na­tion­al Con­fer­ence on Com­pu­ta­tion­al Sci­ence and Its Appli­ca­tions (ICCSA)
  %D 2013
  %P 4
  %T Using Semi­otic Pro­files to Design Graph­i­cal User Inter­faces for Social Media Data Spaces on Mobile Phone Screens
  %U http://dx.doi.org/10.1109/ICCSA.2013.45
  %V 13
  

2012

• Man­ag­ing the life-cycle of Linked Data with the {LOD2} StackIn: Pro­ceed­ings of Inter­na­tion­al Seman­tic Web Con­fer­ence (ISWC 2012). — 22\% accep­tance rateS{ö}ren Auer, Lorenz B{ü}hmann, Chris­t­ian Dirschl, Orri Erling, Michael Hausen­blas, Robert Ise­le, Jens Lehmann, Michael Mar­tin, Pablo N. Mendes, et al.

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{Auer+ISWC-2012,
  author = {Auer, S{ö}ren and B{ü}hmann, Lorenz and Dirschl, Chris­t­ian and Erling, Orri and Hausen­blas, Michael and Ise­le, Robert and Lehmann, Jens and Mar­tin, Michael and Mendes, Pablo N. and van Nuffe­len, Bert and Stadler, Claus and Tramp, Sebas­t­ian and Williams, Hugh},
  book­ti­tle = {Pro­ceed­ings of Inter­na­tion­al Seman­tic Web Con­fer­ence (ISWC 2012)},
  key­words = {sys:relevantFor:lod2},
  note = {22\% accep­tance rate},
  title = {Man­ag­ing the life-cycle of Linked Data with the {LOD2} Stack},
  year = 2012
  }
  

  %0 Con­fer­ence Paper
  %1 Auer+ISWC-2012
  %A Auer, S{ö}ren
  %A B{ü}hmann, Lorenz
  %A Dirschl, Chris­t­ian
  %A Erling, Orri
  %A Hausen­blas, Michael
  %A Ise­le, Robert
  %A Lehmann, Jens
  %A Mar­tin, Michael
  %A Mendes, Pablo N.
  %A van Nuffe­len, Bert
  %A Stadler, Claus
  %A Tramp, Sebas­t­ian
  %A Williams, Hugh
  %B Pro­ceed­ings of Inter­na­tion­al Seman­tic Web Con­fer­ence (ISWC 2012)
  %D 2012
  %T Man­ag­ing the life-cycle of Linked Data with the {LOD2} Stack
  %U http://iswc2012.semanticweb.org/sites/default/files/76500001.pdf
  

• The Dig­i­tal Agen­da Score­board: A Sta­tis­ti­cal Anato­my of Europe’s way into the Infor­ma­tion Age : Uni­ver­si­ty of LeipzigMichael Mar­tin, Bert van Nuffe­len, Ste­fano Abruzzi­ni and S{ö}ren Auer

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Evi­dence-based pol­i­cy is pol­i­cy informed by rig­or­ous­ly estab­lished objec­tive evi­dence. An impor­tant aspect of evi­dence-based pol­i­cy is the use of sci­en­tif­i­cal­ly rig­or­ous stud­ies to iden­ti­fy pro­grams and prac­tices capa­ble of improv­ing pol­i­cy rel­e­vant out­comes. Sta­tis­tics rep­re­sent a cru­cial means to deter­mine whether progress is made towards pol­i­cy tar­gets. In May 2010, the Euro­pean Com­mis­sion adopt­ed the Dig­i­tal Agen­da for Europe, a strat­e­gy to take advan­tage of the poten­tial offered by the rapid progress of dig­i­tal tech­nolo­gies. The Dig­i­tal Agen­da con­tains com­mit­ments to under­take a num­ber of spe­cif­ic pol­i­cy actions intend­ed to stim­u­late a cir­cle of invest­ment in and usage of dig­i­tal tech­nolo­gies. It iden­ti­fies 13 key per­for­mance tar­gets. In order to chart the progress of both the announced pol­i­cy actions and the key per­for­mance tar­gets a score­board is pub­lished, thus allow­ing the mon­i­tor­ing and bench­mark­ing of the main devel­op­ments of infor­ma­tion soci­ety in Euro­pean coun­tries. In addi­tion to these human-read­able brows­ing, visu­al­iza­tion and explo­ration meth­ods, machine-read­able access facil­i­tat­ing re-usage and inter­link­ing of the under­ly­ing data is pro­vid­ed by means of RDF and Linked Open Data. We sketch the trans­for­ma­tion process from raw data up to rich, inter­linked RDF, describe its pub­lish­ing and the lessons learned.

  @techreport{martin-scoreboard,
  abstract = {Evi­dence-based pol­i­cy is pol­i­cy informed by rig­or­ous­ly estab­lished objec­tive evi­dence. An impor­tant aspect of evi­dence-based pol­i­cy is the use of sci­en­tif­i­cal­ly rig­or­ous stud­ies to iden­ti­fy pro­grams and prac­tices capa­ble of improv­ing pol­i­cy rel­e­vant out­comes. Sta­tis­tics rep­re­sent a cru­cial means to deter­mine whether progress is made towards pol­i­cy tar­gets. In May 2010, the Euro­pean Com­mis­sion adopt­ed the Dig­i­tal Agen­da for Europe, a strat­e­gy to take advan­tage of the poten­tial offered by the rapid progress of dig­i­tal tech­nolo­gies. The Dig­i­tal Agen­da con­tains com­mit­ments to under­take a num­ber of spe­cif­ic pol­i­cy actions intend­ed to stim­u­late a cir­cle of invest­ment in and usage of dig­i­tal tech­nolo­gies. It iden­ti­fies 13 key per­for­mance tar­gets. In order to chart the progress of both the announced pol­i­cy actions and the key per­for­mance tar­gets a score­board is pub­lished, thus allow­ing the mon­i­tor­ing and bench­mark­ing of the main devel­op­ments of infor­ma­tion soci­ety in Euro­pean coun­tries. In addi­tion to these human-read­able brows­ing, visu­al­iza­tion and explo­ration meth­ods, machine-read­able access facil­i­tat­ing re-usage and inter­link­ing of the under­ly­ing data is pro­vid­ed by means of RDF and Linked Open Data. We sketch the trans­for­ma­tion process from raw data up to rich, inter­linked RDF, describe its pub­lish­ing and the lessons learned.},
  author = {Mar­tin, Michael and van Nuffe­len, Bert and Abruzzi­ni, Ste­fano and Auer, S{ö}ren},
  insti­tu­tion = {Uni­ver­si­ty of Leipzig},
  key­words = {sys:relevantFor:infai},
  title = {The Dig­i­tal Agen­da Score­board: A Sta­tis­ti­cal Anato­my of Europe’s way into the Infor­ma­tion Age},
  year = 2012
  }
  

  %0 Report
  %1 mar­tin-score­board
  %A Mar­tin, Michael
  %A van Nuffe­len, Bert
  %A Abruzzi­ni, Ste­fano
  %A Auer, S{ö}ren
  %D 2012
  %T The Dig­i­tal Agen­da Score­board: A Sta­tis­ti­cal Anato­my of Europe’s way into the Infor­ma­tion Age
  %U http://svn.aksw.org/papers/2012/SWJ-Scoreboard/public.pdf
  %X Evi­dence-based pol­i­cy is pol­i­cy informed by rig­or­ous­ly estab­lished objec­tive evi­dence. An impor­tant aspect of evi­dence-based pol­i­cy is the use of sci­en­tif­i­cal­ly rig­or­ous stud­ies to iden­ti­fy pro­grams and prac­tices capa­ble of improv­ing pol­i­cy rel­e­vant out­comes. Sta­tis­tics rep­re­sent a cru­cial means to deter­mine whether progress is made towards pol­i­cy tar­gets. In May 2010, the Euro­pean Com­mis­sion adopt­ed the Dig­i­tal Agen­da for Europe, a strat­e­gy to take advan­tage of the poten­tial offered by the rapid progress of dig­i­tal tech­nolo­gies. The Dig­i­tal Agen­da con­tains com­mit­ments to under­take a num­ber of spe­cif­ic pol­i­cy actions intend­ed to stim­u­late a cir­cle of invest­ment in and usage of dig­i­tal tech­nolo­gies. It iden­ti­fies 13 key per­for­mance tar­gets. In order to chart the progress of both the announced pol­i­cy actions and the key per­for­mance tar­gets a score­board is pub­lished, thus allow­ing the mon­i­tor­ing and bench­mark­ing of the main devel­op­ments of infor­ma­tion soci­ety in Euro­pean coun­tries. In addi­tion to these human-read­able brows­ing, visu­al­iza­tion and explo­ration meth­ods, machine-read­able access facil­i­tat­ing re-usage and inter­link­ing of the under­ly­ing data is pro­vid­ed by means of RDF and Linked Open Data. We sketch the trans­for­ma­tion process from raw data up to rich, inter­linked RDF, describe its pub­lish­ing and the lessons learned.
  

2011

• Weav­ing a {D}istributed, {S}emantic {S}ocial {N}etwork for {M}obile {U}sersIn: Pro­ceed­ings of the ESWC2011Sebas­t­ian Tramp, Philipp Frischmuth, Natanael Arndt, Tim­o­fey Ermilov and S{ö}ren Auer

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  Smart­phones, which con­tain a large num­ber of sen­sors and inte­grat­ed devices, are becom­ing increas­ing­ly pow­er­ful and ful­ly fea­tured com­put­ing plat­forms in our pock­ets. For many peo­ple they already replace the com­put­er as their win­dow to the Inter­net, to the Web as well as to social net­works. Hence, the man­age­ment and pre­sen­ta­tion of infor­ma­tion about con­tacts, social rela­tion­ships and asso­ci­at­ed infor­ma­tion is one of the main require­ments and fea­tures of today’s smart­phones. The prob­lem is cur­rent­ly solved only for cen­tral­ized pro­pri­etary plat­forms (such as Google mail, con­tacts & cal­en­dar) as well as data-silo-like social net­works (e.g. Face­book). With­in the Seman­tic Web ini­tia­tive stan­dards and best-prac­tices for social, Seman­tic Web appli­ca­tions such as FOAF emerged. How­ev­er, there is no com­pre­hen­sive strat­e­gy, how these tech­nolo­gies can be used effi­cient­ly in a mobile envi­ron­ment. In this paper we present the archi­tec­ture as well as the imple­men­ta­tion of a mobile Social Seman­tic Web frame­work, which weaves a dis­trib­uted social net­work based on seman­tic technologies.

  @inproceedings{tramp-s-2011–a,
  abstract = {Smart­phones, which con­tain a large num­ber of sen­sors and inte­grat­ed devices, are becom­ing increas­ing­ly pow­er­ful and ful­ly fea­tured com­put­ing plat­forms in our pock­ets. For many peo­ple they already replace the com­put­er as their win­dow to the Inter­net, to the Web as well as to social net­works. Hence, the man­age­ment and pre­sen­ta­tion of infor­ma­tion about con­tacts, social rela­tion­ships and asso­ci­at­ed infor­ma­tion is one of the main require­ments and fea­tures of today’s smart­phones. The prob­lem is cur­rent­ly solved only for cen­tral­ized pro­pri­etary plat­forms (such as Google mail, con­tacts & cal­en­dar) as well as data-silo-like social net­works (e.g. Face­book). With­in the Seman­tic Web ini­tia­tive stan­dards and best-prac­tices for social, Seman­tic Web appli­ca­tions such as FOAF emerged. How­ev­er, there is no com­pre­hen­sive strat­e­gy, how these tech­nolo­gies can be used effi­cient­ly in a mobile envi­ron­ment. In this paper we present the archi­tec­ture as well as the imple­men­ta­tion of a mobile Social Seman­tic Web frame­work, which weaves a dis­trib­uted social net­work based on seman­tic tech­nolo­gies.},
  author = {Tramp, Sebas­t­ian and Frischmuth, Philipp and Arndt, Natanael and Ermilov, Tim­o­fey and Auer, S{ö}ren},
  book­ti­tle = {Pro­ceed­ings of the ESWC2011},
  key­words = {sys:relevantFor:lod2},
  title = {Weav­ing a {D}istributed, {S}emantic {S}ocial {N}etwork for {M}obile {U}sers},
  year = 2011
  }
  

  %0 Con­fer­ence Paper
  %1 tramp-s-2011–a
  %A Tramp, Sebas­t­ian
  %A Frischmuth, Philipp
  %A Arndt, Natanael
  %A Ermilov, Tim­o­fey
  %A Auer, S{ö}ren
  %B Pro­ceed­ings of the ESWC2011
  %D 2011
  %R 10.1007/978–3‑642–21034-1_14
  %T Weav­ing a {D}istributed, {S}emantic {S}ocial {N}etwork for {M}obile {U}sers
  %U http://svn.aksw.org/papers/2011/ESWC_MobileSocialSemanticWeb/public.pdf
  %X Smart­phones, which con­tain a large num­ber of sen­sors and inte­grat­ed devices, are becom­ing increas­ing­ly pow­er­ful and ful­ly fea­tured com­put­ing plat­forms in our pock­ets. For many peo­ple they already replace the com­put­er as their win­dow to the Inter­net, to the Web as well as to social net­works. Hence, the man­age­ment and pre­sen­ta­tion of infor­ma­tion about con­tacts, social rela­tion­ships and asso­ci­at­ed infor­ma­tion is one of the main require­ments and fea­tures of today’s smart­phones. The prob­lem is cur­rent­ly solved only for cen­tral­ized pro­pri­etary plat­forms (such as Google mail, con­tacts & cal­en­dar) as well as data-silo-like social net­works (e.g. Face­book). With­in the Seman­tic Web ini­tia­tive stan­dards and best-prac­tices for social, Seman­tic Web appli­ca­tions such as FOAF emerged. How­ev­er, there is no com­pre­hen­sive strat­e­gy, how these tech­nolo­gies can be used effi­cient­ly in a mobile envi­ron­ment. In this paper we present the archi­tec­ture as well as the imple­men­ta­tion of a mobile Social Seman­tic Web frame­work, which weaves a dis­trib­uted social net­work based on seman­tic technologies.
  

• Emo­tion-ori­ent­ed com­put­ing: Pos­si­ble uses and appli­ca­tionsIn: Jour­nal of Media and Com­mu­ni­ca­tion Stud­ies vol. 3, Aca­d­e­m­ic Jour­nals, Nr. 10, pp. 289–294Andr{é} Valdes­til­has and Paulo Marcotii

  URLBib­TeXEnd­NoteBib­Son­o­my

  @article{valdestilhas2011emotion‑b,
  author = {Valdes­til­has, Andr{é} and Mar­cotii, Paulo},
  jour­nal = {Jour­nal of Media and Com­mu­ni­ca­tion Stud­ies},
  key­words = {sys:relevantFor:infai},
  num­ber = 10,
  pages = {289–294},
  pub­lish­er = {Aca­d­e­m­ic Jour­nals},
  title = {Emo­tion-ori­ent­ed com­put­ing: Pos­si­ble uses and appli­ca­tions},
  vol­ume = 3,
  year = 2011
  }
  

  %0 Jour­nal Arti­cle
  %1 valdestilhas2011emotion‑b
  %A Valdes­til­has, Andr{é}
  %A Mar­cotii, Paulo
  %D 2011
  %I Aca­d­e­m­ic Jour­nals
  %J Jour­nal of Media and Com­mu­ni­ca­tion Stud­ies
  %N 10
  %P 289–294
  %T Emo­tion-ori­ent­ed com­put­ing: Pos­si­ble uses and appli­ca­tions
  %U http://www.academicjournals.org/article/article1380286570_Valdestilhas%20and%20Paulo%20Marcotii.pdf
  %V 3
  

• Emo­tion-ori­ent­ed com­put­ing: Pos­si­ble uses and resourcesIn: Ubi-Media Com­put­ing (U‑Media), 2011 4th Inter­na­tion­al Con­fer­ence on : IEEE, pp. 130–133Andr{é} Valdes­til­has

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{valdestilhas2011emotion,
  author = {Valdes­til­has, Andr{é}},
  book­ti­tle = {Ubi-Media Com­put­ing (U‑Media), 2011 4th Inter­na­tion­al Con­fer­ence on},
  key­words = {sys:relevantFor:infai},
  orga­ni­za­tion = {IEEE},
  pages = {130–133},
  title = {Emo­tion-ori­ent­ed com­put­ing: Pos­si­ble uses and resources},
  year = 2011
  }
  

  %0 Con­fer­ence Paper
  %1 valdestilhas2011emotion
  %A Valdes­til­has, Andr{é}
  %B Ubi-Media Com­put­ing (U‑Media), 2011 4th Inter­na­tion­al Con­fer­ence on
  %D 2011
  %P 130–133
  %T Emo­tion-ori­ent­ed com­put­ing: Pos­si­ble uses and resources
  %U http://dx.doi.org/10.1109/U‑MEDIA.2011.16
  

• The Open Gov­ern­ment Data Stake­hold­er Sur­veyIn: Pro­ceed­ings of the Open Knowl­edge Con­fer­ence in 2011 : Open Knowl­edge Foun­da­tionMichael Mar­tin, Mar­tin Kaltenb{ö}ck, Hel­mut Nagy and S{ö}ren Auer

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  This paper describes the results of the LOD2 Open Gov­ern­ment Data Stake­hold­er Sur­vey 2010 (OGD Stake­hold­er Sur­vey). The objec­tive of the sur­vey was to involve as many rel­e­vant stake­hold­ers as pos­si­ble in the 27 Euro­pean Union coun­tries in an online ques­tion­naire and ask them about their needs and require­ments in the area of open data as well as for the publicdata.eu por­tal. The main areas of the sur­vey have been ques­tions about Open Gov­ern­ment Data itself, ques­tions about data, about the usage of data, ques­tions about the require­ments for a cen­tralised data cat­a­logue as well as ques­tions about the par­tic­i­pants them­selves. The goal of the OGD Stake­hold­er Sur­vey has been to reach a broad audi­ence of the main stake­hold­ers of open data: cit­i­zens, pub­lic admin­is­tra­tion, pol­i­tics and indus­try. In the course of the sur­vey that was open for 5 weeks from Novem­ber 2010 to Decem­ber 2010 in total 329 par­tic­i­pants com­plet­ed the sur­vey. The results have been pub­lished in April 2011 in the form of HTML and PDF, the raw data in CSV. In addi­tion to these pub­li­ca­tion for­mats (HTML, PDF, CSV) we pub­lished the data also as Linked Data using var­i­ous vocab­u­lar­ies and tools.

  @inproceedings{martin-2011-okcon,
  abstract = {This paper describes the results of the LOD2 Open Gov­ern­ment Data Stake­hold­er Sur­vey 2010 (OGD Stake­hold­er Sur­vey). The objec­tive of the sur­vey was to involve as many rel­e­vant stake­hold­ers as pos­si­ble in the 27 Euro­pean Union coun­tries in an online ques­tion­naire and ask them about their needs and require­ments in the area of open data as well as for the publicdata.eu por­tal. The main areas of the sur­vey have been ques­tions about Open Gov­ern­ment Data itself, ques­tions about data, about the usage of data, ques­tions about the require­ments for a cen­tralised data cat­a­logue as well as ques­tions about the par­tic­i­pants them­selves. The goal of the OGD Stake­hold­er Sur­vey has been to reach a broad audi­ence of the main stake­hold­ers of open data: cit­i­zens, pub­lic admin­is­tra­tion, pol­i­tics and indus­try. In the course of the sur­vey that was open for 5 weeks from Novem­ber 2010 to Decem­ber 2010 in total 329 par­tic­i­pants com­plet­ed the sur­vey. The results have been pub­lished in April 2011 in the form of HTML and PDF, the raw data in CSV. In addi­tion to these pub­li­ca­tion for­mats (HTML, PDF, CSV) we pub­lished the data also as Linked Data using var­i­ous vocab­u­lar­ies and tools.},
  author = {Mar­tin, Michael and Kaltenb{ö}ck, Mar­tin and Nagy, Hel­mut and Auer, S{ö}ren},
  book­ti­tle = {Pro­ceed­ings of the Open Knowl­edge Con­fer­ence in 2011},
  key­words = {sys:relevantFor:infai},
  month = {06},
  orga­ni­za­tion = {Open Knowl­edge Foun­da­tion},
  title = {The Open Gov­ern­ment Data Stake­hold­er Sur­vey},
  year = 2011
  }
  

  %0 Con­fer­ence Paper
  %1 mar­tin-2011-okcon
  %A Mar­tin, Michael
  %A Kaltenb{ö}ck, Mar­tin
  %A Nagy, Hel­mut
  %A Auer, S{ö}ren
  %B Pro­ceed­ings of the Open Knowl­edge Con­fer­ence in 2011
  %D 2011
  %T The Open Gov­ern­ment Data Stake­hold­er Sur­vey
  %U http://okcon.org/2011/programme/the-open-government-data-stakeholder-survey
  %X This paper describes the results of the LOD2 Open Gov­ern­ment Data Stake­hold­er Sur­vey 2010 (OGD Stake­hold­er Sur­vey). The objec­tive of the sur­vey was to involve as many rel­e­vant stake­hold­ers as pos­si­ble in the 27 Euro­pean Union coun­tries in an online ques­tion­naire and ask them about their needs and require­ments in the area of open data as well as for the publicdata.eu por­tal. The main areas of the sur­vey have been ques­tions about Open Gov­ern­ment Data itself, ques­tions about data, about the usage of data, ques­tions about the require­ments for a cen­tralised data cat­a­logue as well as ques­tions about the par­tic­i­pants them­selves. The goal of the OGD Stake­hold­er Sur­vey has been to reach a broad audi­ence of the main stake­hold­ers of open data: cit­i­zens, pub­lic admin­is­tra­tion, pol­i­tics and indus­try. In the course of the sur­vey that was open for 5 weeks from Novem­ber 2010 to Decem­ber 2010 in total 329 par­tic­i­pants com­plet­ed the sur­vey. The results have been pub­lished in April 2011 in the form of HTML and PDF, the raw data in CSV. In addi­tion to these pub­li­ca­tion for­mats (HTML, PDF, CSV) we pub­lished the data also as Linked Data using var­i­ous vocab­u­lar­ies and tools.
  

• Man­ag­ing Mul­ti­modal and Mul­ti­lin­gual Seman­tic Con­tentIn: Pro­ceed­ings of the 7th Inter­na­tion­al Con­fer­ence on Web Infor­ma­tion Sys­tems and Tech­nolo­giesMichael Mar­tin, Daniel Ger­ber, Nor­man Heino, S{ö}ren Auer and Tim­o­fey Ermilov

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  With the advent and increas­ing pop­u­lar­i­ty of Seman­tic Wikis and the Linked Data the man- age­ment of seman­ti­cal­ly rep­re­sent­ed knowl­edge became main­stream. How­ev­er, cer­tain cat­e­gories of seman­ti­cal­ly enriched con­tent, such as mul­ti­modal doc­u­ments as well as mul­ti­lin­gual tex­tu­al resources are still dif­fi­cult to han­dle. In this paper, we present a com­pre­hen­sive strat­e­gy for man­ag­ing the life-cycle of both mul­ti­modal and mul­ti­lin­gual seman­ti­cal­ly enriched con­tent. The strat­e­gy is based on extend­ing a num­ber of seman­tic knowl­edge man­age­ment tech­niques such as author­ing, ver­sion­ing, evo­lu­tion, access and explo­ration for seman­ti­cal­ly enriched mul­ti­modal and mul­ti­lin­gual con­tent. We show­case an imple­men­ta­tion and user inter­face based on the seman­tic wiki par­a­digm and present a use case from the e‑tourism domain.

  @inproceedings{martin-s-2011,
  abstract = {With the advent and increas­ing pop­u­lar­i­ty of Seman­tic Wikis and the Linked Data the man- age­ment of seman­ti­cal­ly rep­re­sent­ed knowl­edge became main­stream. How­ev­er, cer­tain cat­e­gories of seman­ti­cal­ly enriched con­tent, such as mul­ti­modal doc­u­ments as well as mul­ti­lin­gual tex­tu­al resources are still dif­fi­cult to han­dle. In this paper, we present a com­pre­hen­sive strat­e­gy for man­ag­ing the life-cycle of both mul­ti­modal and mul­ti­lin­gual seman­ti­cal­ly enriched con­tent. The strat­e­gy is based on extend­ing a num­ber of seman­tic knowl­edge man­age­ment tech­niques such as author­ing, ver­sion­ing, evo­lu­tion, access and explo­ration for seman­ti­cal­ly enriched mul­ti­modal and mul­ti­lin­gual con­tent. We show­case an imple­men­ta­tion and user inter­face based on the seman­tic wiki par­a­digm and present a use case from the e‑tourism domain.},
  author = {Mar­tin, Michael and Ger­ber, Daniel and Heino, Nor­man and Auer, S{ö}ren and Ermilov, Tim­o­fey},
  book­ti­tle = {Pro­ceed­ings of the 7th Inter­na­tion­al Con­fer­ence on Web Infor­ma­tion Sys­tems and Tech­nolo­gies},
  key­words = {mul­ti­lin­gual},
  title = {Man­ag­ing Mul­ti­modal and Mul­ti­lin­gual Seman­tic Con­tent},
  year = 2011
  }
  

  %0 Con­fer­ence Paper
  %1 mar­tin-s-2011
  %A Mar­tin, Michael
  %A Ger­ber, Daniel
  %A Heino, Nor­man
  %A Auer, S{ö}ren
  %A Ermilov, Tim­o­fey
  %B Pro­ceed­ings of the 7th Inter­na­tion­al Con­fer­ence on Web Infor­ma­tion Sys­tems and Tech­nolo­gies
  %D 2011
  %T Man­ag­ing Mul­ti­modal and Mul­ti­lin­gual Seman­tic Con­tent
  %X With the advent and increas­ing pop­u­lar­i­ty of Seman­tic Wikis and the Linked Data the man- age­ment of seman­ti­cal­ly rep­re­sent­ed knowl­edge became main­stream. How­ev­er, cer­tain cat­e­gories of seman­ti­cal­ly enriched con­tent, such as mul­ti­modal doc­u­ments as well as mul­ti­lin­gual tex­tu­al resources are still dif­fi­cult to han­dle. In this paper, we present a com­pre­hen­sive strat­e­gy for man­ag­ing the life-cycle of both mul­ti­modal and mul­ti­lin­gual seman­ti­cal­ly enriched con­tent. The strat­e­gy is based on extend­ing a num­ber of seman­tic knowl­edge man­age­ment tech­niques such as author­ing, ver­sion­ing, evo­lu­tion, access and explo­ration for seman­ti­cal­ly enriched mul­ti­modal and mul­ti­lin­gual con­tent. We show­case an imple­men­ta­tion and user inter­face based on the seman­tic wiki par­a­digm and present a use case from the e‑tourism domain.
  

• Facil­i­ta­tion the pub­li­ca­tion of Open Gov­ern­men­tal Data with the LOD2 StackIn: Share PSIS{ö}ren Auer, Michael Mar­tin, Philipp Frischmuth and Bas­ti­aan Deblieck

  URLBib­TeXEnd­NoteBib­Son­o­my

  @article{auer-2011-sharepsi,
  author = {Auer, S{ö}ren and Mar­tin, Michael and Frischmuth, Philipp and Deblieck, Bas­ti­aan},
  jour­nal = {Share PSI},
  key­words = {sys:relevantFor:infai},
  month = {05},
  title = {Facil­i­ta­tion the pub­li­ca­tion of Open Gov­ern­men­tal Data with the LOD2 Stack},
  year = 2011
  }
  

  %0 Jour­nal Arti­cle
  %1 auer-2011-sharep­si
  %A Auer, S{ö}ren
  %A Mar­tin, Michael
  %A Frischmuth, Philipp
  %A Deblieck, Bas­ti­aan
  %D 2011
  %J Share PSI
  %T Facil­i­ta­tion the pub­li­ca­tion of Open Gov­ern­men­tal Data with the LOD2 Stack
  %U http://share-psi.eu/papers/LOD2.pdf
  

• Triple­Place: A flex­i­ble triple store for Android with six indicesIn: S{ö}ren Auer, Thomas Riechert and Johannes Schmidt (eds.): Pro­ceed­ings of the Stu­den­tenkon­ferenz Infor­matik Leipzig 2011, Leipziger Beitr{ä}ge zur Infor­matik. vol. XXVII. Leipzig, Ger­many — ISBN 978–3‑941608–14‑6, pp. 1–7Natanael Arndt

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{arndt-2011-triple-place‑,
  address = {Leipzig, Ger­many},
  author = {Arndt, Natanael},
  book­ti­tle = {Pro­ceed­ings of the Stu­den­tenkon­ferenz Infor­matik Leipzig 2011},
  edi­tor = {Auer, S{ö}ren and Riechert, Thomas and Schmidt, Johannes},
  key­words = {ES},
  month = 12,
  pages = {1–7},
  series = {Leipziger Beitr{ä}ge zur Infor­matik},
  title = {Triple­Place: A flex­i­ble triple store for Android with six indices},
  vol­ume = {XXVII},
  year = 2011
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-2011-triple-place-
  %A Arndt, Natanael
  %B Pro­ceed­ings of the Stu­den­tenkon­ferenz Infor­matik Leipzig 2011
  %C Leipzig, Ger­many
  %D 2011
  %E Auer, S{ö}ren
  %E Riechert, Thomas
  %E Schmidt, Johannes
  %P 1–7
  %T Triple­Place: A flex­i­ble triple store for Android with six indices
  %U http://skil.informatik.uni-leipzig.de/blog/wp-content/uploads/proceedings/2011/Arndt2011.1.pdf
  %V XXVII
  %@ 978–3‑941608–14‑6
  

2010

• Cat­e­gori­sa­tion of Seman­tic Web Appli­ca­tionsIn: pro­ceed­ings of the 4th Inter­na­tion­al Con­fer­ence on Advances in Seman­tic Pro­cess­ing (SEMAPRO2010) 25 Octo­ber — 30 Octo­ber, Flo­rence, ItalyMichael Mar­tin and S{ö}ren Auer

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{martin-2010-swa,
  author = {Mar­tin, Michael and Auer, S{ö}ren},
  book­ti­tle = {pro­ceed­ings of the 4th Inter­na­tion­al Con­fer­ence on Advances in Seman­tic Pro­cess­ing (SEMAPRO2010) 25 Octo­ber — 30 Octo­ber, Flo­rence, Italy},
  key­words = {sys:relevantFor:lod2},
  month = 10,
  title = {Cat­e­gori­sa­tion of Seman­tic Web Appli­ca­tions},
  year = 2010
  }
  

  %0 Con­fer­ence Paper
  %1 mar­tin-2010-swa
  %A Mar­tin, Michael
  %A Auer, S{ö}ren
  %B pro­ceed­ings of the 4th Inter­na­tion­al Con­fer­ence on Advances in Seman­tic Pro­cess­ing (SEMAPRO2010) 25 Octo­ber — 30 Octo­ber, Flo­rence, Italy
  %D 2010
  %T Cat­e­gori­sa­tion of Seman­tic Web Appli­ca­tions
  %U http://svn.aksw.org/papers/2010/SEMAPRO_Categorisation_SWA/public.pdf
  

• {E}ntwicklung eines mobilen {S}ocial {S}emantic {W}eb {C}lientsIn: Klaus-Peter F{ä}hnrich and Bog­dan Franczyk (eds.): Pro­ceed­ings of the INFORMATIK 2010: Ser­vice Sci­ence — Neue Per­spek­tiv­en f{ü}r die Infor­matik, GI-Edition—Lecture Notes in Infor­mat­ics. vol. P‑176 : Gesellschaft f{ü}r Infor­matik e.V.. — {\copy­right} 2010 Gesellschaft f{ü}r Infor­matik — ISBN 978–3‑88579–270‑3, pp. 1004–1005Natanael Arndt

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{arndt-n-2010–,
  author = {Arndt, Natanael},
  book­ti­tle = {Pro­ceed­ings of the INFORMATIK 2010: Ser­vice Sci­ence — Neue Per­spek­tiv­en f{ü}r die Infor­matik},
  edi­tor = {F{ä}hnrich, Klaus-Peter and Franczyk, Bog­dan},
  key­words = {ES},
  month = {09},
  note = {{\copy­right} 2010 Gesellschaft f{ü}r Infor­matik},
  orga­ni­za­tion = {Gesellschaft f{ü}r Infor­matik e.V.},
  pages = {1004–1005},
  series = {GI-Edition—Lecture Notes in Infor­mat­ics},
  title = {{E}ntwicklung eines mobilen {S}ocial {S}emantic {W}eb {C}lients},
  vol­ume = {P‑176},
  year = 2010
  }
  

  %0 Con­fer­ence Paper
  %1 arndt-n-2010–
  %A Arndt, Natanael
  %B Pro­ceed­ings of the INFORMATIK 2010: Ser­vice Sci­ence — Neue Per­spek­tiv­en f{ü}r die Infor­matik
  %D 2010
  %E F{ä}hnrich, Klaus-Peter
  %E Franczyk, Bog­dan
  %P 1004–1005
  %T {E}ntwicklung eines mobilen {S}ocial {S}emantic {W}eb {C}lients
  %U https://dl.gi.de/bitstream/handle/20.500.12116/19365/1004.pdf
  %V P‑176
  %@ 978–3‑88579–270‑3
  

• Orts­be­zo­gene Nav­i­ga­tion basierend auf einem Vok­ab­u­lar zur Erzeu­gung geo­graphis­ch­er Hier­ar­chienIn: Ulf Mor­gen­stern and Thomas Riechert (eds.): Cat­a­lo­gus Pro­fes­so­rum Lip­sien­sis — Konzep­tion, tech­nis­che Umset­zung und Anwen­dun­gen f{ü}r Pro­fes­sorenkat­a­loge im Seman­tic Web, Leipziger Beitr{ä}ge zur Infor­matik. vol. 21 : Leipziger Infor­matik-Ver­bund (LIV), pp. 107–116Michael Mar­tin and Thomas Riechert

  AbstractBib­TeXEnd­NoteBib­Son­o­my

  Der geschichtswis­senschaftliche Pro­fes­sorenkat­a­log der Universit{ä}t Leipzig enth{ä}lt u.a. Infor­ma­tio­nen zu Lebensl{ä}ufen von Pro­fes­soren, die an der Universit{ä}t Leipzig seit dem Jahr 1409 lehrten. Diese his­torischen Infor­ma­tio­nen wer­den in einem kol­lab­o­ra­tiv­en Prozess unter Ver­wen­dung des seman­tis­chen Dat­en-Wikis OntoWi­ki aquiri­ert und pub­liziert. Mit dem Pro­fes­sorenkat­a­log liegt eine Wis­sens­ba­sis vor, die auch geografis­che Infor­ma­tio­nen zu Geburts‑, Graduierungs- und Ster­be­orten von Pro­fes­soren enth{ä}lt. Der Buch­beitrag stellt einen Evo­lu­tion­sprozess und die Ver­wen­dung eines geeigneten Vok­ab­u­lars vor, um die impliz­it enthal­tene Geo-Hier­ar­chie aufzuar­beit­en. Die daraus resul­tierende Geo-Hier­ar­chie wird anschließend zur Nav­i­ga­tion eingesetzt.

  @incollection{martin-m-2010–clp,
  abstract = {Der geschichtswis­senschaftliche Pro­fes­sorenkat­a­log der Universit{ä}t Leipzig enth{ä}lt u.a. Infor­ma­tio­nen zu Lebensl{ä}ufen von Pro­fes­soren, die an der Universit{ä}t Leipzig seit dem Jahr 1409 lehrten. Diese his­torischen Infor­ma­tio­nen wer­den in einem kol­lab­o­ra­tiv­en Prozess unter Ver­wen­dung des seman­tis­chen Dat­en-Wikis OntoWi­ki aquiri­ert und pub­liziert. Mit dem Pro­fes­sorenkat­a­log liegt eine Wis­sens­ba­sis vor, die auch geografis­che Infor­ma­tio­nen zu Geburts‑, Graduierungs- und Ster­be­orten von Pro­fes­soren enth{ä}lt. Der Buch­beitrag stellt einen Evo­lu­tion­sprozess und die Ver­wen­dung eines geeigneten Vok­ab­u­lars vor, um die impliz­it enthal­tene Geo-Hier­ar­chie aufzuar­beit­en. Die daraus resul­tierende Geo-Hier­ar­chie wird anschließend zur Nav­i­ga­tion einge­set­zt.},
  author = {Mar­tin, Michael and Riechert, Thomas},
  book­ti­tle = {Cat­a­lo­gus Pro­fes­so­rum Lip­sien­sis — Konzep­tion, tech­nis­che Umset­zung und Anwen­dun­gen f{ü}r Pro­fes­sorenkat­a­loge im Seman­tic Web},
  chap­ter = {Werkzeuge zur Real­isierung der Daten­bank},
  edi­tor = {Mor­gen­stern, Ulf and Riechert, Thomas},
  key­words = {sys:relevantFor:infai},
  pages = {107–116},
  pub­lish­er = {Leipziger Infor­matik-Ver­bund (LIV)},
  series = {Leipziger Beitr{ä}ge zur Infor­matik},
  title = {Orts­be­zo­gene Nav­i­ga­tion basierend auf einem Vok­ab­u­lar zur Erzeu­gung geo­graphis­ch­er Hier­ar­chien},
  vol­ume = 21,
  year = 2010
  }
  

  %0 Book Sec­tion
  %1 martin-m-2010–clp
  %A Mar­tin, Michael
  %A Riechert, Thomas
  %B Cat­a­lo­gus Pro­fes­so­rum Lip­sien­sis — Konzep­tion, tech­nis­che Umset­zung und Anwen­dun­gen f{ü}r Pro­fes­sorenkat­a­loge im Seman­tic Web
  %D 2010
  %E Mor­gen­stern, Ulf
  %E Riechert, Thomas
  %I Leipziger Infor­matik-Ver­bund (LIV)
  %P 107–116
  %T Orts­be­zo­gene Nav­i­ga­tion basierend auf einem Vok­ab­u­lar zur Erzeu­gung geo­graphis­ch­er Hier­ar­chien
  %V 21
  %X Der geschichtswis­senschaftliche Pro­fes­sorenkat­a­log der Universit{ä}t Leipzig enth{ä}lt u.a. Infor­ma­tio­nen zu Lebensl{ä}ufen von Pro­fes­soren, die an der Universit{ä}t Leipzig seit dem Jahr 1409 lehrten. Diese his­torischen Infor­ma­tio­nen wer­den in einem kol­lab­o­ra­tiv­en Prozess unter Ver­wen­dung des seman­tis­chen Dat­en-Wikis OntoWi­ki aquiri­ert und pub­liziert. Mit dem Pro­fes­sorenkat­a­log liegt eine Wis­sens­ba­sis vor, die auch geografis­che Infor­ma­tio­nen zu Geburts‑, Graduierungs- und Ster­be­orten von Pro­fes­soren enth{ä}lt. Der Buch­beitrag stellt einen Evo­lu­tion­sprozess und die Ver­wen­dung eines geeigneten Vok­ab­u­lars vor, um die impliz­it enthal­tene Geo-Hier­ar­chie aufzuar­beit­en. Die daraus resul­tierende Geo-Hier­ar­chie wird anschließend zur Nav­i­ga­tion einge­set­zt.
  %& Werkzeuge zur Real­isierung der Datenbank
  

• {I}mproving the {P}erformance of {S}emantic {W}eb {A}pplications with {SPARQL} {Q}uery {C}achingIn: Lora Aroyo, Grig­oris Anto­niou, Eero Hyv{ö}nen, Annette ten Tei­je, Hein­er Stuck­en­schmidt, Lil­iana Cabral and Tania Tudo­rache (eds.): Pro­ceed­ings of 7th Extend­ed Seman­tic Web Con­fer­ence (ESWC 2010), 30 May — 3 June 2010, Her­ak­lion, Crete, Greece, Lec­ture Notes in Com­put­er Sci­ence. vol. 6089. Berlin / Hei­del­berg : Springer, pp. 304–318Michael Mar­tin, J{ö}rg Unbe­hauen and S{ö}ren Auer

  AbstractURLBib­TeXEnd­NoteBib­Son­o­my

  The per­for­mance of triple stores is one of the major obsta­cles for the deploy­ment of seman­tic tech­nolo­gies in many usage sce­nar­ios. In par­tic­u­lar, Seman­tic Web appli­ca­tions, which use triple stores as per­sis­tence back­ends, trade per­for­mance for the advan­tage of flex­i­bil­i­ty with regard to infor­ma­tion struc­tur­ing. In order to get clos­er to the per­for­mance of rela­tion­al data­base-backed Web appli­ca­tions, we devel­oped an approach for improv­ing the per­for­mance of triple stores by caching query results and even com­plete appli­ca­tion objects. The selec­tive inval­i­da­tion of cache objects, fol­low­ing updates of the under­ly­ing knowl­edge bases, is based on analysing the graph pat­terns of cached SPARQL queries in order to obtain infor­ma­tion about what kind of updates will change the query result. We eval­u­at­ed our approach by extend­ing the BSBM triple store bench­mark with an update dimen­sion as well as in typ­i­cal Seman­tic Web appli­ca­tion scenarios.

  @inproceedings{martin-s-2010–a,
  abstract = {The per­for­mance of triple stores is one of the major obsta­cles for the deploy­ment of seman­tic tech­nolo­gies in many usage sce­nar­ios. In par­tic­u­lar, Seman­tic Web appli­ca­tions, which use triple stores as per­sis­tence back­ends, trade per­for­mance for the advan­tage of flex­i­bil­i­ty with regard to infor­ma­tion struc­tur­ing. In order to get clos­er to the per­for­mance of rela­tion­al data­base-backed Web appli­ca­tions, we devel­oped an approach for improv­ing the per­for­mance of triple stores by caching query results and even com­plete appli­ca­tion objects. The selec­tive inval­i­da­tion of cache objects, fol­low­ing updates of the under­ly­ing knowl­edge bases, is based on analysing the graph pat­terns of cached SPARQL queries in order to obtain infor­ma­tion about what kind of updates will change the query result. We eval­u­at­ed our approach by extend­ing the BSBM triple store bench­mark with an update dimen­sion as well as in typ­i­cal Seman­tic Web appli­ca­tion sce­nar­ios.},
  address = {Berlin / Hei­del­berg},
  author = {Mar­tin, Michael and Unbe­hauen, J{ö}rg and Auer, S{ö}ren},
  book­ti­tle = {Pro­ceed­ings of 7th Extend­ed Seman­tic Web Con­fer­ence (ESWC 2010), 30 May — 3 June 2010, Her­ak­lion, Crete, Greece},
  edi­tor = {Aroyo, Lora and Anto­niou, Grig­oris and Hyv{ö}nen, Eero and ten Tei­je, Annette and Stuck­en­schmidt, Hein­er and Cabral, Lil­iana and Tudo­rache, Tania},
  key­words = {ontowi­ki},
  pages = {304–318},
  pub­lish­er = {Springer},
  series = {Lec­ture Notes in Com­put­er Sci­ence},
  title = {{I}mproving the {P}erformance of {S}emantic {W}eb {A}pplications with {SPARQL} {Q}uery {C}aching},
  vol­ume = 6089,
  year = 2010
  }
  

  %0 Con­fer­ence Paper
  %1 martin-s-2010–a
  %A Mar­tin, Michael
  %A Unbe­hauen, J{ö}rg
  %A Auer, S{ö}ren
  %B Pro­ceed­ings of 7th Extend­ed Seman­tic Web Con­fer­ence (ESWC 2010), 30 May — 3 June 2010, Her­ak­lion, Crete, Greece
  %C Berlin / Hei­del­berg
  %D 2010
  %E Aroyo, Lora
  %E Anto­niou, Grig­oris
  %E Hyv{ö}nen, Eero
  %E ten Tei­je, Annette
  %E Stuck­en­schmidt, Hein­er
  %E Cabral, Lil­iana
  %E Tudo­rache, Tania
  %I Springer
  %P 304–318
  %R doi:10.1007/978–3‑642–13489-0_21
  %T {I}mproving the {P}erformance of {S}emantic {W}eb {A}pplications with {SPARQL} {Q}uery {C}aching
  %U http://www.springerlink.com/content/764m684325739v67/
  %V 6089
  %X The per­for­mance of triple stores is one of the major obsta­cles for the deploy­ment of seman­tic tech­nolo­gies in many usage sce­nar­ios. In par­tic­u­lar, Seman­tic Web appli­ca­tions, which use triple stores as per­sis­tence back­ends, trade per­for­mance for the advan­tage of flex­i­bil­i­ty with regard to infor­ma­tion struc­tur­ing. In order to get clos­er to the per­for­mance of rela­tion­al data­base-backed Web appli­ca­tions, we devel­oped an approach for improv­ing the per­for­mance of triple stores by caching query results and even com­plete appli­ca­tion objects. The selec­tive inval­i­da­tion of cache objects, fol­low­ing updates of the under­ly­ing knowl­edge bases, is based on analysing the graph pat­terns of cached SPARQL queries in order to obtain infor­ma­tion about what kind of updates will change the query result. We eval­u­at­ed our approach by extend­ing the BSBM triple store bench­mark with an update dimen­sion as well as in typ­i­cal Seman­tic Web appli­ca­tion scenarios.
  

2008

• Per­for­manzsteigerung datenbankgest{ü}tzter {RDF}-Triple-StoresIn: Robert Tolks­dorf and Johann-Christoph Frey­tag (eds.): Tagungs­band XIn­no­va­tions 2008 in Berlin, pp. 126–131Michael Mar­tin

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{martin-2008-phd,
  author = {Mar­tin, Michael},
  book­ti­tle = {Tagungs­band XIn­no­va­tions 2008 in Berlin},
  edi­tor = {Tolks­dorf, Robert and Frey­tag, Johann-Christoph},
  key­words = {sys:relevantFor:infai},
  pages = {126–131},
  title = {Per­for­manzsteigerung datenbankgest{ü}tzter {RDF}-Triple-Stores},
  year = 2008
  }
  

  %0 Con­fer­ence Paper
  %1 mar­tin-2008-phd
  %A Mar­tin, Michael
  %B Tagungs­band XIn­no­va­tions 2008 in Berlin
  %D 2008
  %E Tolks­dorf, Robert
  %E Frey­tag, Johann-Christoph
  %P 126–131
  %T Per­for­manzsteigerung datenbankgest{ü}tzter {RDF}-Triple-Stores
  %U http://2008.xinnovations.de/tl_files/doc/download/Montag,%2022.09.08/workshop%20phd/04_martin.pdf
  

2007

• Explor­ing the Nether­lands on a Seman­tic PathIn: S{ö}ren Auer, Chris­t­ian Biz­er, Clau­dia M{ü}ller and Anna Zhdano­va (eds.): Pro­ceed­ings of the 1st Con­fer­ence on Social Seman­tic Web, {GI-Edi­tion} — Lec­ture Notes in Infor­mat­ics {(LNI),} {ISSN} 1617–5468. vol. P‑113. Leipzig, Ger­many : Bon­ner K{ö}llen Ver­lag — ISBN 978–3‑88579–207‑9, p. 179-Michael Mar­tin

  URLBib­TeXEnd­NoteBib­Son­o­my

  @inproceedings{martin-07-cssw,
  address = {Leipzig, Ger­many},
  author = {Mar­tin, Michael},
  book­ti­tle = {Pro­ceed­ings of the 1st Con­fer­ence on Social Seman­tic Web},
  edi­tor = {Auer, S{ö}ren and Biz­er, Chris­t­ian and M{ü}ller, Clau­dia and Zhdano­va, Anna},
  key­words = {sys:relevantFor:infai},
  pages = {179-},
  pub­lish­er = {Bon­ner K{ö}llen Ver­lag},
  series = {{GI-Edi­tion} — Lec­ture Notes in Infor­mat­ics {(LNI),} {ISSN} 1617–5468},
  title = {Explor­ing the Nether­lands on a Seman­tic Path},
  vol­ume = {P‑113},
  year = 2007
  }
  

  %0 Con­fer­ence Paper
  %1 mar­tin-07-cssw
  %A Mar­tin, Michael
  %B Pro­ceed­ings of the 1st Con­fer­ence on Social Seman­tic Web
  %C Leipzig, Ger­many
  %D 2007
  %E Auer, S{ö}ren
  %E Biz­er, Chris­t­ian
  %E M{ü}ller, Clau­dia
  %E Zhdano­va, Anna
  %I Bon­ner K{ö}llen Ver­lag
  %P 179-
  %T Explor­ing the Nether­lands on a Seman­tic Path
  %U http://www.ceur-ws.org/Vol-301/Poster_5_Martin.pdf
  %V P‑113
  %@ 978–3‑88579–207‑9
  

2005

• Uma abor­dagem sobre a import{â}ncia de con­ceitos de usabil­i­dade para o desen­volve­dor de aplicaç{{\~o}}es para Televis{{\~a}}o inter­a­ti­vaIn: S{{\~a}}o Jos{é} dos Cam­pos– SPAndr{é} Valdes­til­has, Rafael de Alen­car Segu­ra and Felipe Afon­so de Almeida

  URLBib­TeXEnd­NoteBib­Son­o­my

  @article{valdestilhas2005abordagem,
  author = {Valdes­til­has, Andr{é} and Segu­ra, Rafael de Alen­car and Almei­da, Felipe Afon­so de},
  jour­nal = {S{{\~a}}o Jos{é} dos Cam­pos– SP},
  key­words = {sys:relevantFor:infai},
  title = {Uma abor­dagem sobre a import{â}ncia de con­ceitos de usabil­i­dade para o desen­volve­dor de aplicaç{{\~o}}es para Televis{{\~a}}o inter­a­ti­va},
  year = 2005
  }
  

  %0 Jour­nal Arti­cle
  %1 valdestilhas2005abordagem
  %A Valdes­til­has, Andr{é}
  %A Segu­ra, Rafael de Alen­car
  %A Almei­da, Felipe Afon­so de
  %D 2005
  %J S{{\~a}}o Jos{é} dos Cam­pos– SP
  %T Uma abor­dagem sobre a import{â}ncia de con­ceitos de usabil­i­dade para o desen­volve­dor de aplicaç{{\~o}}es para Televis{{\~a}}o inter­a­ti­va
  %U http://www.comp.ita.br/lincom/andre/artigos/usabilidadeTVDI_PUC_2005.pdf
  

• A usabil­i­dade no desen­volvi­men­to de aplicaç{{\~o}}es para TV Inter­a­ti­vaIn: 2005 SIBGRAPI XVIII Brazil­ian Sym­po­sium on Com­put­er Graph­ics and Image Pro­cess­ingAndr{é} Valdes­til­has and Felipe Afon­so de Almeida

  URLBib­TeXEnd­NoteBib­Son­o­my

  @article{valdestilhas2005usabilidade,
  author = {Valdes­til­has, Andr{é} and Almei­da, Felipe Afon­so de},
  jour­nal = {2005 SIBGRAPI XVIII Brazil­ian Sym­po­sium on Com­put­er Graph­ics and Image Pro­cess­ing},
  key­words = {sys:relevantFor:infai},
  title = {A usabil­i­dade no desen­volvi­men­to de aplicaç{{\~o}}es para TV Inter­a­ti­va},
  year = 2005
  }
  

  %0 Jour­nal Arti­cle
  %1 valdestilhas2005usabilidade
  %A Valdes­til­has, Andr{é}
  %A Almei­da, Felipe Afon­so de
  %D 2005
  %J 2005 SIBGRAPI XVIII Brazil­ian Sym­po­sium on Com­put­er Graph­ics and Image Pro­cess­ing
  %T A usabil­i­dade no desen­volvi­men­to de aplicaç{{\~o}}es para TV Inter­a­ti­va
  %U http://www.comp.ita.br/lincom/andre/artigos/SIBIGRAPI_final3.pdf