Database Paper Browser

Back to papers

On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract)

Summary: Defines connection-trap-free (CTF) schemes that guarantee easy, efficient retrieval of sound and complete answers by design, thereby eliminating the connection-trap problem. Develops core properties and characterizes independent CTF schemes assuming an embedded cover of FDs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
756
Venue
PODS
Year
1986
Pagerank
4.1945683e-05
Overall Rank
12,995 | 9.60%
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
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank Cited Paper Year Venue Pagerank
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
135 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00042421957
458 Independent Database Schemas (Extended Abstract) 1982 PODS 0.00022657396
920 The U. R. Strikes Back 1982 PODS 0.00015338004
1,062 Assumptions in Relational Database Theory 1982 PODS 0.00014366096
1,937 Windows On The World 1983 SIGMOD 0.00010029315
2,318 Efficient Query Answering in the Representative Instance Approach 1985 PODS 9.0400919e-05
2,918 Notions of Dependency Satisfaction 1982 PODS 7.9051531e-05
4,025 On the Recognition and Design of Acyclic Databases 1984 PODS 6.5212056e-05
4,413 Toward Logical Data Independence: A Relational Query Language without Relations 1982 SIGMOD 6.205847e-05
8,942 ONE FLAVOR ASSUMPTION AND gamma-ACYCLICITY FOR UNIVERSAL RELATION VIEWS 1986 PODS 4.427232e-05
Previous Page 1 / 1 Next

Semantically Similar Papers