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: 4.1945683e-05
Overall Rank: 13,014 | 9.47%
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
1,937	Windows On The World	1983	SIGMOD	0.00010029315
8,216	Answering Queries In Relational Databases	1983	SIGMOD	4.5575596e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,995	Structure and Complexity of Bag Consistency	2021	PODS	4.8683245e-05
12,966	Temporal Relationships in Databases	1988	VLDB	4.1945683e-05
10,985	Constant-time Connectivity Querying in Dynamic Graphs	2024	SIGMOD	4.1945683e-05
3,854	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6988744e-05
7,436	Schema Mappings for Data Graphs	2017	PODS	4.7311358e-05
6,603	Properties Of Database Schemata With Functional Dependencies	1984	PODS	4.9971153e-05
120	On The Semantics Of The Relational Data Model	1975	SIGMOD	0.00045646715
11,829	Semantic Acyclicity Under Constraints	2016	PODS	4.1945683e-05
751	Partition Semantics for Relations	1985	PODS	0.0001721247
6,948	Semantic Acyclicity on Graph Databases	2013	PODS	4.8898337e-05