Class Hierarchies and Their Complexity.

@inproceedings{DBLP:conf/dbpl/Lenzerini87,
  author    = {Maurizio Lenzerini},
  editor    = {Fran\c{c}ois Bancilhon and
               Peter Buneman},
  title     = {Class Hierarchies and Their Complexity},
  booktitle = {Advances in Database Programming Languages, Papers from DBPL-1,
               September 1987, Roscoff, France},
  publisher = {ACM Press / Addison-Wesley},
  year      = {1987},
  isbn      = {0-201-50257-7},
  pages     = {43-65},
  ee        = {db/conf/dbpl/Lenzerini87.html},
  crossref  = {DBLP:conf/dbpl/87},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-5 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[1]

Antonio Albano, Luca Cardelli, Renzo Orsini: Galileo: A Strongly-Typed, Interactive Conceptual Language. ACM Trans. Database Syst. 10(2): 230-260(1985) BibTeX

[2]

Hiroshi Arisawa, Takao Miura: On the Properties of Extended Inclusion Dependencies. VLDB 1986: 449-456 BibTeX

[3]

Paolo Atzeni, Douglas Stott Parker Jr.: Formal Properties of Net-Based Knowledge Representation Schemes. ICDE 1986: 700-706 BibTeX

[4]

Paolo Atzeni, Douglas Stott Parker Jr.: Set Containment Inference. ICDT 1986: 73-90 BibTeX

[5]

Peter Buneman, Malcolm P. Atkinson: Inheritance and Persistence in Database Programming Languages. SIGMOD Conference 1986: 4-15 BibTeX

[6]

William F. Dowling, Jean H. Gallier: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1(3): 267-284(1984) BibTeX

[7]

David J. Israel, Ronald J. Brachman: Some Remarks on the Semantics of Representation Languages. On Conceptual Modelling (Intervale) 1982: 119-146 BibTeX

[8]

Maurizio Lenzerini: Covering and Disjointness Constraints in Type Networks. ICDE 1987: 386-393 BibTeX

[9]

David A. McAllester, Ramin Zabih: Boolean Classes. OOPSLA 1986: 417-423 BibTeX