DBScholar

Back to papers

Conjunctive Query Equivalence of Keyed Relational Schemas (Extended Abstract)

Summary: Studies schema equivalence under query-based mappings in the spirit of Hull (1984) and the impact of primary-key constraints on equivalence. Resolves Hull’s conjecture for query equivalence: under mappings given by conjunctive queries with equality selections, keyed schemas are equivalent iff identical up to renaming/reordering. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1100
Venue
PODS
Year
1997
Pagerank
6.1379759e-05
Overall Rank
5,643 | 61.29%
DOI
10.1145/263661.263667

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{albert_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{Conjunctive Query Equivalence of Keyed Relational Schemas (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/263661.263667},
        doi = {10.1145/263661.263667},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Albert, Joseph and Ioannidis, Yannis and Ramakrishnan, Raghu},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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