A Calculus for Complex Objects
Summary: Uniform model of complex objects built from atoms via tuple and set constructors, ordered by a sub-object partial order that yields a lattice supporting object union/intersection. Defines a calculus—extending Horn clauses—to reason and infer over these complex objects. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Francois Bancilhon (Microelectronics And Technology Computer Corporation)
- 2. Setrag Khoshafian (Microelectronics And Technology Computer Corporation)
BibTeX Citation
@inproceedings{bancilhon_pods86,
address = {New York, NY, USA},
series = {{PODS} '86},
title = {{A Calculus for Complex Objects}},
url = {https://dl.acm.org/doi/10.1145/6012.15404},
doi = {10.1145/6012.15404},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bancilhon, Francois and Khoshafian, Setrag},
year = {1986}
}
Incoming Citations (Sorted by Pagerank)
Showing 28 of 28 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 140 | Remarks on the Algebra of Non First Normal Form Relations | 1982 | PODS | 0.00029686538 |
| 421 | The Format Model: A Theory of Database Organization (extended abstract) | 1982 | PODS | 0.00018742219 |
| 538 | Non First Normal Form Relations To Represent Hierarchically Organized Data | 1984 | PODS | 0.00016919845 |
| 1,056 | A Normal Form for Nested Relations | 1985 | PODS | 0.00012388199 |
| 1,586 | An Algebra Of Quotient Relations | 1977 | SIGMOD | 0.00010282631 |
| 3,161 | On the Equivalence of Logical Databases | 1984 | PODS | 7.682034e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 2 | 7,339 | Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure | 1994 | PODS |
| 3 | 799 | Logic Programming With Sets | 1987 | PODS |
| 4 | 2,400 | Untyped Sets, Invention, and Computable Queries | 1989 | PODS |
| 5 | 2,768 | Modeling Complex Structures in Object-Oriented Databases | 1989 | PODS |
| 6 | 7,654 | Positive Higher-Order Queries | 2010 | PODS |
| 7 | 848 | The Representation and Deductive Retrieval of Complex Objects | 1985 | VLDB |
| 8 | 2,897 | On the Expressive Power of Database Queries with Intermediate Types | 1988 | PODS |
| 9 | 3,083 | C-Logic of Complex Objects | 1989 | PODS |
| 10 | 4,491 | A Semantics for Complex Objects and Approximate Queries | 1988 | PODS |