Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem
<p> It contains all the data used in our experiments, including 5 real graphs (<code>MONDIAL</code>, <code>OpenCyc</code>, <code>LinkedMDB</code>, <code>YAGO</code>, and <code>DBpedia</code>) and 3 synthetic graphs (<code>LUBM-50K</code>, <code>LUBM-500K</code>, and <code>LUBM-5M</code>).</p> <p>Each real KG directory contains 8 files, including:</p> <ul> <li><code>graph.txt</code>: The first value is the number of vertices. Then each line 'u v' means there is an undirected edge between 'u' and 'v'.</li> <li><code>Weightgraph.txt</code>: The first value is the number of vertices. Then each line 'u v w' means there is an undirected edge between 'u' and 'v' weighted by 'w' which is computed by the Informativeness-based Weighting (IW) scheme.</li> <li><code>nodeName.txt</code>: Mapping from vertex ID to vertex name (i.e., entity URI).</li> <li><code>query.txt</code>: Each line is a keyword query containing a set of keyword names.</li> <li><code>kwName.txt</code>: Mapping from keyword ID to keyword name.</li> <li><code>kwMap.txt</code>: Mapping from keyword ID to vertex IDs. The first value of each line is keyword ID, and the rest are vertex IDs.</li> <li><code>UWHBLL.txt</code>: The HBLL index file which was built based on the Unit Weighting.</li> <li><code>IWHBLL.txt</code>: The HBLL index file which was built based on the Informativeness-based Weighting.</li> </ul> <p>Each synthetic directory contains 6 files, including:</p> <ul> <li><code>graph.txt</code>: same as above.</li> <li><code>Weightgraph.txt</code>: same as above.</li> <li><code>nodeName.txt</code>: same as above.</li> <li><code>queryList.txt</code>: Each line contains a set (separated by ',') of sets of vertex IDs.</li> <li><code>UWHBLL.txt</code>: same as above.</li> <li><code>IWHBLL.txt</code>: same as above.</li> </ul> <p>Apart from that, <code>Dbpedia</code> and <code>LUBM-5M</code> also contain a <code>PLLlabel.txt</code> file which was the supplementary file for the HBLL index.</p>
ShareScore
36/100
Overall dataset sharing score
Score breakdown
These five areas show where the dataset supports — or may limit — practical reuse.
- Stewardship
- 4
- Harmonization
- 4
- Access
- 16
- Reuse readiness
- 8
- Engagement
- 4
Dataset details
- Repository
- zenodo
- Published
- June 29, 2022
- License
- cc-by-4.0
- DOI
- 10.5281/zenodo.6778094
Scored with release 0.9.0
ScienceDex for faculty
Your academic CV and NIH biosketch
Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.