Database Paper Browser

Back to papers

A Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings

Summary: Models 1:N/N:1 global schema matching as an optimization problem; proves NP-hard. Translates to minimizing a rational-valued binary-variable function, enabling quantum algorithms for global matching; preliminary experiments show feasibility. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1960
Venue
PODS
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,340 | 28.07%
DOI
10.1145/3725226

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 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