Database Paper Browser

Back to papers

Solving Hard Variants of Database Schema Matching on Quantum Computers

Summary: End-to-end hybrid quantum–classical solution for NP-hard variants of database schema matching, partitioning matching instances into QPU-solvable subproblems coordinated by classical CPUs. Demo highlights QPU/CPU handover trade-offs, decomposition strategies and current QPU scale/noise limits. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13247
Venue
VLDB
Year
2023
Pagerank
4.3341665e-05
Overall Rank
9,491 | 33.98%
DOI
10.14778/3611540.3611603

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,340 A Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings 2025 PODS 4.1945683e-05
10,571 Quantum Data Management in the NISQ Era 2025 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers