vldb_1995_elementary.txt

利用lwp：：get写的

However RAID5 suffers a performance penalty during block updates.
In order to overcome this problem, the use of dynamic striping was proposed.
This method buffers a number of updates, generates a new stripe composed of newly updated blocks, and then writes the new full stripe back to disks.
In this paper, we examine the effect of access locality on the dynamic stripingmethod.
To further improve performance in such an environment, we introduce the dynamic clustering policy for hot blocks.
Performance analysis with various access localities shows that this methodhas higher performance than ordinary methods.
Performance is also examined for localities that change over time.
The dynamic clustering of hot blocks follows locality transitions, showingthat under dynamic conditions performance improves.</abstract></paper><paper><title>A Performance Study of Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System.</title><author><AuthorName>Kun-Lung Wu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philip S. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jen-Yao Chung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>James Z. Teng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>The Input/Output Complexity of Sorting and Related Problems.</name><name>Staggered Striping in Multimedia Information Systems.</name><name>An Evaluation of Buffer Management Strategies for Relational Database Systems.</name><name>Parallel Algorithms for the Execution of Relational Database Operations.</name><name>Predictive Load Control for Flexible Buffer Allocation.</name><name>System Issues in Parallel Sorting for Database Systems.</name><name>The I/O Performance of Multiway Mergesort and Tag Sort.</name><name>The Art of Computer Programming, Volume III: Sorting and Searching.
 Addison-Wesley 1973, ISBN 0-201-03803-X</name><name>Flexible Buffer Allocation Based on Marginal Gains.</name><name>A Case for Redundant Arrays of Inexpensive Disks (RAID).</name><name>Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis.</name><name>An Evaluation of Multiple-Disk I/O Systems.</name><name>Merging Sorted Runs Using Large Main Memory.</name><name>Disk Striping.</name><name>Buffer Management in Relational Database Systems.</name><name>Managing IBM Database 2 Buffers to Maximize Performance.</name><name>The Placement Optimization Program: A Practical Solution to the Disk File Assignment Problem.</name><name>Performance Comparison of Thrashing Control Policies for Concurrent Mergesorts with Parallel Prefetching.</name><name>Data Placement and Buffer Management for Concurrent Mergesorts with Parallel Prefetching.</name><name>Buffer Management Based on Return on Consumption in a Multi-Query Environment.</name></citation><abstract>This paper studies the impacts of work- file disk allocation and data striping on the performance of concurrent mergesorts in a multiprocessor database system.
We examine through detailed simulations an approach where workfile disks are logically partitioned into equal-sized groups and an arriving sort job selects one group to do the mergesort.
The results show that (1) without data striping, the best performance is achieved by using the entire workfile disks as a single partition if there are abundant workfile disks (or system workload is light); (2) however, ifthere are limited workfile disks (or system workload is heavy), the workfile disks should be partitioned into multiple groups and the optimal partition size is workload dependent; (3) data striping is beneficial only if the striping unit size is properly chosen.</abstract></paper><paper><title>Declustering Databases on Heterogeneous Disk Systems.</title><author><AuthorName>Ling Tony Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Doron Rotem</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sridhar Seshadri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Declustering Objects for Visualization.</name><name>Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines.</name><name>Declustering Using Fractals.</name><name>Disk Allocation Methods Using Error Correcting Codes.</name><name>Object Placement in Parallel Hypermedia Systems.</name><name>Continuous Retrieval of Multimedia Data Using Parallelism.</name><name></name></citation><abstract>Declustering is a well known strategy to achieve maximum I/O parallelism in multi- disk systems. Many declustering methods have been proposed for symmetrical disk systems,i.e., multi-disk systems in which all disks have the same speed and capacity. This work deals with the problem of adapting such declustering methods to work in heterogeneous environments. In such environments there are many types of disks and servers with a large range of speeds and capacities. We deal first with the case of perfectly declustered queries, i.e., queries which retrieve a fixed proportion of the answer from each disk.
We propose an algorithm which determines the fraction of the dataset whichmust be loaded on each disk. The algorithm may be tailored to find disk loading for minimal response time for a given database size, or to compute a system profile showing the optimal loading of the disks for all possible ranges of database sizes. The methods proposed here are general and can be used in conjunction with most known symmetric declustering methods.</abstract></paper><paper><title>Value-cognizant Speculative Concurrency Control.</title><author><AuthorName>Azer Bestavros</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Spyridon Braoudakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Using Delayed Commitment in Locking Protocols for Real-Time Databases.</name><name>Concurrency Control Performance Modeling: Alternatives and Implications.</name><name>Scheduling Real-time Transactions: a Performance Evaluation.</name><name>Concurrent Certifications by Intervals of Timestamps in Distributed Database Systems.</name><name>Time-Critical Database Scheduling: A Framework For Integrating Real-Time Scheduling and Concurrency Control.</name><name>The Notions of Consistency and Predicate Locks in a Database System.</name><name>On Being Optimistic about Real-Time Constraints.</name><name>Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes.</name><name>Triggered Real-Time Databases with Consistency Constraints.</name><name>On Optimistic Methods for Concurrency Control.</name><name>Optimistic versus pessimistic concurrency control mechanisms in database management systems.</name><name>Design of Concurrency Control Protocols for Transaction Processing Systems.
Ph.D. thesis,  Carnegie Mellon University 1982</name><name>Issues and Approaches to Design of Real-Time Database Systems.</name><name>An Integrated Real-Time Locking Protocol.</name><name>Concurrency Control for Distributed Real-Time Databases.</name><name>A Real-Time Locking Protocol.</name><name>On Real-Time Transactions.</name></citation><abstract>We describe SCC-kS, a Speculative Concurrency Control (SCC) algorithm thatallows a DBMS to use efficiently the extra computing resources available in the system to increase the likelihood of timely commitment of transactions.
Using SCC-kS, up to k shadow transactions execute speculatively on behalf of a given uncommitted transaction so as to protect against the hazards of blockages and restarts.
SCC-kS allows the system to scale the level of speculation that each transaction is allowed to perform, thus providing a straightforward mechanism of trading resources for timeliness.
Also, we describe SCC-DC, a value-cognizant SCC protocol that utilizes deadline and criticalness information to improve timeliness through the controlled deferment of transaction commitments.
We present simulation results that quantify the performance gains of our protocols compared to other widely used concurrency control protocols for real-time databases.</abstract></paper><paper><title>Index Concurrency Control in Firm Real-Time Database Systems.</title><author><AuthorName>Brajesh Goyal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jayant R. Haritsa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Seshadri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>V. Srinivasan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Using Delayed Commitment in Locking Protocols for Real-Time Databases.</name><name>Scheduling Real-Time Transactions: A Performance Evaluation.</name><name>Concurrency of Operations on  B-Trees.</name><name>The Ubiquitous B-Tree.</name><name>Notes on Data Base Operating Systems.</name><name>Real-Time Transaction Scheduling: A Cost Conscious Approach.</name><name>A Framework for the Performance Analysis of Concurrent B-tree Algorithms.</name><name>A New Method for Concurrency in B-Trees.</name><name>A Symmetric Concurrent B-Tree Algorithm.</name><name>Access Method Concurrency with Recovery.</name><name>Efficient Locking for Concurrent Operations on  B-Trees.</name><name>ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes.</name><name>Concurrency Control in B+-Trees Databases Using Preparatory Operations.</name><name>ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging.</name><name>Managing Memory for Real-Time Queries.</name><name>Concurrent Operations on B*-Trees with Overtaking.</name><name>Performance of B-Tree Concurrency Algorithms.</name><name>Concurrent Search Structure Algorithms.</name><name>Priority Inheritance Protocols: An Approach to Real-Time Synchronization.</name><name>The C++ Programming Language, First Edition.
 Addison-Wesley 1986, ISBN 0-201-12078-X</name></citation><abstract>Although real-time transaction concurrency control has been extensively studied, the design and evaluation of real-time index concurrency control algorithms has not yet been considered.
In this paper, we develop real-time variants of several classical B-tree concurrency control algorithms and compare their performance using a detailed simulation model of a firm-deadline real-time database system.
The experimental results show that the performance characteristics of the real-time version of an index concurrency control algorithm could be significantly different from the performance of the same algorithm in a conventional (non-real-time) database system.
In particular, B-link algorithms, which are reputed to provide the best overallperformance in conventional database systems, perform poorly under heavy real-time loads.
We present and evaluate a simple load-adaptive variant of the B-link algorithm called LAB-link, which provides the best performance over the entire loading range for a variety of real- time transaction workloads.</abstract></paper><paper><title>A Data Transformation System for Biological Data Sources.</title><author><AuthorName>Peter Buneman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Susan B. Davidson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kyle Hart</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>G. Christian Overton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Limsoon Wong</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><name>IFO: A Formal Semantic Database Model.</name><name>A Comparative Analysis of Methodologies for Database Schema Integration.</name><name>Structural Recursion as a Query Language.</name><name>Naturally Embedded Query Languages.</name><name>Comprehension Syntax.</name><name>A Semantics of Multiple Inheritance.</name><name>Extendible Hashing - A Fast Access Method for Dynamic Files.</name><name>Towards an Effective Calculus for Object Query Languages.</name><name>Requirements for a Deductive Query Language in a Genome-Mapping Database.</name><name>Optimization of Methods in a Navigational Query Language.</name><name>A New Way to Compute the Product and Join of Relations.</name><name>Multidatabase Interoperability.</name><name>A Call to Order.</name><name>Hash-Partitioned Join Method Using Dynamic Destaging Strategy.</name><name>Integrating User Views in Database Design.</name><name>Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference.</name><name>Object Exchange Across Heterogeneous Information Sources.</name><name>Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases.</name><name>A Tool for Integrating Conceptual Schemas and User Views.</name><name>Comprehensions, a Query Notation for DBPLs.</name><name>Comprehending Monads.</name><name>An Introduction to Remy's Fast Polymorphic Record Projection.</name><name>Querying Nested Collections.
Ph.D. thesis,  Univ. Pennsylvania 1994</name><name>On Wrapping Query Languages and Efficient XML Integration.</name></citation><abstract>Scientific data of importance to biologists in the Human Genome Project resides not only in conventional databases, but in structured files maintained in a number of different formats (e.g. ASN.1 and ACE) as well as sequence analysis packages (e.g. BLAST and FASTA).
These formats and packages contain a number of data types not found in conventional databases, such as lists and variants, and may be deeply nested.
We present in this paper techniques for querying and transforming such data, and illustrate their use in a prototype system developed in conjunctionwith the Human Genome Center for Chromosome 22.
We also describe optimizations performed by the system, a crucial issue for bulk data.</abstract></paper><paper><title>Schema and Database Evolution in the O2 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><author><AuthorName>Guy Ferran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jo{\"e}lle Madec</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1995</year><conference>International Conference on Very Large Data Bases</conference><citation><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 oo7 Benchmark.</name><name>The Design of an Integrity Consistency Checker (ICC) for an Object-Oriented Database System.</name><name>Correctness of Lazy Database Updates for Object Database Systems.</name><name>Implementing Lazy Database Updates for an Object Database System.</name><name>Beyond Schema Evolution to Database Reorganization.</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>When the schema of an object-oriented database system is modified, the database needs to be changed in such a way that the schema and the database remain consistent with each other.
This paper describes the algorithm implemented in the new forthcoming release of the 02 object database for automatically bringingthe database to a consistent state after a schema update has been performed.
The algorithm, which uses a deferred strategy to update the database, is arevised and extended version of the screening algorithm first sketched in
[7].</abstract></paper><paper><title>Procedures in Object-Oriented Query Languages.</title><author><AuthorName>Kazimierz Subieta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yahiko Kambayashi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jacek Leszczylowski</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 (Release 1.1).</name><name>Viewers: A Data-World Analogue of Procedure Calls.</name><name>A Stack-Based Approach to Query Languages.</name></citation><abstract>We follow the stack-based approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases.