A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree Problem

The dataset for our paper 'A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree Problem'. It consists of 5 real KGs (<code>Mondial</code>, <code>OpenCyc</code>, <code>LinkedMDB</code>, <code>YAGO</code>, <code>DBpedia</code>) and 5 synthetic KGs (<code>LUBM-10U</code>, <code>LUBM-50U</code>, <code>LUBM-250U</code>, <code>LUBM-2U</code>, <code>DBP-50K</code>). Each KG is compressed in one file, which including (for example, in <code>LUBM-2U</code>): <code>lubm_2u_nodes.sql</code>: the id, the name and the weight of a node, <code>lubm_2u_edges.sql</code>: the ids of two nodes an edge connects, <code>lubm_2u_queries.sql</code>: a query consists of some keywords, <code>lubm_2u_keymap.sql</code>: a keyword maps to a set of nodes, <code>lubm_2u_nodevec.sql</code>: the vector of a node, used to compute quadratic function qw, <code>lubm_2u_hub_hop.sql</code>: the hub labeling index to compute in Section 4.1, <code>lubm_2u_hub_mix_1.sql</code>: the hub labeling index to compute in Section 4.1 where α=0.1, <code>lubm_2u_hub_mix_5.sql</code>: the hub labeling index to compute in Section 4.1 where α=0.5, <code>lubm_2u_hub_mix_9.sql</code>: the hub labeling index to compute in Section 4.1 where α=0.9. You can dump the data into MySQL database. For example, <pre><code>create database lubm_2u; use lubm_2u; source lubm_2u_nodes.sql; …</code></pre> Unfortunately, due to the limit of space, for large KGs (<code>DBpedia</code> and <code>LUBM-250U</code>), we don't directly provide the data of hub labeling, i.e., these two compressed files only contains the first 5 sql files. You should generate hub labeling by yourself where the process is detailed in README of our project.