Inverting Relational Expressions - A Uniform And Natural Technique For Various Database Problems
Summary: Introduce inversion of relational expressions via tables to represent f^{-1}(Rep(q)) = { r | f(r) ⊇ q } for expressions with projection, join, and positive selection. Provides a uniform, simpler alternative to tableaux for view problems (dependencies, equivalence, state translation). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Tomasz Imielinski (McGill University)
- 2. Witold Lipski, Jr (Polish Academy of Sciences)
BibTeX Citation
@inproceedings{imielinski_pods83,
address = {New York, NY, USA},
series = {{PODS} '83},
title = {{INVERTING RELATIONAL EXPRESSIONS - A UNIFORM AND NATURAL TECHNIQUE FOR VARIOUS DATABASE PROBLEMS}},
url = {https://dl.acm.org/doi/10.1145/588058.588094},
doi = {10.1145/588058.588094},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Imielinski, Tomasz and Witold Lipski, Jr},
year = {1983}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,115 | Incomplete Information and Dependencies in Relational Databases | 1983 | SIGMOD | 6.8936288e-05 |
| 13,233 | On Lossless Transformation of Database Schemes Not Necessarily Satisfying Universal Instance Assumption (preliminary version) | 1984 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 266 | Can We Use The Universal Instance Assumption Without Using Nulls? | 1981 | SIGMOD | 0.00022823892 |
| 3,276 | On Equivalences of Database Schemes | 1982 | PODS | 7.5732637e-05 |
| 4,843 | Notions of Dependency Satisfaction | 1982 | PODS | 6.482729e-05 |
| 13,261 | A Technique For Translating States Between Database Schemata | 1982 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,338 | Equivalence of Views by Query Capacity | 1985 | PODS |
| 2 | 1,417 | On Computing Restricted Projections of Representative Instances | 1985 | PODS |
| 3 | 2,339 | Quasi-inverses of Schema Mappings | 2007 | PODS |
| 4 | 5,916 | Tables As a Paradigm for Querying and Restructuring | 1996 | PODS |
| 5 | 5,392 | On the Computation of Relational View Complements | 2002 | PODS |
| 6 | 979 | Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins | 1985 | PODS |
| 7 | 13,261 | A Technique For Translating States Between Database Schemata | 1982 | SIGMOD |
| 8 | 1,075 | Updates Of Relational Views | 1983 | PODS |
| 9 | 97 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD |
| 10 | 3,103 | View-Based Query Processing for Regular Path Queries with Inverse | 2000 | PODS |