Table of Contents

• From a laguna to open waters: Another view on the next generations of databasesHervé Gallaire. 1 [doi]
• Knowledge to Mediate from User s Workstations to DatabasesGio Wiederhold. 2 [doi]
• On the design and implementation of information systems from deductive conceptual modelsAntoni Olivé. 3-11 [doi]
• A Deductive Method for Entity-Relationship ModelingGiuseppe Di Battista, Maurizio Lenzerini. 13-21 [doi]
• A Family of Incomplete Relational Database ModelsAdegbemiga Ola, Gultekin Özsoyoglu. 23-31 [doi]
• Gral: An Extensible Relational Database System for Geometric ApplicationsRalf Hartmut Güting. 33-44 [doi]
• The LSD tree: Spatial Access to Multidimensional Point and Nonpoint ObjectsAndreas Henrich, Hans-Werner Six, Peter Widmayer. 45-53 [doi]
• Managing Complex Objects in an Extensible Relational DBMSGeorges Gardarin, Jean-Pierre Cheiney, Gerald Kiernan, Dominique Pastre, Hervé Stora. 55-65 [doi]
• Effective Resource Utilization for Multiprocessor Join ExecutionMarguerite C. Murphy, Doron Rotem. 67-75 [doi]
• Optimization and Dataflow Algorithms for Nested Tree QueriesM. Muralikrishna. 77-85 [doi]
• Parallel Processing of Recursive Queries in Distributed ArchitecturesGuy Hulin. 87-96 [doi]
• Pasta-3 s Graphical Query Language: Direct Manipulation, Cooperative Queries, Full Expressive PowerMichel Kuntz, Rainer Melchert. 97-105 [doi]
• ENIAM: A More Complete Conceptual Schema LanguagePeter N. Creasy. 107-114 [doi]
• FaceKit: A Database Interface Design ToolkitRoger King, Michael Novak. 115-123 [doi]
• A Low Communication Sort Algorithm for a Parallel Database MachineRaymond A. Lorie, Honesty C. Young. 125-134 [doi]
• Percentile Finding Algorithm for Multiple Sorted RunsBalakrishna R. Iyer, Gary R. Ricard, Peter J. Varman. 135-144 [doi]
• A Signature Access Method for the Starburst Database SystemWalter W. Chang, Hans-Jörg Schek. 145-153 [doi]
• Commutativity and its Role in the Processing of Linear RecursionYannis E. Ioannidis. 155-163 [doi]
• Estimating the Size of Generalized Transitive ClosuresRichard J. Lipton, Jeffrey F. Naughton. 165-171 [doi]
• Argument Reduction by FactoringJeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. 173-182 [doi]
• Database Support for HypertextB. Nick Rossiter. 183 [doi]
• Finding Regular Simple Paths in Graph DatabasesAlberto O. Mendelzon, Peter T. Wood. 185-193 [doi]
• Towards on Open Architecture for LDLDanette Chimenti, Ruben Gamboa, Ravi Krishnamurthy. 195-203 [doi]
• Event-Join Optimization in Temporal Relational DatabasesArie Segev, Himawan Gunadhi. 205-215 [doi]
• Achieving Zero Information-Loss in a Classical Database EnvironmentGautam Bhargava, Shashi K. Gadia. 217-224 [doi]
• Derived Data Update in Semantic DatabasesI-Min A. Chen, Dennis McLeod. 225-235 [doi]
• Using Integrity Constraints to Provide Intensional Answers to Relational QueriesAmihai Motro. 237-246 [doi]
• Integration of Buffer Management and Query Optimization in Relational Database EnvironmentDouglas W. Cornell, Philip S. Yu. 247-255 [doi]
• The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join MethodMasaru Kitsuregawa, Masaya Nakayama, Mikio Takagi. 257-266 [doi]
• Building knowledge-based applications with cooperating databasesRakesh Agrawal. 267 [doi]
• Random Sampling from B+ TreesFrank Olken, Doron Rotem. 269-277 [doi]
• Aggregate Evaluability in Statistical DatabasesFrancesco M. Malvestuto, Marina Moscarini. 279-286 [doi]
• Aggregates in Possibilistic DatabasesElke A. Rundensteiner, Lubomir Bic. 287-295 [doi]
• Extending the Relational Algebra to Capture Complex ObjectsBernhard Mitschang. 297-305 [doi]
• Sorting, Grouping and Duplicate Elimination in the Advanced Information Management PrototypeGunter Saake, Volker Linnemann, Peter Pistor, Lutz Michael Wegner. 307-316 [doi]
• Optimization of Relational Schemas Containing Inclusion DependenciesMarco A. Casanova, Luiz Tucherman, Antonio L. Furtado, Anelise P. Braga. 317-325 [doi]
• The Case For Safe RAMGeorge P. Copeland, Tom W. Keller, Ravi Krishnamurthy, Marc G. Smith. 327-335 [doi]
• ARIES/NT: A Recovery Method Based on Write-Ahead Logging for Nested TransactionsKurt Rothermel, C. Mohan. 337-346 [doi]
• Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBaseWeimin Du, Ahmed K. Elmagarmid. 347-355 [doi]
• The O2 Object Manager: an OverviewFernando Vélez, Guy Bernard, Vineeta Darnis. 357-366 [doi]
• On Correctly Configuring Versioned ObjectsRakesh Agrawal, H. V. Jagadish. 367-374 [doi]
• The Starburst Long Field ManagerTobin J. Lehman, Bruce G. Lindsay. 375-383 [doi]
• Scheduling Real-Time Transactions with Disk Resident DataRobert K. Abbott, Hector Garcia-Molina. 385-396 [doi]
• Priority in DBMS Resource SchedulingMichael J. Carey, Rajiv Jauhari, Miron Livny. 397-410 [doi]
• The O2 Database Programming LanguageChristophe Lécluse, Philippe Richard. 411-422 [doi]
• A Model of Queries for Object-Oriented DatabasesWon Kim. 423-432 [doi]
• OQL: A Query Language for Manipulating Object-oriented DatabasesA. M. Alashqur, Stanley Y. W. Su, Herman Lam. 433-442 [doi]
• Database Tools and InterfacesDina Bitton. 443 [doi]
• Monitoring Database ObjectsTore Risch. 445-453 [doi]
• Situation Monitoring for Active DatabasesArnon Rosenthal, Sharma Chakravarthy, Barbara T. Blaustein, José A. Blakeley. 455-464 [doi]
• Future research directions: Evidence from this conferencePeter M. G. Apers. 465 [doi]