Pith. sign in

REVIEW 2 cited by

Rel2Graph: Automated Mapping From Relational Databases to a Unified Property Knowledge Graph

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.01080 v2 pith:IBQQATUB submitted 2023-10-02 cs.DB

classification cs.DB
keywords databasesrelationalapproachgraphknowledgequeriesmappingproperty
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Although a few approaches are proposed to convert relational databases to graphs, there is a genuine lack of systematic evaluation across a wider spectrum of databases. Recognising the important issue of query mapping, this paper proposes an approach Rel2Graph, an automatic knowledge graph construction (KGC) approach from an arbitrary number of relational databases. Our approach also supports the mapping of conjunctive SQL queries into pattern-based NoSQL queries. We evaluate our proposed approach on two widely used relational database-oriented datasets: Spider and KaggleDBQA benchmarks for semantic parsing. We employ the execution accuracy (EA) metric to quantify the proportion of results by executing the NoSQL queries on the property knowledge graph we construct that aligns with the results of SQL queries performed on relational databases. Consequently, the counterpart property knowledge graph of benchmarks with high accuracy and integrity can be ensured. The code and data will be publicly available. The code and data are available at github\footnote{https://github.com/nlp-tlp/Rel2Graph}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Enhancing Text2Cypher with Schema Filtering

    cs.DB 2025-05 conditional novelty 4.0 of 10

    Schema filtering, especially exact-match pruning, reduces prompt length and cost for Text2Cypher and improves accuracy for smaller models, though larger models gain less.

  2. Text2Cypher: Bridging Natural Language and Graph Databases

    cs.LG 2024-12 conditional novelty 4.0 of 10

    The paper releases a unified 44,387-instance Text2Cypher dataset and reports that fine-tuning six models on it improves Google-BLEU and Exact Match over baselines.

Pith tools