ACM Home Page
Please provide us with feedback. Feedback
Inverting relational expressions: a uniform and natural technique for various database problems
Full text PdfPdf (701 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems table of contents
Atlanta, Georgia
SESSION: Session 8 table of contents
Pages: 305 - 311  
Year of Publication: 1983
ISBN:0-89791-097-4
Authors
Tomasz Imielinski  McGill University
Witold Lipski, Jr.  Polish Academy of Science
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/588058.588094
What is a DOI?

ABSTRACT

Let f be a relational expression and let q be a relation. It appears, surprisingly enough, that the concept of the table introduced in order to represent incomplete information can be used as a tool for representing {r f(r) ⊇ q} for a class of relational expressions built up from projection, join and positive selection. This fact, together with some other known properties of tables has wide applications and leads to a new technique for expressing and solving many database problems, especially those concerned with views. This technique is, we believe, more natural and systematic than those previously used such as tableau techniques. Some applications, like view dependencies, translating states between views and the view equivalence problem are presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
{ASU} Aho, A V., Sagiv, Y, Ullman, J D, Equivalences among relational expressions SIAM J Comput 84 (1979) 218-246
 
3
{BMSU} Beeri, C, Mendelson, A O, Sagiv, Y, Ullman, J D, Equivalence of relational database schemes SIAM J Comput 10 (1981) 352-370
4
 
5
{BV} Beeri, C, Vardi, M, A proof procedure for data dependencies The Hebrew University, Dept of Computer Science, December, 1980
6
 
7
{FMU} Fagin, R, Mendelson, A O, Ullman, J D, A simplified universal relation assumption and its properties Techn Rep RJ 2900, IBM Research Labs, San Jose, CA, November, 1980
 
8
9
 
10
{IL1} Imielinski, T, Lipski, W, On representing incomplete information in a relational database Proc 7 VLDB, Cannes, France, September, 1981, pp 388-397
11
 
12
{IL3} Imielinski, T, Lipski, W, Incomplete information and dependencies Submitted for publication
13
 
14
{M} Mendelson, A O, Database states and their tableaux Proc XP2 Workshop on Relational Database Theory, 1981
15
 
16
{R} Reiter, R, On closed world databases In Logic and Databases (M Gallaire and J Minker, Eds) Plenum Press, New York, 1978, pp 58-76
17
18
 
19
 
20

Collaborative Colleagues:
Tomasz Imielinski: colleagues
Witold Lipski, Jr.: colleagues