Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

2

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

2 results for “LUBM”

Learn how ShareScore rates datasets ↗
zenodo48/100

Lehigh University Benchmark (LUBM): Evolving Graph Simulation

<p>The Lehigh University Benchmark (LUBM) generates benchmark datasets containing people working at universities [1]. We use the Data Generator v1.7 to generate 10 versions of a graph containing 100 universities [2].<br> Thus, all versions are of similar size, but we emulate modifications by generating different vertex identifiers, i.e., each version is considered a timestamped graph. Each graph contains about 2.1 M vertices and 13 M edges.<br> Over all versions, the mean degree is 6.7 (+- 0.1), the mean in-degree is 6.8 (+- 0.1), and the mean out-degree is 5.1 (+- 0.1).</p> <p>1. <a href="https://dblp.uni-trier.de/pid/80/5390.html">Yuanbo Guo</a>, <a href="https://dblp.uni-trier.de/pid/48/6834.html">Zhengxiang Pan</a>, <a href="https://dblp.uni-trier.de/pid/94/1154.html">Jeff Heflin</a>: LUBM: A benchmark for OWL knowledge base systems. <a href="https://dblp.uni-trier.de/db/journals/ws/ws3.html#GuoPH05">J. Web Semant. 3(2-3)</a>: 158-182 (2005)</p> <p>2. <a href="https://dblp.uni-trier.de/pid/222/6353.html">Till Blume</a>, <a href="https://dblp.uni-trier.de/pid/r/DavidRicherby.html">David Richerby</a>, <a href="https://dblp.uni-trier.de/pid/06/2380.html">Ansgar Scherp</a>: Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs. <a href="https://dblp.uni-trier.de/db/conf/cikm/cikm2020.html#BlumeRS20">CIKM 2020</a>: 75-84</p>

opencc-by-4.0Oct 2020View details →
zenodo40/100

Automatically Extracted SHACL Shapes for WikiData, DBpedia, YAGO-4, and LUBM & Associated Coverage Statistics

<p>The uploaded datasets contain <strong>automatically extracted&nbsp;</strong>SHACL shapes for the following datasets:</p> <ul> <li>WikiData (the truthy dump from&nbsp;September 2021&nbsp;filtered by removing non-English strings)&nbsp;[1]</li> <li>DBpedia [2]</li> <li>YAGO-4 [3]&nbsp;</li> <li>LUBM&nbsp;(scale factor 500)&nbsp;[4]</li> </ul> <p>The validating shapes for these datasets are generated by a program that parses the corresponding RDF files (in `.nt` format).&nbsp;The extracted shapes encode various SHACL constraints, e.g., sh:minCount, sh:path, sh:class, sh:datatype etc.&nbsp;For each shape we encode coverage in terms of number of entities satisfying such shape, this information is encoded using the <a href="http://vocab.deri.ie/void#entities">void:entities</a>&nbsp;predicate.&nbsp;</p> <p>We have provided as executable Jar file the program we developed to extract these SHACL shapes.<br> More details about the datasets used to extract these shapes and <em>how to run the Jar</em> are available on our GitHub repository <a href="https://github.com/dkw-aau/qse">https://github.com/dkw-aau/qse</a>.</p> <p>Read more about our Quality Shapes Extraction (QSE) tool on our website&nbsp;<a href="https://relweb.cs.aau.dk/qse/">https://relweb.cs.aau.dk/qse/</a></p> <p>[1]&nbsp;Vrandečić, Denny, and Markus Kr&ouml;tzsch. &quot;Wikidata: a free collaborative knowledgebase.&quot; Communications of the ACM 57.10 (2014): 78-85.</p> <p>[2] Auer, S&ouml;ren, et al. &quot;Dbpedia: A nucleus for a web of open data.&quot; The semantic web. Springer, Berlin, Heidelberg, 2007. 722-735.</p> <p>[3] Pellissier Tanon, Thomas, Gerhard Weikum, and Fabian Suchanek. &quot;Yago 4: A reason-able knowledge base.&quot; European Semantic Web Conference. Springer, Cham, 2020.</p> <p>[4] Guo, Yuanbo, Zhengxiang Pan, and Jeff Heflin. &quot;LUBM: A benchmark for OWL knowledge base systems.&quot; Journal of Web Semantics 3.2-3 (2005): 158-182.</p>

opencc-by-4.0Feb 2022View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record