vldb_1994_elementary.txt

利用lwp：：get写的

approach of broadcasting transactions to remote sites and handling these
transactions in their complete form at each site. We consider data of
two types: shared-private data and public data and show that
transactions working only on shared-private data can be executed under a
local concurrency control protocol. We assume a synchronized network
with with possibilities of partition failures. We show that in our
scheme transaction execution can be managed with less communication
delay compared to centralized transaction control.</abstract></paper><paper><title>A Top-Down Approach for Two Level Serializability.</title><author><AuthorName>Mourad Ouzzani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>M. A. Atroun</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>N. L. Belkhodja</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Concurrency Control and Recovery for Global Procedures in Federated Database Systems.</name><name>Concurrency Control and Recovery in Database Systems.
 Addison-Wesley 1987, ISBN 0-201-10715-5</name><name>Overview of Multidatabase Transaction Management.</name><name>Multidatabase Update Issues.</name><name>Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase.</name><name>Maintaining Quasi Serializability in Multidatabase Systems.</name><name>A Paradigm for Concurrency Control in Heterogeneous Distributed Database Systems.</name><name>On Serializability of Multidatabase Transactions Through Forced Local Conflicts.</name><name>The Concurrency Control Problem in Multidatabases: Characteristics and Solutions.</name><name>Non-Serializable Executions in Heterogeneous Distributed Database Systems.</name><name>Superdatabases for Composition of Heterogeneous Databases.</name><name>Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases.</name><name>Concurrency Control Based on Distributed Cycle Detection.</name><name>Prepare and Commit Certification for Decentralized Transaction Management in Rigorous Heterogeneous Multidatabases.</name></citation><abstract>Concurrency control has received considerable attention in multidatabase
systems because of their characteristics such as heterogeneity and
autonomy. Particularly, various concurrency control protocols have been
developed in the literature. In this paper, we present a protocol that
guarantees the two level serializability criterion and built up
according to the top down approach.</abstract></paper><paper><title>New Concurrency Control Algorithms for Accessing and Compacting B-Trees.</title><author><AuthorName>V. W. Setzer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Andrea Zisman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Organization and Maintenance of Large Ordered Indices.</name><name>Concurrency of Operations on  B-Trees.</name><name>Alternatives to the B+-Tree.</name><name>Prefix B-Trees.</name><name>Introduction to Algorithms.
 The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0</name><name>The Ubiquitous B-Tree.</name><name>The Structure of "THE"-Multiprogramming System.</name><name>Concurrent Search and Insertion in 2-3 Trees.</name><name>A Dichromatic Framework for Balanced Trees.</name><name>The Art of Computer Programming, Volume III: Sorting and Searching.
 Addison-Wesley 1973, ISBN 0-201-03803-X</name><name>Database System Concepts, 1st Edition.
 McGraw-Hill Book Company 1986, ISBN 0-07-100529-3</name><name>Approaches to Concurrency in B-Trees.</name><name>A New Method for Concurrency in B-Trees.</name><name>Concurrent Use of B-trees with Variable-Length Entries.</name><name>Concurrent Reading and Writing.</name><name>Efficient Locking for Concurrent Operations on  B-Trees.</name><name>Optimal 2, 3-Trees.</name><name>Concurrency Control in B+-Trees Databases Using Preparatory Operations.</name><name>Concurrent Operations on B*-Trees with Overtaking.</name><name>B-Trees in a System with Multiple Users.</name><name></name></citation><abstract>This paper initially presents a brief but fairly exhaustive survey of
solutions to the concurrency control problem for B-trees. We then
propose a new solution, which is characterized by the use of
variable-length indices, the employment of a single lock type for the
usual access operations and preemptive splits as well as delayed
catenations and subdivisions. We also introduce a new compaction
algorithm and its concurrent execution, using a new lock type.</abstract></paper><paper><title>OdeFS: A File System Interface to an Object-Oriented Database.</title><author><AuthorName>Narain H. Gehani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>William D. Roome</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Querying and Updating the File.</name><name>ODE (Object Database and Environment): The Language and the Data Model.</name><name>Rationale for the Design of Persistence and Query Processing Facilities in the Database Programming Language O++.</name><name>OdeView: The Graphical Interface to Ode.</name><name>Object Versioning in Ode.</name><name>Shoring Up Persistent Applications.</name><name>From Structured Documents to Novel Query Facilities.</name><name>Optimizing Queries on Files.</name><name>CQL++: A SQL for the Ode Object-Oriented DBMS.</name><name>The O++ Database Programming Language: Implementation and Experience.</name><name>Ode as an Active Database: Constraints and Triggers.</name><name>GLIMPSE: A Tool to Search Through Entire File Systems.</name><name>The Rufus System: Information Organization for Semi-Structured Data.</name><name>The C++ Programming Language, Second Edition.
 Addison-Wesley 1991, ISBN 0-201-53992-6</name></citation><abstract>OdeFS is a file-like interface to the Ode object-oriented database.
OdeFS allows database objects to be accessed and manipulated with
standard commands, just like files in a traditional file system.  No
recompilation is required, so proprietary applications can access Ode
objects.  OdeFS is implemented as a network file server, using the NFS
protocol.  This paper describes OdeFS and its implementation.</abstract></paper><paper><title>Implementing Lazy Database Updates for an Object Database System.</title><author><AuthorName>Fabrizio Ferrandina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thorsten Meyer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Roberto Zicari</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Building an Object-Oriented Database System, The Story of O2.</name><name>Semantics and Implementation of Schema Evolution in Object-Oriented Databases.</name><name>AVANCE: An Object Management System.</name><name>The GemStone Data Management System.</name><name>The O2 Database Programming Language.</name><name>A Model for Versioning of Classes in Object-Oriented Databases.</name><name>Persistence in the E Language: Issues and Implementation.</name><name>A Framework for Schema Updates In An Object-Oriented Database System.</name></citation><abstract>Current object database management systems support user-defined
conversion functions to update the database once the schema has been
modified. Two main strategies are possible when implementing such
database conversion functions: immediate or lazy database updates.
In this paper, we concentrate our attention to the definition of
implementation strategies for conversion functions implemented
as lazy database updates.</abstract></paper><paper><title>Access to Objects by Path Expressions and Rules.</title><author><AuthorName>J{\"u}rgen Frohn</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Georg Lausen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Heinz Uphoff</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Objects and Views.</name><name>Building an Object-Oriented Database System, The Story of O2.</name><name>HILOG: A Foundation for Higher-Order Logic Programming.</name><name>Iris: An Object-Oriented Database Management System.</name><name>ESQL2: An Object-Oriented SQL with F-Logic Semantics.</name><name>A Model of Queries for Object-Oriented Databases.</name><name>Querying Object-Oriented Databases.</name><name>Logical Foundations of Object-Oriented and Frame-Based Languages.</name><name>A Logic Programming with Complex Objects.</name><name>A Logical Language for Data and Knowledge Bases.
 Computer Science Press 1989, ISBN 0-7167-8200-6</name><name>An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries.</name><name>The Database Language GEM.</name></citation><abstract>Object oriented databases provide rich structuring capabilities to
organize the objects being relevant for a given application.  Due to
the possible complexity of object structures, path expressions have
become accepted as a concise syntactical means to reference objects.
Even though known approaches to path expressions provide quite elegant
access to objects, there seems to be still a need for more generality.
To this end, the rule-language PathLog is introduced.  A first
contribution of PathLog is to add a second dimension to path
expressions in order to increase conciseness.  In addition, a path
expression can also be used to reference virtual objects.  Both
enhancements give rise to interesting semantic implications.</abstract></paper><paper><title>Towards Event-Driven Modelling for Database Design.</title><author><AuthorName>Maguelonne Teisseire</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Pascal Poncelet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rosine Cicchetti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>State-Based Model Checking of Event-Driven System Requirements.</name><name>IFO: A Formal Semantic Database Model.</name><name>Semantic Modeling of Object Oriented Databases.</name><name>Rule Management and Evaluation: An Active DBMS Perspective.</name><name>Rules Are Objects Too: A Knowledge Model For An Active, Object-Oriented Database System.</name><name>A Transactional Model for Long-Running Activities.</name><name>Rule Management in Object Oriented Databases: A Uniform Approach.</name><name>Specification and Verification of Database Dynamics.</name><name>Event Specification in an Active Object-Oriented Database.</name><name>On Visual Formalisms.</name><name>Semantic Database Modeling: Survey, Applications, and Research Issues.</name><name>Towards a Formal Approach for Object Database Design.</name><name>Object Interaction in Object-Oriented Deductive Conceptual Models.</name><name>Descriptive Specification of Database Object Behaviour.</name><name>Towards object-oriented conceptual modeling.</name><name>Object-Oriented Specification of Databases: An Algebraic Approach.</name><name>An Algebraic Language for Event-Driven Modelling.</name><name>Dynamic Modelling with Events.</name></citation><abstract>This paper is devoted to the dynamic aspect of the IFO2 conceptual
model, an extension of the semantic IFO model defined by S. Abiteboul
and R. Hull.  Its original aspects  are a ``whole-event'' approach, the
use of constructors to express combinations of events, and the
modularity and re-usability of specifications in order to optimize the
designer's work. Furthermore, it offers an overview of the represented
behaviour.  To complement the modelling part, IFO2 includes a
derivation component
which performs the implementation of specifications by using an active
DBMS.</abstract></paper><paper><title>GraphDB: Modeling and Querying Graphs in Databases.</title><author><AuthorName>Ralf Hartmut G{\"u}ting</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries.</name><name>Gram: A Graph Data Model and Query Language.</name><name>Concepts for Graph-Oriented Object Manipulation.</name><name>Rule-Based Optimization and Query Processing in an Extensible Geometric Database System.</name><name>An Extension of SQL for Querying Graph Relations.</name><name>GraphLog: a Visual Formalism for Real Life Recursion.</name><name>Hy+: A Hygraph-based Query and Visualization System.</name><name>A Graphical Query Language Supporting Recursion.</name><name>G+: Recursive Queries Without Recursion.</name><name>Aggregative Closure: An Extension of Transitive Closure.</name><name>Explicit Graphs in a Functional Model for Spatial Databases.</name><name>GOOD: AGraph-Oriented Object Database System.</name><name>Gral: An Extensible Relational Database System for Geometric Applications.</name><name>Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization.</name><name>An Algebra for Structured Office Documents.</name><name>A Graph-Oriented Object Database Model.</name><name>A Graph-Oriented Object Model for Database End-User Interfaces.</name><name>Heuristic Search in Data Base Systems.</name><name>Extensions to Query Languages for Graph Traversal Problems.</name><name>A Call to Order.</name><name>PROBE Spatial Data Modeling and Query Processing in an Image Database Application.</name><name>An Efficient Pictorial Database System for PSQL.</name><name>Traversal Recursion: A Practical Approach to Supporting Recursive Applications.</name><name>The Design of Postgres.</name><name>Geo-SAL: A Query Language for Spatial Data Analysis.</name></citation><abstract>We propose a data model and query language that integrates an explicit
modeling and querying of graphs smoothly into a standard database
environment. For standard applications, some key features of object-
oriented modeling are offered such as object classes organized into a
hierarchy, object identity, and attributes referencing objects.
Querying can be done in a familiar style with a derive statement that
can be used like a select ... from ... where. On the other
hand, the model allows for an explicit representation of graphs by
partitioning object classes into simple classes, link classes, and path
classes whose objects can be viewed as nodes, edges, and explicitly
stored paths of a graph (which is the whole database instance). For
querying graphs, the derive statement has an extended meaning in that
it allows one to refer to subgraphs of the database graph. A powerful
rewrite operation is offered for the manipulation of heterogeneous
sequences of objects which often occur as a result of