Browse State-of-the-Art › Complex Query Answering

Complex Query Answering

22 papers with code · 6 benchmarks · 5 datasets archive 2025-07-28

GraphsKnowledge Base

This task is concerned with answering complex queries over incomplete knowledge graphs. In the most simple case, the task is reduced to link prediction: a 1-hop query for predicting the existence of an edge between a pair of nodes. Complex queries are concerned with other structures between nodes, such as 2-hop and 3-paths, and intersecting paths with intermediate variables.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

6 leaderboard tables shown for this task, 6 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
FB15k (9 rows) QTO Answering Complex Logical Queries on Knowledge Graphs via Query... code Syntology ran 1 of 7 samples · 6 unverified Compare
FB15k-237 (9 rows) QTO Answering Complex Logical Queries on Knowledge Graphs via Query... code Syntology ran 1 of 7 samples · 6 unverified Compare
NELL-995 (6 rows) QTO Answering Complex Logical Queries on Knowledge Graphs via Query... code Syntology ran 1 of 7 samples · 6 unverified Compare
NELL995 (2 rows) CQD-Beam Complex Query Answering with Neural Link Predictors code Syntology ran 5 of 7 samples · 2 unverified Compare
WD50K-NFOL (1 row) NQE NQE: N-ary Query Embedding for Complex Query Answering over... code — Compare
WD50K-QE (1 row) NQE NQE: N-ary Query Embedding for Complex Query Answering over... code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

5 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Parent tasks archive 2025-07-28

Most implemented papers archive 2025-07-28

22 shown of 22 papers with code (33 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Syntology lines on 12 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections