vldb_1995_elementary.txt

利用lwp：：get写的

<proceedings><paper><title>The Double Life of the Transaction Abstraction: Fundamental Principle and Evolving System Concept.</title><author><AuthorName>Henry F. Korth</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>A model for concurrency in nested transactions systems.</name><name>ASSET: A System for Supporting Extended Transactions.</name><name>Timestamp-Based Algorithms for Concurrency Control in Distributed Database Systems.</name><name>Overview of Multidatabase Transaction Management.</name><name>Concurrency Control and Recovery in Database Systems.
 Addison-Wesley 1987, ISBN 0-201-10715-5</name><name>A Model of CAD Transactions.</name><name>Semantics-Based Concurrency Control: Beyond Commutativity.</name><name>Concurrency Control in a System for Distributed Databases (SDD-1).</name><name>A History and Evaluation of System R.</name><name>The Notions of Consistency and Predicate Locks in a Database System.</name><name>Database Transaction Models for Advanced Applications.</name><name>Using Semantic Knowledge for Transaction Processing in Distributed Database.</name><name>Sagas.</name><name>Transaction Processing: Concepts and Techniques.</name><name>Notes on Data Base Operating Systems.</name><name>The Transaction Concept: Virtues and Limitations (Invited Paper).</name><name>A Transaction Mechanism for Engineering Design Databases.</name><name>Locking Primitives in a Database System.</name><name>On Optimistic Methods for Concurrency Control.</name><name>Formal Aspects of Concurrency Control in Long-Duration Transaction Systems Using the NT/PV Model.</name><name>A Theory of Relaxed Atomicity (Extended Abstract).</name><name>ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging.</name><name>Principles of Distributed Database Systems.
 Prentice-Hall 1991, ISBN 0-13-715681-2</name><name>The serializability of concurrent database updates.</name><name>Implementing Atomic Actions on Decentralized Data.</name><name>Consistency in Hierarchical Database Systems.</name><name>Commutativity-Based Concurrency Control for Abstract Data Types.</name><name>A Theory of Safe Locking Policies in Database Systems.</name></citation><abstract>The transaction concept in computing goes back to the early days of computerized data processing.
It has developed and evolved over the years both in terms of formal theoryand practical application.
This evolutionary process has been driven in large part by applications that require transaction-like properties.
Newly emerging applications include several that involve people in a time-dependent role.
The new forms of human involvement in transaction processing required by these applications are generating new systems-level challenges.
Likewise, these needs present challenges and opportunities from a theoretical standpoint.
This talk reviews the history of synergy between theory and practice in the area of transaction processing, and considers currently emerging needs from that perspective.</abstract></paper><paper><title>Document Management as a Database Problem.</title><author><AuthorName>Rudolf Bayer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Database Research at IPSI.</name><name>MOOD: A Knowledgebase System with Objectoriented Deduction.</name><name>Office Work Coordination Using a Distributed Database System.</name><name>OMNIS/Myriad: Elektronische Verwaltung und Publikation von multimedialen Dokumenten.</name><name>Semantic Hypermedia Retrieval in Digital Libraries.</name><name></name></citation><abstract>Document management has many aspects, among them acquisition, storage, retrieval, presentation and processing of documents (work flow).
These aspects will be covered and illustrated by examples from the librarysystem OMNIS/Myriad.</abstract></paper><paper><title>From VLDB to VMLDB (Very MANY Large Data Bases): Dealing with Large-Scale Semantic Heterogenity.</title><author><AuthorName>Stuart E. Madnick</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>The Context Interchange Network Prototype.</name><name>Context Interchange: Overcoming the Challenges of Large-Scale Interoperable Database Systems in a Dynamic Environment.</name><name>The Composite Information System Laboratory (CISL) Project at MIT.</name><name>A Metadata Approach to Resolving Semantic Conflicts.</name><name>Context Interchange: Sharing the Meaning of Data.</name><name>A Framework for Analysis of Data Quality Research.</name><name>A Polygen Model for Heterogeneous Database Systems: The Source Tagging Perspective.</name></citation><abstract>The popularity of distributed computing environments and the growth of the"Information SuperHighway" have dramatically increased the number of data bases available for use.
Unfortunately, there are significant challenges to be overcome.
One particular problem is context interchange, whereby each source of information and potential receiver of that information may operate witha different context, leading to large- scale semantic heterogeneity.
A context is the collection of implicit assumptions about the context definition (i.e., meaning) and context characteristics (i.e., quality) of the information.
This paper describes various forms of context challenges and examples of potential context mediation services, such as data semantics acquisition, data quality attributes, and evolving semantics and quality, that can mitigate the problem.</abstract></paper><paper><title>A Performance Evaluation of OID Mapping Techniques.</title><author><AuthorName>Andr{\'e} Eickler</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Carsten Andreas Gerlhof</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Donald Kossmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Filtered Hashing.</name><name>Object Identity as a Query Language Primitive.</name><name>Organization and Maintenance of Large Ordered Indices.</name><name>Persistent Object Stores: An Implementation Technique.</name><name>Shoring Up Persistent Applications.</name><name>Indexed Extendible Hashing.</name><name>Extensible Buffer Management of Indexes.</name><name>The Ubiquitous B-Tree.</name><name>Implementing Persistent Object Bases, Principles and Practice, Proceedings of the Fourth International Workshop on Persistent Objects, 23-27 September 1990, Martha's Vineyard, MA, USA.
 Morgan Kaufmann 1990, ISBN 1-55860-168-6</name><name>Dynamic Hashing Schemes.</name><name>Extendible Hashing - A Fast Access Method for Dynamic Files.</name><name>Partition-Based Clustering in Object Bases: From Theory to Practice.</name><name>Transaction Processing: Concepts and Techniques.</name><name>A Shared, Segmented Memory System for an Object-Oriented Database.</name><name>Object Identity.</name><name>Object-Oriented Database Management: Applications in Engineering and Computer Science.</name><name>Conch: Experimenting with Enhanced Name Management for Persistent Object Systems.</name><name>Dynamic Hash Tables.</name><name>Linear Hashing with Separators - A Dynamic Hashing Scheme Achieving One-Access Retrieval.</name><name>Linear Hashing: A New Tool for File and Table Addressing.</name><name>Trie Hashing.</name><name>An Overview of the Spring System.</name><name>ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging.</name><name>ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging.</name><name>ARIES/LHS: A Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators.</name><name>Linearizing the Directory Growth in Order Preserving Extendible Hashing.</name><name>An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System.</name><name>Identifiers (Naming) in Distributed Systems.</name><name>Distribution and Persistence in the Open Object-Oriented Database System.</name><name>An Object-Based Memory Architecture.</name></citation><abstract>In this paper, three techniques to implement logical OIDs are
thoroughly evaluated: hashing, B-trees and a technique called direct
mapping. Among these three techniques, direct mapping is the most
robust; it induces at most one page fault to map an OID, and it scales
very well to large, rapidly growing databases. Furthermore, the
clustering of handles that are used to map logical OIDs is studied. In
particular, the performance of B-trees and direct mapping can improve
significantly if the handles of objects that are frequently accessed
by the same methods are clustered. For direct mapping, two placement
policies are compared: linear and matrix clustering.</abstract></paper><paper><title>OODB Bulk Loading Revisited: The Partitioned-List Approach.</title><author><AuthorName>Janet L. Wiener</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey F. Naughton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>The Object Database Standard: ODMG-93.</name><name>Shoring Up Persistent Applications.</name><name>Computational Proxies: Modeling Scientific Applications in Object Databases.</name><name>The Story of O2.</name><name>Application of Hash to Data Base Machine and Its Architecture.</name><name>UniSQL/X Unified Relational and Object-Oriented Database System.</name><name>The ObjectStore Database System.</name><name>Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates.</name><name>An Efficient and Flexible Method for Archiving a Data Base.</name><name>A Survey of DBMS Research Issues in Supporting Very Large Tables.</name><name>IBM's Relational DBMS Products: Features and Technologies.</name><name>Identification of Database Objects by Key.</name><name>Join Processing in Database Systems with Large Main Memories.</name><name>The Montage Extensible DataBlade Achitecture.</name><name>NCR 3700 - The Next-Generation Industrial Database Computer.</name><name>Bulk Loading into an OODB: A Performance Study.</name></citation><abstract>Object-oriented and object-relational databases (OODB) need to be able to load the vast quantities of data that OODB users bring to them.
Loading OODB data is significantly more complicated than loading relational data due to the presence of relationships, or references, in the data; the presence of these relationships means that naive loading algorithms areslow to the point of being unusable.
In our previous work, we presented the late-invsort algorithm, which performed significantly better than naive algorithms on all the data sets we tested.
Unfortunately, further experimentation with the late-invsort algorithm revealed that for large data sets (ones in which a critical data structure ofthe load algorithm does not fit in memory), the performance of late-invsort rapidly degrades to where it, too, is unusable.
In this paper we propose a new algorithm, the partitioned-list algorithm, whose performance almost matches that of late-invsort for smaller data sets but does not degrade for large data sets.
We present a performance study of an implementation within the Shore persistentobject repository showing that the partitioned-list algorithm is at least an order of magnitude better than previous algorithms on large data sets.