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: 732
Venue: PODS
Year: 1985
Pagerank: 5.1725247e-05
Overall Rank: 13,025 | 9.48%
DOI: -

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

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,251	Windows On The World	1983	SIGMOD	8.9356308e-05
8,374	Answering Queries In Relational Databases	1983	SIGMOD	5.4971489e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
7,067	Structure and Complexity of Bag Consistency	2021	PODS	5.7654526e-05
12,976	Temporal Relationships in Databases	1988	VLDB	5.1725247e-05
3,243	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	7.6761871e-05
10,988	Constant-time Connectivity Querying in Dynamic Graphs	2024	SIGMOD	5.1725247e-05
7,094	Schema Mappings for Data Graphs	2017	PODS	5.7579358e-05
6,590	Properties Of Database Schemata With Functional Dependencies	1984	PODS	5.8883652e-05
579	On The Semantics Of The Relational Data Model	1975	SIGMOD	0.00016322639
11,837	Semantic Acyclicity Under Constraints	2016	PODS	5.1725247e-05
1,220	Partition Semantics for Relations	1985	PODS	0.00011703692
7,236	Semantic Acyclicity on Graph Databases	2013	PODS	5.7193914e-05