Skip to content

Query Templates of the Benchmark

Jump to bottom
sijin edited this page Feb 18, 2022 · 27 revisions

Table of Contents

Overview of Choke Point Coverage by the Query Templates

1.1 2.1 2.2 2.3 2.4 2.5 3.1 3.2 3.3 4.1 4.2 4.3 4.4 4.5 5.1 5.2
QT1 X X X
QT2 X
QT3 X X
QT4 X X X X
QT5 X X X X
QT6 X X X
QT7 X X X X
QT8 X X X
QT9 X X X X X
QT10 X X
QT11 X X X X
QT12 X X X
QT13 X X X X X
QT14 X X X X X X X
QT15 X
QT16 X X

QT1

Template file: ./artifacts/queryTemplates/main/QT1.txt

Description:
Queries of this template retrieve several attributes of the graduate student that get bachelor’s degree from the university that grant the doctor degree to the given faculty.

By requesting several attributes of the leaf nodes of the result (i.e., the graduateStudent) this query template covers chokepoint CP 1.1. Additionally, to a lesser degree, the template also covers CP 2.2 (because of the traversal from university to its graduate students) and CP 2.1 (because of the traversal from a faculty to the university that he/she gets doctoral degree from)

Choke points covered by this template:

Placeholder: $facultyID
Placeholder type: ID
Placeholder meaning:: $facultyID is the nr attribute of some faculties
Possible values of the placeholder: All the possible faculty IDs can be used for this query template.
Number of possible instances: For a scale factor of N, we can generate (450 ~1050) * N instances of this query template, because per university, there are 15 ~ 25 departments generated, and for each department, there are 30 ~ 42 faculties.
Number of leaf nodes:
Every faculty gets doctoral degree from a single university, and each university grants bachelor’s degree to (0 ~ 7) * N graduate students. Hence, the result tree of each query of this template has *(0 ~ 7) * N * leaf node that are all different from one another.

QT2.

Template file: ./artifacts/queryTemplates/main/QT2.txt

Description:
Queries of this template retrieve all the publications about all faculties that get doctoral degree from a given university.

Due to the traversal along a sequence of 1: N relationships, this template covers chokepoint CP 2.1.

Choke points covered by this template:

Placeholder: $universityID
Placeholder type: ID
Placeholder meaning: $universityID is the nr attribute of some universities
Possible values for the placeholder: All the possible university IDs can be used for this query template.
Number of possible instances: We can generate about 1000 instances of this query template
Number of leaf nodes: These queries traverse along a sequence of two 1:N relationships. The first one (from the given university to the faculty that get doctoral degree from the university) has an out-degree range of (0 ~ 4) * N, and the second one (from the faculty to their publications) has an out-degree range of 0~20. Consequently, the result tree of such a query has about (0 ~ 80) * N leaf nodes.

QT3

Template file: ./artifacts/queryTemplates/main/QT3.txt

Description:
Given a research group that belongs to a department, queries of this template retrieve the University that granted the doctoral degree to the head of this department.

Due to the traversal along a sequence of N: 1: 1: 1, queries of this template cover chokepoint CP 2.2. By requesting several attributes of some internal nodes of the result tree (namely, the head type nodes) these queries cover chokepoints CP 2.3.

Choke points covered by this template:

Placeholder: $researchGroupID
Placeholder type: ID
Placeholder meaning: $researchGroupID is the nr attribute of some researchGroups
Possible values for the placeholder: All the possible researchGroup IDs can be used for this query template.
Number of possible instances: For a scale factor of N, we can generate (150 ~ 500) * N instances of this query template, because per university, there are 15 ~ 25 departments generated, and for each Department, there are 1~20 research groups.
Number of leaf nodes:
These queries traverse along a sequence of N: 1: 1: 1, because every research group is a suborganization of one department, and every department has one full professor as head, which, in turn, got doctor degree from one university. Hence, given a research group, the result tree of such a query has only a single leaf node.

QT4

Template file: ./artifacts/queryTemplates/main/QT4.txt

Description: Queries of this template retrieve the details of the graduate student that get bachelor’s degree from the same university as the one that grant the doctor degree to the given lecture, including the apartment of the students’ supervisor.

By requesting several attributes of the intermediate object (i.e., the graduate students), this query template covers chokepoint CP 2.3. Additionally, the template also covers CP 2.2 (because of the traversal from faculty to university and from graduate student to supervisor then to apartment) and CP 2.5 (because different graduate students may be supervised by the same professor and different professors may work for the same department).

Choke points covered by this template:

Placeholder: $lecturerID
Placeholder type: ID
Placeholder meaning: $lecturerID is the nr attribute of some lecturers
Possible values of the placeholder: All the possible lecturer IDs can be used for this query template.
Number of possible instances: For a scale factor of N, we can generate (75~175)* N instances of this query template, because per university, there are 15~20 departments generated, and for each Department, there are 5~7 lecturers.
Number of leaf nodes:
Each lecturer gets doctoral degree from a single university, from university to graduate students we have a 1: N relationship where the out-degree is 0~7 (i.e., there are 0~7 graduate students get their bachelor’s degree from the given university). Furthermore, every graduate student has a professor as supervisor, and each professor works for a single department. However, different graduate students may have the same advisor and different professors may work for the same department. Hence, the result tree of each query of this template has about (0~7)*N leaf nodes where some of them may be duplicates of one another.

QT5

Template file: ./artifacts/queryTemplates/main/QT5.txt

Description:
Queries of this template go from a given department to its university, then retrieve all graduate students who get the bachelor's degree from the university, then come back to department. Each query repeats this cycle two times and requests the students’ email addresses along the way.

This query template is a typical example of queries the traverse relationships in cycles, coming back to the same nodes multiple times. Hence, this query templates covers chokepoint CP 2.4. Additionally, by requesting attributes of the intermediate object (i.e., the graduate students), this query template covers chokepoint CP 2.3. Furthermore, the template also covers CP 2.1 (because of the traversal from a university to graduate students) and CP2.2 (because of the traversal from department to university, from graduate student to the department).

Choke points covered by this template:

Placeholder: $departmentID
Placeholder type: ID
Placeholder meaning: $departmentID is the nr attribute of some departments
Possible values for the placeholder: All the possible department IDs can be used for this query template.
Number of possible instances: For a scale factor of N, we can generate (15~25)* N instances of this query template, because per university, there are 15~20 departments generated.
Number of leaf nodes:
These queries traverse along two N: 1 relationship and one 1: N relationship. Every department is suborganization of a single university, each university grant bachelor’s degree to (0~7)*N graduate students. Furthermore, each graduate student belongs to a department. Hence, each query of this template may repeatedly visit the same department. Thus, the query result trees consist of (0~49) *N^2 leaf nodes that may contains the same department, and the trees contain many duplicate internal nodes (not only within each level of depth but also across levels).

QT6

Template file: ./artifacts/queryTemplates/main/QT6.txt

Description:
Queries of this template retrieve all graduate students that graduates from a given university, and then retrieve the professors that supervise these students and the department’s head of these professors.

This template presents a typical example of queries that do not traverse in cycles and yet visit nodes multiple times. Hence, the chokepoint covered primarily by this template is CP 2.5. Additionally, the template covers CP 2.2 because of the sequence of N:1 relationships that the queries traverse (I.e., from a graduate student to the supervisor, from the supervisor to the department).

Choke points covered by this template:

Placeholder: $universityID
Placeholder type: ID
Placeholder meaning: $universityID is the nr attribute of some uinversities
Possible values for the placeholder: All the possible university IDs can be used for this query template.
Number of possible instances: We can generate about 1000 instances of this query template
Number of leaf nodes:
From university to graduate students we have a 1: N relationship where the out-degree is 0~7 (i.e., there are 0~7 graduate students get their bachelor’s degree from the given university). Furthermore, every graduate student has a professor as supervisor, and each professor works for a single department. However, different graduate students may have the same advisor and different professors may work for the same department. Hence, the result tree of each query of this template has about (0~7)*N leaf nodes where some of them may be duplicates of one another.

QT7

Template file: ./artifacts/queryTemplates/main/QT7.txt

Description:
Queries of this template retrieve data about 10 graduate students where these students must be the first 10 at a given offset within the list of all graduate students that graduate from the given university.

The chokepoint covered primarily by this template is CP 3.2. Additionally, the template covers chokepoints CP 2.2 (because the traversal from graduate student to advisor) and, to a lesser degree, CP 2.5 (because different graduate students may have the same advisor; however, chances are small that some of the selected 10 students are the same advisor).

Choke points covered by this template:

Placeholders: $universityID, $offset
Placeholder types: ID, Int
Placeholder meaning: $universityID is the nr attribute of some universities, and $offset specifies the offset
Possible values for the placeholders: All the possible university IDs can be used for this query template, the value of $offset is selected by random from the interval [1, 50].
Number of possible instances: We can generate about 1000 * 50 instances of this query template
Number of leaf nodes:
From a university to its graduate students, we have a 1: N relationship with the out-degree of (0~7)*N. In addition, every graduate student had a professor as advisor, but different students may have the same advisor. Hence, the result tree of each query of this template has about 10 leaf nodes that may be duplicates of one another.

QT8

Template file: ./artifacts/queryTemplates/main/QT8.txt

Description:
Queries of this template retrieve data about a given number of graduate students that are the first in the list of all graduate students sorted by a given ordering criterion.

The main purpose of this query template is to cover chokepoints CP 3.1 and CP 3.3.

Choke points covered by this template:

Placeholders: $cnt, $attrGStudent1, $attrGStudent2
Placeholder types: Int, graduateStudentField, graduateStudentField
Placeholder meaning: $cnt is the number of graduate students to be retrieved, $attrGStudent1 specifies the main sort order, and $attrGStudent2 specifies the secondary sort order
Possible values for the placeholders: The value of $cnt is selected by random from the interval [500, 1000]; the value of $attrGStudent1 is selected by random from all fileds of graduateStudentField ("id", "telephone", "emailAddress", "memberOf", "undergraduateDegreeFrom", "advisor"), and the same holds for $attrGStudent2.
Number of possible instances: The number of instances for this query template is $500 * 6 * 5$
Number of leaf nodes:
The result tree of each query of this template has 500 to 100 different leaf nodes.

QT9

Template file: ./artifacts/queryTemplates/main/QT9.txt

Description:
Queries of this template retrieve data about the publications for the advisor in the first 50 graduate students by a given university. For each such advisor, the publication has to be sorted on a given field. Hence, in contrast to the previous query template, which is about sorting a whole set of things (graduate students in this specific case), this query template requires sorting in separate subsets (namely, sets of publications).

This query template covers chokepoint CP 3.1 (because of adding paging without offset on graduate students) and chokepoint CP 3.3 (because of adding ordering on the leaf nodes of the result (i.e., the publications)). In addition, this query covers CP 2.1(because of traversal from a university to its graduate students, and from advisor to their publication) and CP2.2 (because of traversal from the graduate students to their advisor).

Choke points covered by this template:

Placeholders: $universityID, $attrPublicationField
Placeholder types: ID, PublicationField
Placeholder meaning: $universityID is the nr attribute of some universities; $attrPublicationField specifies the field that publications are sorted by
Possible values for the placeholders: All the possible university IDs can be used for this query template; The value of PublicationField can be "title" or "abstract"
Number of possible instances: We can generate about (1000 * 2) instances of this query template
Number of leaf nodes:
Queries of this template traverse along a sequence of a 1: N relationship (from a university to its graduate students), an N:1 relationship (the graduate students to their advisor). and another 1: N relationship (from advisor to their publications). That is, from a university to its graduate students we have a 1: N relationship, which has an out-degree of (0 ~ 7) *N. In addition, every graduate student has a professor as advisor, there would be (0 ~ 7) * N advisors (with same professor multiple times), and every professor has 5~20 publications. Hence, the result tree of each query of this template has about (0 ~ 20 * 50) leaf nodes that some publications may repeat multiple times.

QT10

Template file: ./artifacts/queryTemplates/main/QT10.txt

Description:
Queries of this template retrieve all publications that the title contains the given keyword.

Primarily, this query template covers chokepoint CP 4.1. Additionally, by requesting several attributes of the leaf nodes of the resulting reviews, this query template also covers chokepoint CP 1.1.

Choke points covered by this template:

Placeholder: $keyword
Placeholder type: String
Placeholder meaning: $keyword is a string which is contained in the title of publications
Possible values for the placeholder: any word that appears in the title of publications
Number of possible instances: We can generate about X ( X depend on the number of words that is contained in the title of publications) instances of this query template.
Number of leaf nodes:
Titles of different publications may contain common substrings. Hence, the result of each query of this template consists of number of different publications, where this number depends on the selected search string. In general, this number may range from zero (none of the publication contains the given search string) to the number of all publications in the benchmark dataset (which is (0 ~ 6300) *N ).

QT11

Template file: ./artifacts/queryTemplates/main/QT11.txt

Description:
Queries of this template search for all graduate students of that graduates from a given university by using a search condition (instead of starting the traversal from the given university as done in Q6). Then, for each graduate student, the advisor is requested.

This template is another example of queries that do not traverse in cycles and yet visit nodes multiple times. Hence, the template covers chokepoint CP 2.5. Besides this property, the primary focus of this query is chokepoint CP 4.4 (Subquery-based search).

Choke points covered by this template:

Placeholder: $universityID
Placeholder type: ID
Placeholder meaning: $universityID is the nr attribute of some universities
Possible values for the placeholder: All the possible university IDs can be used for this query template.
Number of possible instances: We can generate about 1000 instances
Number of leaf nodes:
From a university to its graduate students we have a 1: N relationship, which has an out-degree of (0~7)*N. Thereafter, every graduate student has a single advisor. Hence, the result trees of these queries have about (0~7)*N leaf nodes. However, multiple different graduate students may share the same advisor. Hence, there may be duplicates among the leaf nodes.

QT12

Template file: ./artifacts/queryTemplates/main/QT12.txt

Description:
Queries of this template retrieve faculties that get doctoral degree from a given university. These faculties are filtered based on a given department ID.

Primarily, this query template covers chokepoint CP 4.3 (because it uses a subquery to filter the retrieved graduate students). Moreover, by traversing along two 1: N relationships, this query template covers CP 2.1.

Choke points covered by this template:

Placeholders: $universityID, $departmentID
Placeholder types: ID, ID
Placeholder meaning: $universityID is the nr attribute of some universities, and $departmentID is the nr attribute of some departments
Possible values for the placeholders: All the possible university IDs can be used for this query template; All the possible departments IDs can be used for this query template.
Number of possible instances: For a scale factor of N, we can generate 1000*(15~25)*N instances of this query template, because per university, there are 15~25 departments generated.
Number of leaf nodes: These queries traverse along two 1: N relationships. The first one (from the given university to its faculty) has an out-degree of (0~5)*N, and the second one (from the faculty to the publications) has an out-degree of 0~20. Consequently, there are about (0~100)*N leaf nodes totally for a given university. By filtering the retrieved graduate students based on the subquery with the department ID, the number of faculties could be less than 42, and each faculty have 0~20 publications. Therefore, the number of leaf nodes of the result tree could be less than 840.

QT13

Template file: ./artifacts/queryTemplates/main/QT13.txt

Description:
Queries of this template retrieve data about graduate courses for graduate students that graduated from a given university. These graduate students are filtered based on a string associated with the advisor of the graduate students. By using a string matching, the filter condition in this query template is more complex than the one in the previous template.

Primarily, this query template covers chokepoints CP 4.3 (because it uses a subquery to filter the retrieved graduate students) and CP 4.1 (because the filter condition considers string matching). Additionally, for the same reasons as for the previous template, this template also covers chokepoints CP 2.1.

Choke points covered by this template:

Placeholders: $universityID, $interestWord
Placeholder types: ID, String
Placeholder meaning: $universityID is the nr attributes of some universities, and $interestWord is the word which is contained in the research interest of professors
Possible values for the placeholders: All the possible university IDs can be used for this query template; any word that appears in the research interest of proceffers can be used for $interestWord
Number of possible instances: For a scale factor of N, we can generate 1000* X (X depends on the number of words that is contained in the research interest of professors) instances of this query template.
Number of leaf nodes:
These queries traverse along two 1: N relationships. The first one (from the given university to its graduate students with bachloar's degree) has an out-degree of (0~7)*N, and the second one (from the graduate students to the graduate courses) has an out-degree of (1~3). Consequently, there are about (0~21)*N leaf nodes totally for a given university. By filtering the retrieved graduate students based on the subquery with the advisors who have a specific research interest. Each professor supervises (0~11) graduate students. Hence, the number of graduate students could be less than 7*N depending on how many professors interest the research topic. Therefore, the number of leaf nodes of the result tree could be less than 3*7*N.

QT14

Template file: ./artifacts/queryTemplates/main/QT14.txt

Description:
Queries of this template retrieve graduate students that graduated from a given university and then retrieve graduate courses that these graduate student takes. Then the queries filter these graduate students by conjunctions of multiple conditions in a subquery.

This query template covers CP 2.1 because of traversing along two 1: N relationships. Additionally, the template also covers CP 4.1, CP 4.3 and CP 4.5 (because of using a conjunction of multiple conditions as a subquery to filter the retrieved result and containing string matching in the conditions).

Choke points covered by this template:

Placeholders: $universityID; $age; $interestKeyword
Placeholder types: ID; Int; String
Placeholder meaning: $universityID is the nr attribute of some universities; $age is the age of graduate students; $interestKeyword is the string which is contained in the research interest of professors
Possible values for the placeholders: All the possible university IDs can be used for this query template; the value of $age can be selected from the interval [20, 27]; all word that is contained in the research interest of professors.
Number of possible instances: We can generate are 1000* 7 * X instances of this query template, where X depends on the number of words that is contained in the research interest of professors.
Number of leaf nodes:
These queries traverse along two 1: N relationships. The first one (from the given university to its graduate students) has an out-degree of (0~7)*N, and the second one (from the graduate student to the graduate courses) has an out-degree of 1~3. Consequently, there are about (0~21)*N leaf nodes totally for a given univeristy. Because the retrieved graduate students are filtered by a subquery with conjunctions of multiple conditions, the number of leaf nodes of the result tree is decreased very much, which may be the same from one another.

QT15

Template file: ./artifacts/queryTemplates/main/QT15.txt

Description:
Queries of this template return the number of graduate students that got bachelor’s degree from a given university.

This query template covers CP 5.2 (because of retrieve count of graudate students).

Choke points covered by this template:

Placeholder: $universityID
Placeholder type: ID
Placeholder meaning: $universityID is the nr attribute of some universities
Possible values for the placeholder: All the possible university IDs can be used for this query template.
Number of possible instances: We can generate about 1000 instances of this query template
Number of leaf nodes:
These queries traverse a 1: N relationship from a university to their graduate students, which has an out-degree of (0~7)*N. Therefore, the result tree of such a query has 1 leaf node, the value of which between 0 to 7N.

QT16

Template file: ./artifacts/queryTemplates/main/QT16.txt

Description:
Queries of this template retrieve some aggregation values of age of undergraduate students that graduated from a given department.

This query template covers CP 5.1 (because of retrieve count, sum, avg, max and min of publication numbers).

Choke points covered by this template:

Placeholder: $universityID
Placeholder type: ID
Placeholder meaning: $universityID is the nr attribute of some universities
Possible values for the placeholder: All the possible universityIDs can be used for this query template.
Number of possible instances: We can generate about 1000 instances of this query template
Number of leaf nodes:
These queries traverse a 1: N relationship from a university to its undergraduate students, which has an out-degree of (0~7)*N. Therefore, the result tree of such a query has 1 leaf node, the value of which between 18 to 24.

Clone this wiki locally