ACM SIGMOD Conference 1989: Portland, Oregon

@proceedings{DBLP:conf/sigmod/89,
  editor    = {James Clifford and
               Bruce G. Lindsay and
               David Maier},
  title     = {Proceedings of the 1989 ACM SIGMOD International Conference on
               Management of Data, Portland, Oregon, May 31 - June 2, 1989},
  publisher = {ACM Press},
  year      = {1989},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Keynote Address

• Esther Dyson:
  On Beyond Data. 1
  

Panels

• Jim Gray:
  Database Performance Metrics. 2
  
• Gultekin Özsoyoglu:
  Real-Time Databases: Are they Real? 3
  
• L. Anderson:
  User Interfaces. 4
  
• William Kent:
  An Overview of the Versioning Problem. 5-7
  

Query Processing and Stable Storage

• Silvio Salza, Mario Terranova:
  Evaluating the Size of Queries on Relational Databases with non Uniform Distribution and Stochastic Dependence. 8-14
  
• Elliot K. Kolodner, Barbara Liskov, William E. Weihl:
  Atomic Garbage Collection: Managing a Stable Heap. 15-25
  
• Guozhu Dong:
  On Distributed Processibility of Datalog Queries by Decomposing Databases. 26-35
  

Database Languages

• Rakesh Agrawal, Narain H. Gehani:
  ODE (Object Database and Environment): The Language and the Data Model. 36-45
  
• Atsushi Ohori, Peter Buneman, Val Tannen:
  Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference. 46-57
  
• Alexander Borgida, Ronald J. Brachman, Deborah L. McGuinness, Lori Alperin Resnick:
  CLASSIC: A Structural Data Model for Objects. 58-67
  

Relational Database Extensions

• Wen-Chi Hou, Gultekin Özsoyoglu, Baldeo K. Taneja:
  Processing Aggregate Relational Queries with Hard Time Constraints. 68-77
  
• H. V. Jagadish:
  Incorporating Hierarchy in a Relational Model of Data. 78-87
  
• Stephanie J. Cammarata, Prasadram Ramachandra, Darrell Shane:
  Extendeing a Relational Database with Deferred Referential Integrity Checking and Intelligent Joins. 88-97
  

Parallelism and Performance

• George P. Copeland, Tom W. Keller:
  A Comparison Of High-Availability Media Recovery Techniques. 98-109
  
• Donovan A. Schneider, David J. DeWitt:
  A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment. 110-121
  
• Michael J. Carey, Miron Livny:
  Parallelism and Concurrency Control Performance in Distributed Database Machines. 122-133
  

Semantics of Object-Oriented Databases

• Michael Kifer, Georg Lausen:
  F-Logic: A Higher-Order language for Reasoning about Objects, Inheritance, and Scheme. 134-146
  
• Richard Hull, Jianwen Su:
  On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions (Extended Abstract). 147-158
  
• Serge Abiteboul, Paris C. Kanellakis:
  Object Identity as a Query Language Primitive. 159-173
  

Logic and Databases

• Jan Chomicki, Tomasz Imielinski:
  Relational Specifications of Infinite Query Answers. 174-183
  
• Xian-He Sun, Nabil Kamel, Lionel M. Ni:
  Solving Implication Problems in Database Applications. 185-192
  
• François Bry:
  Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited. 193-204
  

Triggers and Derived Data

• Yannis E. Ioannidis, Timos K. Sellis:
  Conflict Resolution of Rules Assigning Values to Virtual Attributes. 205-214
  
• Dennis R. McCarthy, Umeshwar Dayal:
  The Architecture Of An Active Data Base Management System. 215-224
  
• Donald Cohen:
  Compiling Complex Database Transition Triggers. 225-234
  

Recursive Query Processing

• Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
  Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. 235-242
  
• Per-Åke Larson, Vinay Deshpande:
  A File Structure Supporting Traversal Recursion. 243-252
  
• Rakesh Agrawal, Alexander Borgida, H. V. Jagadish:
  Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. 253-262
  

Nested Structures

• Marc Gyssens, Jan Paredaens, Dirk Van Gucht:
  A Grammar-Based Approach Towards Unifying Hierarchical Data Models (Extended Abstract). 263-272
  
• Latha S. Colby:
  A Recursive Algebra and Query Optimization for Nested Relations. 273-283
  
• Abdullah Uz Tansel, Lucy Garnett:
  Nested Historical Relations. 284-294
  

Access Methods

• Jack A. Orenstein:
  Redundancy in Spatial Databases. 295-305
  
• Stavros Christodoulakis, Daniel Alexander Ford:
  Retrieval Performance Versus Disc Space Utilization on WORM Optical Discs. 306-314
  
• David B. Lomet, Betty Salzberg:
  Access Methods for Multiversion Data. 315-324
  

Implementing Objects

• Eugene J. Shekita, Michael J. Carey:
  Performance Enhancement Through Replication in an Object-Oriented DBMS. 325-336
  
• Won Kim, Elisa Bertino, Jorge F. Garza:
  Composite Objects Revisted. 337-347
  
• Ellis E. Chang, Randy H. Katz:
  Exploiting Inheritance and Structure Semantics for Effective Clustering and Buffering in an Object-Oriented DBMS. 348-357
  

Query Optimization

• Goetz Graefe, Karen Ward:
  Dynamic Query Evaluation Plans. 358-366
  
• Arun N. Swami:
  Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques. 367-376
  
• Laura M. Haas, Johann Christoph Freytag, Guy M. Lohman, Hamid Pirahesh:
  Extensible Query Processing in Starburst. 377-388
  

Concurrency Control and Consistency

• Jian Tang, N. Natarajan:
  A Static Pessimistic Scheme for Handling Replicated Databases. 389-398
  
• Clarence A. Ellis, Simon J. Gibbs:
  Concurrency Control in Groupware Systems. 399-407
  
• Divyakant Agrawal, Soumitra Sengupta:
  Modular Synchronization in Multiversion Databases: versionControl and Concurrency Control. 408-417
  

Database Design

• Olga De Troyer:
  RIDL*: A Tool for the Computer-Assisted Engineering of Large Databases in the Presence of Integrity Constraints. 418-429
  
• Victor M. Markowitz, Arie Shoshani:
  On the Correctness of Representing Extended Entity-Relationship Structures in the Relational Model. 430-439
  
• Shamkant B. Navathe, Minyoung Ra:
  Vertical Partitioning for Database Design: A Graphical Algorithm. 440-450