DBScholar

Back to papers

Rewriting Queries Using Views in Description Logics

Summary: For description-logic view definitions without existentials, a UCQ rewriting always exists and is answer-maximal. With existentials rewritings may be recursive; the paper gives an algorithm maximal on tree-shaped instances and shows maximal rewritings may not exist in general. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1106
Venue
PODS
Year
1997
Pagerank
8.4625195e-05
Overall Rank
2,527 | 82.67%
DOI
10.1145/263661.263673

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{beeri_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{Rewriting Queries Using Views in Description Logics}},
        url = {https://dl.acm.org/doi/10.1145/263661.263673},
        doi = {10.1145/263661.263673},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Beeri, Catriel and Levy, Alon Y. and Rousset, Marie-Christine},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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