DBScholar

Back to papers

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models

Summary: Reduces minimal conceptual-connection problem in semantic data models to Steiner trees on k-partite graphs and focuses on the bipartite case. Shows specific bipartite chordality conditions yield linear-time Steiner algorithms and equates these chordality notions with relational acyclicity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
731
Venue
PODS
Year
1985
Pagerank
5.093636e-05
Overall Rank
13,213 | 9.35%
DOI
10.1145/325405.325426

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{ausiello_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models}},
        url = {https://dl.acm.org/doi/10.1145/325405.325426},
        doi = {10.1145/325405.325426},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ausiello, G. and D'Atri, A. and Moscarini, M.},
        year = {1985}
}

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 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,289 Windows On The World 1983 SIGMOD 8.7994393e-05
8,500 Answering Queries In Relational Databases 1983 SIGMOD 5.4133072e-05
Previous Page 1 / 1 Next

Semantically Similar Papers