danyarm commited on
Commit
0eb753f
·
verified ·
1 Parent(s): faa294b

Upload queries/queries_intro-to-graph.jsonl with huggingface_hub

Browse files
Files changed (1) hide show
  1. queries/queries_intro-to-graph.jsonl +175 -0
queries/queries_intro-to-graph.jsonl ADDED
@@ -0,0 +1,175 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {"id": "intro-to-graph_T1_164", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Bulk Loading?", "ground_truth": ["Bulk Loading", "PATTERN"], "concept_id": 164, "hop_depth": 0}
2
+ {"id": "intro-to-graph_T1_29", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Traversal?", "ground_truth": ["Traversal", "GRAPH"], "concept_id": 29, "hop_depth": 0}
3
+ {"id": "intro-to-graph_T1_7", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is NoSQL Databases?", "ground_truth": ["NoSQL Databases", "FOUND"], "concept_id": 7, "hop_depth": 0}
4
+ {"id": "intro-to-graph_T1_190", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Reference Data Models?", "ground_truth": ["Reference Data Models", "SUPPLY"], "concept_id": 190, "hop_depth": 0}
5
+ {"id": "intro-to-graph_T1_71", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Hop Count?", "ground_truth": ["Hop Count", "PERF"], "concept_id": 71, "hop_depth": 0}
6
+ {"id": "intro-to-graph_T1_63", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Accumulators?", "ground_truth": ["Accumulators", "QUERY"], "concept_id": 63, "hop_depth": 0}
7
+ {"id": "intro-to-graph_T1_58", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Graph Patterns?", "ground_truth": ["Graph Patterns", "QUERY"], "concept_id": 58, "hop_depth": 0}
8
+ {"id": "intro-to-graph_T1_36", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is First-Class Relationships?", "ground_truth": ["First-Class Relationships", "GRAPH"], "concept_id": 36, "hop_depth": 0}
9
+ {"id": "intro-to-graph_T1_189", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Master Data Management?", "ground_truth": ["Master Data Management", "SUPPLY"], "concept_id": 189, "hop_depth": 0}
10
+ {"id": "intro-to-graph_T1_27", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Schema-Enforced Modeling?", "ground_truth": ["Schema-Enforced Modeling", "GRAPH"], "concept_id": 27, "hop_depth": 0}
11
+ {"id": "intro-to-graph_T1_174", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Anti-Money Laundering?", "ground_truth": ["Anti-Money Laundering", "FIN"], "concept_id": 174, "hop_depth": 0}
12
+ {"id": "intro-to-graph_T1_140", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Note-Taking Systems?", "ground_truth": ["Note-Taking Systems", "KNOW"], "concept_id": 140, "hop_depth": 0}
13
+ {"id": "intro-to-graph_T1_23", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Edges?", "ground_truth": ["Edges", "GRAPH"], "concept_id": 23, "hop_depth": 0}
14
+ {"id": "intro-to-graph_T1_152", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Time Trees?", "ground_truth": ["Time Trees", "FOUND"], "concept_id": 152, "hop_depth": 0}
15
+ {"id": "intro-to-graph_T1_109", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Strongly Connected Components?", "ground_truth": ["Strongly Connected Components", "ALGO"], "concept_id": 109, "hop_depth": 0}
16
+ {"id": "intro-to-graph_T1_9", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Document Databases?", "ground_truth": ["Document Databases", "FOUND"], "concept_id": 9, "hop_depth": 0}
17
+ {"id": "intro-to-graph_T1_8", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Key-Value Stores?", "ground_truth": ["Key-Value Stores", "FOUND"], "concept_id": 8, "hop_depth": 0}
18
+ {"id": "intro-to-graph_T1_24", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Properties?", "ground_truth": ["Properties", "GRAPH"], "concept_id": 24, "hop_depth": 0}
19
+ {"id": "intro-to-graph_T1_56", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Delete Statement?", "ground_truth": ["Delete Statement", "QUERY"], "concept_id": 56, "hop_depth": 0}
20
+ {"id": "intro-to-graph_T1_60", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Shortest Path?", "ground_truth": ["Shortest Path", "QUERY"], "concept_id": 60, "hop_depth": 0}
21
+ {"id": "intro-to-graph_T1_130", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Preferred Labels?", "ground_truth": ["Preferred Labels", "GRAPH"], "concept_id": 130, "hop_depth": 0}
22
+ {"id": "intro-to-graph_T1_155", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Bitemporal Models?", "ground_truth": ["Bitemporal Models", "PATTERN"], "concept_id": 155, "hop_depth": 0}
23
+ {"id": "intro-to-graph_T1_198", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Real-Time Analytics?", "ground_truth": ["Real-Time Analytics", "ADV"], "concept_id": 198, "hop_depth": 0}
24
+ {"id": "intro-to-graph_T1_144", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Knowledge Management?", "ground_truth": ["Knowledge Management", "GRAPH"], "concept_id": 144, "hop_depth": 0}
25
+ {"id": "intro-to-graph_T1_51", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Match Clause?", "ground_truth": ["Match Clause", "QUERY"], "concept_id": 51, "hop_depth": 0}
26
+ {"id": "intro-to-graph_T1_167", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Product Catalogs?", "ground_truth": ["Product Catalogs", "SUPPLY"], "concept_id": 167, "hop_depth": 0}
27
+ {"id": "intro-to-graph_T1_192", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Graph Partitioning?", "ground_truth": ["Graph Partitioning", "ADV"], "concept_id": 192, "hop_depth": 0}
28
+ {"id": "intro-to-graph_T1_108", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Connected Components?", "ground_truth": ["Connected Components", "ALGO"], "concept_id": 108, "hop_depth": 0}
29
+ {"id": "intro-to-graph_T1_57", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Set Clause?", "ground_truth": ["Set Clause", "QUERY"], "concept_id": 57, "hop_depth": 0}
30
+ {"id": "intro-to-graph_T1_115", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Activity Streams?", "ground_truth": ["Activity Streams", "SOCIAL"], "concept_id": 115, "hop_depth": 0}
31
+ {"id": "intro-to-graph_T1_151", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Time-Based Modeling?", "ground_truth": ["Time-Based Modeling", "PATTERN"], "concept_id": 151, "hop_depth": 0}
32
+ {"id": "intro-to-graph_T1_72", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Degree of Node?", "ground_truth": ["Degree of Node", "GRAPH"], "concept_id": 72, "hop_depth": 0}
33
+ {"id": "intro-to-graph_T1_2", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is World Models?", "ground_truth": ["World Models", "FOUND"], "concept_id": 2, "hop_depth": 0}
34
+ {"id": "intro-to-graph_T1_41", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Open World Model?", "ground_truth": ["Open World Model", "FOUND"], "concept_id": 41, "hop_depth": 0}
35
+ {"id": "intro-to-graph_T1_186", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Root Cause Analysis?", "ground_truth": ["Root Cause Analysis", "SUPPLY"], "concept_id": 186, "hop_depth": 0}
36
+ {"id": "intro-to-graph_T1_88", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Join Operations?", "ground_truth": ["Join Operations", "PERF"], "concept_id": 88, "hop_depth": 0}
37
+ {"id": "intro-to-graph_T1_169", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Bill of Materials?", "ground_truth": ["Bill of Materials", "SUPPLY"], "concept_id": 169, "hop_depth": 0}
38
+ {"id": "intro-to-graph_T1_40", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Metadata Representation?", "ground_truth": ["Metadata Representation", "GRAPH"], "concept_id": 40, "hop_depth": 0}
39
+ {"id": "intro-to-graph_T1_182", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Dependency Graphs?", "ground_truth": ["Dependency Graphs", "SUPPLY"], "concept_id": 182, "hop_depth": 0}
40
+ {"id": "intro-to-graph_T1_87", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Query Cost Analysis?", "ground_truth": ["Query Cost Analysis", "PERF"], "concept_id": 87, "hop_depth": 0}
41
+ {"id": "intro-to-graph_T1_191", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Distributed Graph Databases?", "ground_truth": ["Distributed Graph Databases", "ADV"], "concept_id": 191, "hop_depth": 0}
42
+ {"id": "intro-to-graph_T1_183", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Network Topology?", "ground_truth": ["Network Topology", "SUPPLY"], "concept_id": 183, "hop_depth": 0}
43
+ {"id": "intro-to-graph_T1_98", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Centrality Measures?", "ground_truth": ["Centrality Measures", "ALGO"], "concept_id": 98, "hop_depth": 0}
44
+ {"id": "intro-to-graph_T1_25", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Labels?", "ground_truth": ["Labels", "GRAPH"], "concept_id": 25, "hop_depth": 0}
45
+ {"id": "intro-to-graph_T1_92", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Depth-First Search?", "ground_truth": ["Depth-First Search", "ALGO"], "concept_id": 92, "hop_depth": 0}
46
+ {"id": "intro-to-graph_T1_89", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Traversal Cost?", "ground_truth": ["Traversal Cost", "GRAPH"], "concept_id": 89, "hop_depth": 0}
47
+ {"id": "intro-to-graph_T1_68", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Declarative Queries?", "ground_truth": ["Declarative Queries", "QUERY"], "concept_id": 68, "hop_depth": 0}
48
+ {"id": "intro-to-graph_T1_12", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is CAP Theorem?", "ground_truth": ["CAP Theorem", "FOUND"], "concept_id": 12, "hop_depth": 0}
49
+ {"id": "intro-to-graph_T1_118", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Sentiment Analysis?", "ground_truth": ["Sentiment Analysis", "SOCIAL"], "concept_id": 118, "hop_depth": 0}
50
+ {"id": "intro-to-graph_T1_138", "domain": "intro-to-graph", "type": "T1_entity", "query": "What is Project Knowledge?", "ground_truth": ["Project Knowledge", "GRAPH"], "concept_id": 138, "hop_depth": 0}
51
+ {"id": "intro-to-graph_T2_38", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Graph Data Model?", "ground_truth": ["Labeled Property Graph"], "concept_id": 38, "hop_depth": 1}
52
+ {"id": "intro-to-graph_T2_103", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Link Prediction?", "ground_truth": ["Graph Neural Networks"], "concept_id": 103, "hop_depth": 1}
53
+ {"id": "intro-to-graph_T2_27", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Schema-Enforced Modeling?", "ground_truth": ["Schema Design", "Labeled Property Graph"], "concept_id": 27, "hop_depth": 1}
54
+ {"id": "intro-to-graph_T2_148", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Anti-Patterns?", "ground_truth": ["Graph Data Model", "Graph Schema"], "concept_id": 148, "hop_depth": 1}
55
+ {"id": "intro-to-graph_T2_82", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Synthetic Benchmarks?", "ground_truth": ["Performance Benchmarking"], "concept_id": 82, "hop_depth": 1}
56
+ {"id": "intro-to-graph_T2_167", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Product Catalogs?", "ground_truth": ["Web Storefront Models", "Nodes", "Properties"], "concept_id": 167, "hop_depth": 1}
57
+ {"id": "intro-to-graph_T2_165", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Incremental Loading?", "ground_truth": ["Data Loading", "Bulk Loading"], "concept_id": 165, "hop_depth": 1}
58
+ {"id": "intro-to-graph_T2_99", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Betweenness Centrality?", "ground_truth": ["Centrality Measures"], "concept_id": 99, "hop_depth": 1}
59
+ {"id": "intro-to-graph_T2_154", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Decision Trees?", "ground_truth": ["Trees", "Rule Systems"], "concept_id": 154, "hop_depth": 1}
60
+ {"id": "intro-to-graph_T2_56", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Delete Statement?", "ground_truth": ["Cypher Syntax"], "concept_id": 56, "hop_depth": 1}
61
+ {"id": "intro-to-graph_T2_187", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Regulatory Compliance?", "ground_truth": ["Rule Systems", "Model Validation"], "concept_id": 187, "hop_depth": 1}
62
+ {"id": "intro-to-graph_T2_24", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Properties?", "ground_truth": ["Nodes", "Edges"], "concept_id": 24, "hop_depth": 1}
63
+ {"id": "intro-to-graph_T2_18", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Data Structures?", "ground_truth": ["Hash Maps", "Trees", "Arrays"], "concept_id": 18, "hop_depth": 1}
64
+ {"id": "intro-to-graph_T2_176", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Account Networks?", "ground_truth": ["Financial Transactions", "Social Networks"], "concept_id": 176, "hop_depth": 1}
65
+ {"id": "intro-to-graph_T2_65", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Query Performance?", "ground_truth": ["Query Optimization"], "concept_id": 65, "hop_depth": 1}
66
+ {"id": "intro-to-graph_T2_81", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Performance Benchmarking?", "ground_truth": ["Query Performance"], "concept_id": 81, "hop_depth": 1}
67
+ {"id": "intro-to-graph_T2_198", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Real-Time Analytics?", "ground_truth": ["Query Performance", "Distributed Graph Databases"], "concept_id": 198, "hop_depth": 1}
68
+ {"id": "intro-to-graph_T2_66", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Query Latency?", "ground_truth": ["Query Performance"], "concept_id": 66, "hop_depth": 1}
69
+ {"id": "intro-to-graph_T2_32", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Multi-Hop Queries?", "ground_truth": ["Traversal", "Graph Query"], "concept_id": 32, "hop_depth": 1}
70
+ {"id": "intro-to-graph_T2_104", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Node Classification?", "ground_truth": ["Graph Neural Networks"], "concept_id": 104, "hop_depth": 1}
71
+ {"id": "intro-to-graph_T2_78", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Full-Text Search?", "ground_truth": ["Graph Indexes"], "concept_id": 78, "hop_depth": 1}
72
+ {"id": "intro-to-graph_T2_123", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Skill Management?", "ground_truth": ["Human Resources Modeling", "Nodes", "Properties"], "concept_id": 123, "hop_depth": 1}
73
+ {"id": "intro-to-graph_T2_169", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Bill of Materials?", "ground_truth": ["Trees", "Labeled Property Graph"], "concept_id": 169, "hop_depth": 1}
74
+ {"id": "intro-to-graph_T2_100", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Closeness Centrality?", "ground_truth": ["Centrality Measures"], "concept_id": 100, "hop_depth": 1}
75
+ {"id": "intro-to-graph_T2_48", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Statistical Query Tuning?", "ground_truth": ["Query Optimization", "Query Performance"], "concept_id": 48, "hop_depth": 1}
76
+ {"id": "intro-to-graph_T2_101", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Graph Embeddings?", "ground_truth": ["Graph Neural Networks"], "concept_id": 101, "hop_depth": 1}
77
+ {"id": "intro-to-graph_T2_97", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Community Detection?", "ground_truth": ["Connected Components"], "concept_id": 97, "hop_depth": 1}
78
+ {"id": "intro-to-graph_T2_60", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Shortest Path?", "ground_truth": ["Variable Length Paths"], "concept_id": 60, "hop_depth": 1}
79
+ {"id": "intro-to-graph_T2_75", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Edge-to-Node Ratio?", "ground_truth": ["Nodes", "Edges"], "concept_id": 75, "hop_depth": 1}
80
+ {"id": "intro-to-graph_T2_25", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Labels?", "ground_truth": ["Nodes"], "concept_id": 25, "hop_depth": 1}
81
+ {"id": "intro-to-graph_T2_162", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for JSON Import?", "ground_truth": ["ETL Pipelines"], "concept_id": 162, "hop_depth": 1}
82
+ {"id": "intro-to-graph_T2_178", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Provider-Patient Graphs?", "ground_truth": ["Healthcare Graphs", "Edges"], "concept_id": 178, "hop_depth": 1}
83
+ {"id": "intro-to-graph_T2_50", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Cypher Syntax?", "ground_truth": ["OpenCypher"], "concept_id": 50, "hop_depth": 1}
84
+ {"id": "intro-to-graph_T2_143", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Codifiable Knowledge?", "ground_truth": ["Knowledge Capture"], "concept_id": 143, "hop_depth": 1}
85
+ {"id": "intro-to-graph_T2_69", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Imperative Queries?", "ground_truth": ["GSQL"], "concept_id": 69, "hop_depth": 1}
86
+ {"id": "intro-to-graph_T2_190", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Reference Data Models?", "ground_truth": ["Graph Data Model", "Graph Schema"], "concept_id": 190, "hop_depth": 1}
87
+ {"id": "intro-to-graph_T2_125", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Backlog Management?", "ground_truth": ["Task Assignment"], "concept_id": 125, "hop_depth": 1}
88
+ {"id": "intro-to-graph_T2_181", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for IT Asset Management?", "ground_truth": ["Labeled Property Graph", "Graph Data Model"], "concept_id": 181, "hop_depth": 1}
89
+ {"id": "intro-to-graph_T2_76", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Graph Indexes?", "ground_truth": ["Graph Schema"], "concept_id": 76, "hop_depth": 1}
90
+ {"id": "intro-to-graph_T2_149", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Hyperedges?", "ground_truth": ["Edges", "Aggregation"], "concept_id": 149, "hop_depth": 1}
91
+ {"id": "intro-to-graph_T2_63", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Accumulators?", "ground_truth": ["GSQL", "Map-Reduce Pattern"], "concept_id": 63, "hop_depth": 1}
92
+ {"id": "intro-to-graph_T2_90", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Scalability?", "ground_truth": ["Performance Benchmarking", "Distributed Graph Databases"], "concept_id": 90, "hop_depth": 1}
93
+ {"id": "intro-to-graph_T2_21", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Labeled Property Graph?", "ground_truth": ["Graph Databases", "Nodes", "Edges", "Properties", "Labels"], "concept_id": 21, "hop_depth": 1}
94
+ {"id": "intro-to-graph_T2_186", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Root Cause Analysis?", "ground_truth": ["Breadth-First Search", "Impact Analysis"], "concept_id": 186, "hop_depth": 1}
95
+ {"id": "intro-to-graph_T2_11", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Graph Databases?", "ground_truth": ["NoSQL Databases", "Data Structures"], "concept_id": 11, "hop_depth": 1}
96
+ {"id": "intro-to-graph_T2_87", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Query Cost Analysis?", "ground_truth": ["Query Performance", "Query Plans"], "concept_id": 87, "hop_depth": 1}
97
+ {"id": "intro-to-graph_T2_109", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Strongly Connected Components?", "ground_truth": ["Connected Components", "Edge Direction"], "concept_id": 109, "hop_depth": 1}
98
+ {"id": "intro-to-graph_T2_172", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Financial Transactions?", "ground_truth": ["Labeled Property Graph", "Edges", "Properties"], "concept_id": 172, "hop_depth": 1}
99
+ {"id": "intro-to-graph_T2_23", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for Edges?", "ground_truth": ["Graph Databases", "Nodes"], "concept_id": 23, "hop_depth": 1}
100
+ {"id": "intro-to-graph_T2_61", "domain": "intro-to-graph", "type": "T2_dependency", "query": "What are the prerequisites for All Paths?", "ground_truth": ["Path Patterns", "Match Clause"], "concept_id": 61, "hop_depth": 1}
101
+ {"id": "intro-to-graph_T3_16_188", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Data Lineage?", "ground_truth": ["Data Lineage", "Dependency Graphs", "Labeled Property Graph", "Graph Databases", "Data Structures", "Trees"], "concept_id": 188, "hop_depth": 5, "path_ids": [188, 182, 21, 11, 18, 16]}
102
+ {"id": "intro-to-graph_T3_14_75", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Schema Design to Edge-to-Node Ratio?", "ground_truth": ["Edge-to-Node Ratio", "Nodes", "Graph Databases", "NoSQL Databases", "RDBMS", "Schema Design"], "concept_id": 75, "hop_depth": 5, "path_ids": [75, 22, 11, 7, 4, 14]}
103
+ {"id": "intro-to-graph_T3_15_171", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Hash Maps to Supply Chain Modeling?", "ground_truth": ["Supply Chain Modeling", "Labeled Property Graph", "Graph Databases", "Data Structures", "Hash Maps"], "concept_id": 171, "hop_depth": 4, "path_ids": [171, 21, 11, 18, 15]}
104
+ {"id": "intro-to-graph_T3_16_147", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Supernodes?", "ground_truth": ["Supernodes", "Nodes", "Graph Databases", "Data Structures", "Trees"], "concept_id": 147, "hop_depth": 4, "path_ids": [147, 22, 11, 18, 16]}
105
+ {"id": "intro-to-graph_T3_14_194", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Schema Design to Replication?", "ground_truth": ["Replication", "Distributed Graph Databases", "Graph Databases", "NoSQL Databases", "RDBMS", "Schema Design"], "concept_id": 194, "hop_depth": 5, "path_ids": [194, 191, 11, 7, 4, 14]}
106
+ {"id": "intro-to-graph_T3_16_120", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Fake Account Detection?", "ground_truth": ["Fake Account Detection", "Social Networks", "Labeled Property Graph", "Graph Databases", "Data Structures", "Trees"], "concept_id": 120, "hop_depth": 5, "path_ids": [120, 111, 21, 11, 18, 16]}
107
+ {"id": "intro-to-graph_T3_16_115", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Activity Streams?", "ground_truth": ["Activity Streams", "Social Networks", "Labeled Property Graph", "Graph Databases", "Data Structures", "Trees"], "concept_id": 115, "hop_depth": 5, "path_ids": [115, 111, 21, 11, 18, 16]}
108
+ {"id": "intro-to-graph_T3_14_77", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Schema Design to Vector Indexes?", "ground_truth": ["Vector Indexes", "Graph Indexes", "Graph Schema", "Schema Design"], "concept_id": 77, "hop_depth": 3, "path_ids": [77, 76, 39, 14]}
109
+ {"id": "intro-to-graph_T3_3_144", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Knowledge Representation to Knowledge Management?", "ground_truth": ["Knowledge Management", "Enterprise Knowledge", "Knowledge Representation"], "concept_id": 144, "hop_depth": 2, "path_ids": [144, 136, 3]}
110
+ {"id": "intro-to-graph_T3_2_112", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from World Models to Friend Graphs?", "ground_truth": ["Friend Graphs", "Edges", "Graph Databases", "NoSQL Databases", "Data Modeling", "World Models"], "concept_id": 112, "hop_depth": 5, "path_ids": [112, 23, 11, 7, 1, 2]}
111
+ {"id": "intro-to-graph_T3_15_146", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Hash Maps to Subgraphs?", "ground_truth": ["Subgraphs", "Labeled Property Graph", "Graph Databases", "Data Structures", "Hash Maps"], "concept_id": 146, "hop_depth": 4, "path_ids": [146, 21, 11, 18, 15]}
112
+ {"id": "intro-to-graph_T3_14_149", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Schema Design to Hyperedges?", "ground_truth": ["Hyperedges", "Edges", "Graph Databases", "NoSQL Databases", "RDBMS", "Schema Design"], "concept_id": 149, "hop_depth": 5, "path_ids": [149, 23, 11, 7, 4, 14]}
113
+ {"id": "intro-to-graph_T3_2_183", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from World Models to Network Topology?", "ground_truth": ["Network Topology", "Edges", "Graph Databases", "NoSQL Databases", "Data Modeling", "World Models"], "concept_id": 183, "hop_depth": 5, "path_ids": [183, 23, 11, 7, 1, 2]}
114
+ {"id": "intro-to-graph_T3_17_147", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Arrays to Supernodes?", "ground_truth": ["Supernodes", "Nodes", "Graph Databases", "Data Structures", "Arrays"], "concept_id": 147, "hop_depth": 4, "path_ids": [147, 22, 11, 18, 17]}
115
+ {"id": "intro-to-graph_T3_17_101", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Arrays to Graph Embeddings?", "ground_truth": ["Graph Embeddings", "Graph Neural Networks", "Labeled Property Graph", "Graph Databases", "Data Structures", "Arrays"], "concept_id": 101, "hop_depth": 5, "path_ids": [101, 102, 21, 11, 18, 17]}
116
+ {"id": "intro-to-graph_T3_2_90", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from World Models to Scalability?", "ground_truth": ["Scalability", "Distributed Graph Databases", "Graph Databases", "NoSQL Databases", "Data Modeling", "World Models"], "concept_id": 90, "hop_depth": 5, "path_ids": [90, 191, 11, 7, 1, 2]}
117
+ {"id": "intro-to-graph_T3_15_63", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Hash Maps to Accumulators?", "ground_truth": ["Accumulators", "GSQL", "Labeled Property Graph", "Graph Databases", "Data Structures", "Hash Maps"], "concept_id": 63, "hop_depth": 5, "path_ids": [63, 47, 21, 11, 18, 15]}
118
+ {"id": "intro-to-graph_T3_17_189", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Arrays to Master Data Management?", "ground_truth": ["Master Data Management", "Graph Data Model", "Labeled Property Graph", "Graph Databases", "Data Structures", "Arrays"], "concept_id": 189, "hop_depth": 5, "path_ids": [189, 38, 21, 11, 18, 17]}
119
+ {"id": "intro-to-graph_T3_3_143", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Knowledge Representation to Codifiable Knowledge?", "ground_truth": ["Codifiable Knowledge", "Knowledge Capture", "Knowledge Representation"], "concept_id": 143, "hop_depth": 2, "path_ids": [143, 141, 3]}
120
+ {"id": "intro-to-graph_T3_16_159", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Data Migration?", "ground_truth": ["Data Migration", "Data Loading", "Labeled Property Graph", "Graph Databases", "Data Structures", "Trees"], "concept_id": 159, "hop_depth": 5, "path_ids": [159, 163, 21, 11, 18, 16]}
121
+ {"id": "intro-to-graph_T3_14_79", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Schema Design to Composite Indexes?", "ground_truth": ["Composite Indexes", "Graph Indexes", "Graph Schema", "Schema Design"], "concept_id": 79, "hop_depth": 3, "path_ids": [79, 76, 39, 14]}
122
+ {"id": "intro-to-graph_T3_16_42", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Closed World Model?", "ground_truth": ["Closed World Model", "Schema-Enforced Modeling", "Labeled Property Graph", "Graph Databases", "Data Structures", "Trees"], "concept_id": 42, "hop_depth": 5, "path_ids": [42, 27, 21, 11, 18, 16]}
123
+ {"id": "intro-to-graph_T3_15_40", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Hash Maps to Metadata Representation?", "ground_truth": ["Metadata Representation", "Properties", "Nodes", "Graph Databases", "Data Structures", "Hash Maps"], "concept_id": 40, "hop_depth": 5, "path_ids": [40, 24, 22, 11, 18, 15]}
124
+ {"id": "intro-to-graph_T3_16_199", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Trees to Batch Processing?", "ground_truth": ["Batch Processing", "Real-Time Analytics", "Distributed Graph Databases", "Graph Databases", "Data Structures", "Trees"], "concept_id": 199, "hop_depth": 5, "path_ids": [199, 198, 191, 11, 18, 16]}
125
+ {"id": "intro-to-graph_T3_14_146", "domain": "intro-to-graph", "type": "T3_path", "query": "What is the prerequisite chain from Schema Design to Subgraphs?", "ground_truth": ["Subgraphs", "Labeled Property Graph", "Graph Databases", "NoSQL Databases", "RDBMS", "Schema Design"], "concept_id": 146, "hop_depth": 5, "path_ids": [146, 21, 11, 7, 4, 14]}
126
+ {"id": "intro-to-graph_T4_FOUND", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all FOUND concepts in this knowledge graph", "ground_truth": ["Data Modeling", "World Models", "Knowledge Representation", "RDBMS", "OLAP", "OLTP", "NoSQL Databases", "Key-Value Stores", "Document Databases", "Wide-Column Stores", "Graph Databases", "CAP Theorem", "Tradeoff Analysis", "Schema Design", "Hash Maps", "Trees", "Arrays", "Data Structures", "Relational Model", "Normalization", "Open World Model", "Closed World Model", "Minimum Spanning Tree", "Time Trees", "Decision Trees"], "taxonomy_id": "FOUND", "hop_depth": 0}
127
+ {"id": "intro-to-graph_T4_GRAPH", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all GRAPH concepts in this knowledge graph", "ground_truth": ["Labeled Property Graph", "Nodes", "Edges", "Properties", "Labels", "Schema-Optional Modeling", "Schema-Enforced Modeling", "Index-Free Adjacency", "Traversal", "Graph Query", "Pattern Matching", "Multi-Hop Queries", "Aggregation", "Path Patterns", "Constant-Time Neighbor Access", "First-Class Relationships", "Edge Direction", "Graph Data Model", "Graph Schema", "Metadata Representation", "Graph Validation", "Document Validation", "Rule Systems", "Degree of Node", "Edge-to-Node Ratio", "Single-Node Benchmarks", "Multi-Node Benchmarks", "Traversal Cost", "Node Classification", "Preferred Labels", "Alternate Labels", "Enterprise Knowledge", "Department Knowledge", "Project Knowledge", "Personal Knowledge Graphs", "Knowledge Capture", "Tacit Knowledge", "Codifiable Knowledge", "Knowledge Management", "Supernodes", "Hyperedges", "Multi-Edges"], "taxonomy_id": "GRAPH", "hop_depth": 0}
128
+ {"id": "intro-to-graph_T4_QUERY", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all QUERY concepts in this knowledge graph", "ground_truth": ["OpenCypher", "GSQL", "Statistical Query Tuning", "GQL", "Cypher Syntax", "Match Clause", "Where Clause", "Return Clause", "Create Statement", "Merge Statement", "Delete Statement", "Set Clause", "Graph Patterns", "Variable Length Paths", "Shortest Path", "All Paths", "Map-Reduce Pattern", "Accumulators", "Query Optimization", "Query Performance", "Query Latency", "Query Throughput", "Declarative Queries", "Imperative Queries", "Query Plans", "Shortest Path Algorithms"], "taxonomy_id": "QUERY", "hop_depth": 0}
129
+ {"id": "intro-to-graph_T4_PERF", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all PERF concepts in this knowledge graph", "ground_truth": ["Hop Count", "Indegree", "Outdegree", "Graph Indexes", "Vector Indexes", "Full-Text Search", "Composite Indexes", "Graph Metrics", "Performance Benchmarking", "Synthetic Benchmarks", "LDBC SNB Benchmark", "Graph 500", "Query Cost Analysis", "Join Operations", "Scalability"], "taxonomy_id": "PERF", "hop_depth": 0}
130
+ {"id": "intro-to-graph_T4_ALGO", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all ALGO concepts in this knowledge graph", "ground_truth": ["Breadth-First Search", "Depth-First Search", "A-Star Algorithm", "Pathfinding", "Traveling Salesman Problem", "PageRank", "Community Detection", "Centrality Measures", "Betweenness Centrality", "Closeness Centrality", "Graph Embeddings", "Graph Neural Networks", "Link Prediction", "Graph Clustering", "Connected Components", "Strongly Connected Components", "Weakly Connected Components"], "taxonomy_id": "ALGO", "hop_depth": 0}
131
+ {"id": "intro-to-graph_T4_SOCIAL", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all SOCIAL concepts in this knowledge graph", "ground_truth": ["Social Networks", "Friend Graphs", "Influence Graphs", "Follower Networks", "Activity Streams", "User Profiles", "Relationship Types", "Sentiment Analysis", "Natural Language Processing", "Fake Account Detection", "Human Resources Modeling", "Org Chart Models", "Skill Management", "Task Assignment", "Backlog Management"], "taxonomy_id": "SOCIAL", "hop_depth": 0}
132
+ {"id": "intro-to-graph_T4_KNOW", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all KNOW concepts in this knowledge graph", "ground_truth": ["Concept Dependency Graphs", "Curriculum Graphs", "Ontologies", "SKOS", "Acronym Lists", "Glossaries", "Controlled Vocabularies", "Taxonomies", "Note-Taking Systems", "Action Item Extraction"], "taxonomy_id": "KNOW", "hop_depth": 0}
133
+ {"id": "intro-to-graph_T4_PATTERN", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all PATTERN concepts in this knowledge graph", "ground_truth": ["Subgraphs", "Anti-Patterns", "Time-Based Modeling", "IoT Event Modeling", "Bitemporal Models", "Graph Quality Metrics", "Model Validation", "Schema Evolution", "Data Migration", "ETL Pipelines", "CSV Import", "JSON Import", "Data Loading", "Bulk Loading", "Incremental Loading"], "taxonomy_id": "PATTERN", "hop_depth": 0}
134
+ {"id": "intro-to-graph_T4_SUPPLY", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all SUPPLY concepts in this knowledge graph", "ground_truth": ["Web Storefront Models", "Product Catalogs", "Recommendation Engines", "Bill of Materials", "Complex Parts", "Supply Chain Modeling", "IT Asset Management", "Dependency Graphs", "Network Topology", "Configuration Management", "Impact Analysis", "Root Cause Analysis", "Regulatory Compliance", "Data Lineage", "Master Data Management", "Reference Data Models"], "taxonomy_id": "SUPPLY", "hop_depth": 0}
135
+ {"id": "intro-to-graph_T4_FIN", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all FIN concepts in this knowledge graph", "ground_truth": ["Financial Transactions", "Fraud Detection", "Anti-Money Laundering", "Know Your Customer", "Account Networks"], "taxonomy_id": "FIN", "hop_depth": 0}
136
+ {"id": "intro-to-graph_T4_HEALTH", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all HEALTH concepts in this knowledge graph", "ground_truth": ["Healthcare Graphs", "Provider-Patient Graphs", "Electronic Health Records", "Clinical Pathways"], "taxonomy_id": "HEALTH", "hop_depth": 0}
137
+ {"id": "intro-to-graph_T4_ADV", "domain": "intro-to-graph", "type": "T4_aggregate", "query": "List all ADV concepts in this knowledge graph", "ground_truth": ["Distributed Graph Databases", "Graph Partitioning", "Sharding Strategies", "Replication", "Consistency Models", "Graph Visualization", "Interactive Queries", "Real-Time Analytics", "Batch Processing", "Capstone Project Design"], "taxonomy_id": "ADV", "hop_depth": 0}
138
+ {"id": "intro-to-graph_T5_197_196", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Interactive Queries relate to Graph Visualization?", "ground_truth": ["Interactive Queries", "Graph Visualization", "Graph Query"], "concept_id_a": 197, "concept_id_b": 196, "hop_depth": 1}
139
+ {"id": "intro-to-graph_T5_147_22", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Supernodes relate to Nodes?", "ground_truth": ["Supernodes", "Nodes"], "concept_id_a": 147, "concept_id_b": 22, "hop_depth": 1}
140
+ {"id": "intro-to-graph_T5_80_72", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Graph Metrics relate to Degree of Node?", "ground_truth": ["Graph Metrics", "Degree of Node"], "concept_id_a": 80, "concept_id_b": 72, "hop_depth": 1}
141
+ {"id": "intro-to-graph_T5_179_177", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Electronic Health Records relate to Healthcare Graphs?", "ground_truth": ["Electronic Health Records", "Healthcare Graphs"], "concept_id_a": 179, "concept_id_b": 177, "hop_depth": 1}
142
+ {"id": "intro-to-graph_T5_75_22", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Edge-to-Node Ratio relate to Nodes?", "ground_truth": ["Edge-to-Node Ratio", "Nodes"], "concept_id_a": 75, "concept_id_b": 22, "hop_depth": 1}
143
+ {"id": "intro-to-graph_T5_114_37", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Follower Networks relate to Edge Direction?", "ground_truth": ["Follower Networks", "Edge Direction"], "concept_id_a": 114, "concept_id_b": 37, "hop_depth": 1}
144
+ {"id": "intro-to-graph_T5_140_139", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Note-Taking Systems relate to Personal Knowledge Graphs?", "ground_truth": ["Note-Taking Systems", "Personal Knowledge Graphs"], "concept_id_a": 140, "concept_id_b": 139, "hop_depth": 1}
145
+ {"id": "intro-to-graph_T5_132_130", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Acronym Lists relate to Preferred Labels?", "ground_truth": ["Acronym Lists", "Preferred Labels"], "concept_id_a": 132, "concept_id_b": 130, "hop_depth": 1}
146
+ {"id": "intro-to-graph_T5_151_24", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Time-Based Modeling relate to Properties?", "ground_truth": ["Time-Based Modeling", "Properties"], "concept_id_a": 151, "concept_id_b": 24, "hop_depth": 1}
147
+ {"id": "intro-to-graph_T5_173_172", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Fraud Detection relate to Financial Transactions?", "ground_truth": ["Fraud Detection", "Financial Transactions"], "concept_id_a": 173, "concept_id_b": 172, "hop_depth": 1}
148
+ {"id": "intro-to-graph_T5_154_45", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Decision Trees relate to Rule Systems?", "ground_truth": ["Decision Trees", "Rule Systems"], "concept_id_a": 154, "concept_id_b": 45, "hop_depth": 1}
149
+ {"id": "intro-to-graph_T5_47_30", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does GSQL relate to Graph Query?", "ground_truth": ["GSQL", "Graph Query", "Labeled Property Graph"], "concept_id_a": 47, "concept_id_b": 30, "hop_depth": 1}
150
+ {"id": "intro-to-graph_T5_92_29", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Depth-First Search relate to Traversal?", "ground_truth": ["Depth-First Search", "Traversal"], "concept_id_a": 92, "concept_id_b": 29, "hop_depth": 1}
151
+ {"id": "intro-to-graph_T5_85_82", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does LDBC SNB Benchmark relate to Synthetic Benchmarks?", "ground_truth": ["LDBC SNB Benchmark", "Synthetic Benchmarks"], "concept_id_a": 85, "concept_id_b": 82, "hop_depth": 1}
152
+ {"id": "intro-to-graph_T5_27_14", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Schema-Enforced Modeling relate to Schema Design?", "ground_truth": ["Schema-Enforced Modeling", "Schema Design"], "concept_id_a": 27, "concept_id_b": 14, "hop_depth": 1}
153
+ {"id": "intro-to-graph_T5_122_121", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Org Chart Models relate to Human Resources Modeling?", "ground_truth": ["Org Chart Models", "Human Resources Modeling"], "concept_id_a": 122, "concept_id_b": 121, "hop_depth": 1}
154
+ {"id": "intro-to-graph_T5_11_7", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Graph Databases relate to NoSQL Databases?", "ground_truth": ["Graph Databases", "NoSQL Databases"], "concept_id_a": 11, "concept_id_b": 7, "hop_depth": 1}
155
+ {"id": "intro-to-graph_T5_191_11", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Distributed Graph Databases relate to Graph Databases?", "ground_truth": ["Distributed Graph Databases", "Graph Databases"], "concept_id_a": 191, "concept_id_b": 11, "hop_depth": 1}
156
+ {"id": "intro-to-graph_T5_182_37", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Dependency Graphs relate to Edge Direction?", "ground_truth": ["Dependency Graphs", "Edge Direction"], "concept_id_a": 182, "concept_id_b": 37, "hop_depth": 1}
157
+ {"id": "intro-to-graph_T5_87_65", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Query Cost Analysis relate to Query Performance?", "ground_truth": ["Query Cost Analysis", "Query Performance"], "concept_id_a": 87, "concept_id_b": 65, "hop_depth": 1}
158
+ {"id": "intro-to-graph_T5_83_81", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Single-Node Benchmarks relate to Performance Benchmarking?", "ground_truth": ["Single-Node Benchmarks", "Performance Benchmarking"], "concept_id_a": 83, "concept_id_b": 81, "hop_depth": 1}
159
+ {"id": "intro-to-graph_T5_5_4", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does OLAP relate to RDBMS?", "ground_truth": ["OLAP", "RDBMS"], "concept_id_a": 5, "concept_id_b": 4, "hop_depth": 1}
160
+ {"id": "intro-to-graph_T5_29_23", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Traversal relate to Edges?", "ground_truth": ["Traversal", "Edges", "Nodes"], "concept_id_a": 29, "concept_id_b": 23, "hop_depth": 1}
161
+ {"id": "intro-to-graph_T5_26_14", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Schema-Optional Modeling relate to Schema Design?", "ground_truth": ["Schema-Optional Modeling", "Schema Design"], "concept_id_a": 26, "concept_id_b": 14, "hop_depth": 1}
162
+ {"id": "intro-to-graph_T5_28_23", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Index-Free Adjacency relate to Edges?", "ground_truth": ["Index-Free Adjacency", "Edges"], "concept_id_a": 28, "concept_id_b": 23, "hop_depth": 1}
163
+ {"id": "intro-to-graph_T5_18_17", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Data Structures relate to Arrays?", "ground_truth": ["Data Structures", "Arrays"], "concept_id_a": 18, "concept_id_b": 17, "hop_depth": 1}
164
+ {"id": "intro-to-graph_T5_120_111", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Fake Account Detection relate to Social Networks?", "ground_truth": ["Fake Account Detection", "Social Networks"], "concept_id_a": 120, "concept_id_b": 111, "hop_depth": 1}
165
+ {"id": "intro-to-graph_T5_172_24", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Financial Transactions relate to Properties?", "ground_truth": ["Financial Transactions", "Properties", "Edges"], "concept_id_a": 172, "concept_id_b": 24, "hop_depth": 1}
166
+ {"id": "intro-to-graph_T5_89_29", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Traversal Cost relate to Traversal?", "ground_truth": ["Traversal Cost", "Traversal"], "concept_id_a": 89, "concept_id_b": 29, "hop_depth": 1}
167
+ {"id": "intro-to-graph_T5_105_102", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Graph Clustering relate to Graph Neural Networks?", "ground_truth": ["Graph Clustering", "Graph Neural Networks"], "concept_id_a": 105, "concept_id_b": 102, "hop_depth": 1}
168
+ {"id": "intro-to-graph_T5_166_21", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Web Storefront Models relate to Labeled Property Graph?", "ground_truth": ["Web Storefront Models", "Labeled Property Graph"], "concept_id_a": 166, "concept_id_b": 21, "hop_depth": 1}
169
+ {"id": "intro-to-graph_T5_80_71", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Graph Metrics relate to Hop Count?", "ground_truth": ["Graph Metrics", "Hop Count"], "concept_id_a": 80, "concept_id_b": 71, "hop_depth": 1}
170
+ {"id": "intro-to-graph_T5_50_46", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Cypher Syntax relate to OpenCypher?", "ground_truth": ["Cypher Syntax", "OpenCypher"], "concept_id_a": 50, "concept_id_b": 46, "hop_depth": 1}
171
+ {"id": "intro-to-graph_T5_186_185", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Root Cause Analysis relate to Impact Analysis?", "ground_truth": ["Root Cause Analysis", "Impact Analysis"], "concept_id_a": 186, "concept_id_b": 185, "hop_depth": 1}
172
+ {"id": "intro-to-graph_T5_188_182", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Data Lineage relate to Dependency Graphs?", "ground_truth": ["Data Lineage", "Dependency Graphs", "Edge Direction"], "concept_id_a": 188, "concept_id_b": 182, "hop_depth": 1}
173
+ {"id": "intro-to-graph_T5_162_160", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does JSON Import relate to ETL Pipelines?", "ground_truth": ["JSON Import", "ETL Pipelines"], "concept_id_a": 162, "concept_id_b": 160, "hop_depth": 1}
174
+ {"id": "intro-to-graph_T5_90_191", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Scalability relate to Distributed Graph Databases?", "ground_truth": ["Scalability", "Distributed Graph Databases"], "concept_id_a": 90, "concept_id_b": 191, "hop_depth": 1}
175
+ {"id": "intro-to-graph_T5_143_141", "domain": "intro-to-graph", "type": "T5_cross_concept", "query": "How does Codifiable Knowledge relate to Knowledge Capture?", "ground_truth": ["Codifiable Knowledge", "Knowledge Capture"], "concept_id_a": 143, "concept_id_b": 141, "hop_depth": 1}