vldb_1995_elementary.txt

利用lwp：：get写的

Queries are considered generalized programing expressions which may be used within macroscopic imperative statements, such as creating, updating, inserting, and deleting data objects.
Queries may be also used as procedures' parameters, as well as determine the output from functional procedures (SQL-like views).
The semantics, including generalized query operators (selection, projection, navigation, join, quantifiers, etc.), is defined in terms of operationson two stacks.
The environment stack deals with the scope control and binding names.
The result stack stores intermediate and final query results.
We discuss definitions of object-oriented concepts and present variants ofparameter passing methods.
Finally, we indicate a potential of the approach for query optimization based on rewriting.</abstract></paper><paper><title>Towards a Cooperative Transaction Model - The Cooperative Activity Model.</title><author><AuthorName>Marek Rusinkiewicz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wolfgang Klas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas Tesch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>J{\"u}rgen W{\"a}sch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter Muth</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Using Flexible Transactions to Support Multi-System Telecommunication Applications.</name><name>Specifying and Enforcing Intertask Dependencies.</name><name>A Model of CAD Transactions.</name><name>ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior.</name><name>A Formalism for Extended Transaction Model.</name><name>ACTA: The SAGA Continues.</name><name>Delegation in ACTA to Control Sharing in Extended Transactions.</name><name>Organizing Long-Running Activities with Triggers and Transactions.</name><name>Database Transaction Models for Advanced Applications.</name><name>Transaction Groups: A Model for Controlling Cooperative Transactions.</name><name>Specification and Management of Extended Transactions in a Programmable Transaction Environment.</name><name>Data Sharing in Group Work.</name><name>Principles of Transaction-Oriented Database Recovery.</name><name>Object-Oriented Modeling for Hypermedia Systems Using the VODAK Model Language.</name><name>Modern Database Systems: The Object Model, Interoperability, and Beyond.
 ACM Press and Addison-Wesley 1995, ISBN 0-201-59098-0</name><name>Dynamic Restructuring of Transactions.</name><name>A Transaction Model Supporting Complex Applications in Integrated Information Systems.</name><name>Split-Transactions for Open-Ended Activities.</name><name>Specification and Execution of Transactional Workflows.</name><name>Concurrency Control in Collaborative Hypertext Systems.</name><name>The ConTract Model.</name></citation><abstract>With the emergence of cooperative applications it turned out that traditional transaction concepts are not suitable for these scenarios.
Isolation of transactions, as guaranteed by the ACID transaction properties, contradicts the need of cooperation between users.
In this paper, we propose a cooperative activity model that provides transactional properties suitable for cooperative scenarios.
Each user participating in a cooperative activity has his own private workspace that is isolated from other users.
Cooperation is achieved by controlled exchange and synchronization of the contents of workspaces among the users and by installing results of their activities in the common activity database.
Our model ensures that the joint execution of a cooperative activity is equivalent to one that could have been carried out by a single user.
We discuss our cooperative activity model in different scenarios, one requiring a close cooperation in an authoring environment, and the second implementing a workflow-like scenario.</abstract></paper><paper><title>A Practical and Modular Implementation of Extended Transaction Models.</title><author><AuthorName>Roger S. Barga</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Calton Pu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>ASSET: A System for Supporting Extended Transactions.</name><name>Transaction Processing Monitors.</name><name>Implementation of the Flex Transaction Model.</name><name>ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior.</name><name>Database Transaction Models for Advanced Applications.</name><name>Specification and Management of Extended Transactions in a Programmable Transaction Environment.</name><name>Transaction Processing: Concepts and Techniques.</name><name>Concepts and Experiments in Computational Reflection.</name><name>Exotica: A Research Perspective ob Workflow Management Systems.</name><name>A Survey and Critique of Advanced Transaction Models.</name><name>Long-Lived Concurrency Activities.</name><name>ACID Properties Need Fast Relief: Relaxing Consistency Using Epsilon Serializability.</name><name>Split-Transactions for Open-Ended Activities.</name><name>In Search of Acceptability Citeria: Database Consistency Requirements and Transaction Correctness properties.</name><name>Concurrency on High-trafic Data Elements.</name><name>The ConTract Model.</name><name>Multi-Level Transaction Management for Complex Objects: Implementation, Performance, Parallelism.</name></citation><abstract>Although many extended transaction models have been proposed [Elm93], few practical implementations exist and even fewer can support more than one model.
We present the Reflective Transaction Framework, as a practical andmodular method to implement extended transaction models.
We achieve modularity by applying the Open Implementation approach [Kic92](also known as meta-object protocol [KdRB91]) to the design of the reflective transaction framework.
We achieve practicality by implementing on top of a commercial transactionprocessing monitor.
For our implementation of the reflective transaction framework, we introduce transaction adapters, add-on modules built on top of existing commercial TP components, such as Encina, that extend their functionality tosupport extended transaction features and semantics.
Since our framework design is based on the transaction processing monitor architecture [GR93], it is widely applicable to many modern TP monitors.
The reflective transaction framework enables us to implement a wide range of independently proposed extended transaction models, which we demonstrate by implementing the split/join model [PKH88] and cooperative transactiongroups [MP92, RC92].</abstract></paper><paper><title>Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions.</title><author><AuthorName>Paul Ammann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sushil Jajodia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Indrakshi Ray</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Consistency and Orderability: Semantics-Based Correctness Criteria for Databases.</name><name>Concurrency Control and Recovery in Database Systems.
 Addison-Wesley 1987, ISBN 0-201-10715-5</name><name>Semantics-Based Concurrency Control: Beyond Commutativity.</name><name>Synthesis of Extended Transaction Models Using ACTA.</name><name>Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase.</name><name>Using Semantic Knowledge of Transactions to Increase Concurrency.</name><name>Using Semantic Knowledge for Transaction Processing in Distributed Database.</name><name>Services for a Workflow Management System.</name><name>Extending Multiversion Time-Stamping Protocols to Exploit Type Information.</name><name>Hybrid Concurrency Control for Abstract Data Types.</name><name>Mutual Consistency in Decentralized Distributed Systems.</name><name>Formal Model of Correctness Without Serializability.</name><name>Formal Aspects of Concurrency Control in Long-Duration Transaction Systems Using the NT/PV Model.</name><name>Multilevel Atomicity - A New Correctness Criterion for Database Concurrency Control.</name><name>Verifying Properties of Parallel Programs: An Axiomatic Approach.</name><name>Modular Concurrency Control and Failure Recovery.</name><name>Simple Rational Guidance for Chopping Up Transactions.</name><name>Commutativity-Based Concurrency Control for Abstract Data Types.</name><name>The ConTract Model.</name></citation><abstract>Many researchers have investigated the process of decomposing transactionsinto smaller pieces to increase concurrency.
The research typically focuses on implementing a decomposition supplied bythe database application developer, with relatively little attention to what constitutes a desirable decomposition and how the developer should obtain such a decomposition.
In this paper, we argue that the decomposition process itself warrants attention.
A decomposition generates a set of proof obligations that must be satisfied to show that a particular decomposition correctly models the original collection of transactions.
We introduce the notion of semantic histories to formulate and prove the necessary properties.
Since the decomposition impacts not only the atomicity of transactions, but isolation and consistency as well, we present a technique based on formal methods that allows these properties to be surrendered in a carefully controlled manner.</abstract></paper><paper><title>Bypassing Joins in Disjunctive Queries.</title><author><AuthorName>Michael Steinbrunn</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Klaus Peithner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guido Moerkotte</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alfons Kemper</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Extensible Cost Models and Query Optimization in GENESIS.</name><name>Rule-Based Optimization and Query Processing in an Extensible Geometric Database System.</name><name>Query Processing in a System for Distributed Databases (SDD-1).</name><name>Experiences Building the Open OODB Query Optimizer.</name><name>Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited.</name><name>The Object Database Standard: ODMG-93 (Release 1.1).</name><name>A General Framework for the Optimization of Object-Oriented Queries.</name><name>Query Processing for Advanced Database Systems, Selected Contributions from a Workshop on "Query Processing in Object-Oriented, Complex-Object and Nested Relation Databases", Interationales Begegnungs- und Forschungszentrum f&amp;uuml;r Informatik, Schloss Dagstuhl, Germany, June 1991.</name><name>A Rule-Based View of Query Optimization.</name><name>The EXODUS Optimizer Generator.</name><name>The Volcano Optimizer Generator: Extensibility and Efficient Search.</name><name>Practical Predicate Placement.</name><name>Extensible Query Processing in Starburst.</name><name>Predicate Migration: Optimizing Queries with Expensive Predicates.</name><name>Query Optimization in Database Systems.</name><name>Optimization of Nonrecursive Queries.</name><name>Advanced Query Processing in Object Bases Using Access Support Relations.</name><name>Object-Oriented Database Management: Applications in Engineering and Computer Science.</name><name>A Blackboard Architecture for Query Optimization in Object Bases.</name><name>Optimizing Disjunctive Queries with Expensive Predicates.</name><name>Query Optimization in Star Computer Networks.</name><name>Query Optimization by Predicate Move-Around.</name><name>Grammar-like Functional Rules for Representing Query Optimization Alternatives.</name><name>Control of an Extensible Query Optimizer: A Planning-Based Approach.</name><name>Queries and Query Processing in Object-Oriented Database Systems.</name><name>Access Path Selection in a Relational Database Management System.</name><name>Working Together in Harmony - An Implementation of the CORBA Object Query Service and Its Evaluation.</name></citation><abstract>The bypass technique, which was formerly restricted to selections only [KMPS94], is extended to join operations.
Analogous to the selection case, the join operator may generate two outputstreams-the join result and its complement-whose subsequent operator sequence is optimized individually.
By extending the bypass technique to joins, several problems have to be solved.
(1) An algorithm for exhaustive generation of the search space for bypass plans has to be developed.