Readings in Database Systems
Morgan Kaufmann Publishers, 1994 - Science - 970 pages
From the Preface: "Much has happened in database research and development since the first edition of this book in 1988 (the "Red Book"). Many of the professionals and students who used it have asked for a revised collection reflecting the current state of the field... After carefully reevaluating the available research literature and incorporating many helpful comments from readers and instructors, the result is this second edition of Readings in Database Systems."
Readings in Database Systems, 2d Edition is a comprehensive collection of essential articles illustrating the breadth and depth of database technology. Dr. Stonebraker is a recognized authority in database research and commercial database applications. The selection of contributions, combined with his thoughtful and provocative Introductions, offers insights to the current state of the art in database systems and their potential for future development.
The many new papers in this edition reflect areas where there has been substantial activity in the last few years. These areas include: active databases, parallelism, transaction management, and storage systems. Fifty-nine key articles are included in this volume, 32 of which are new to this edition. Many of the articles are from unavailable or limited circulation journals or technical reports. Like its acclaimed predecessor, the second edition has been thoroughly reviewed to ensure a selection that represents the breadth of databases today.
This book will provide a comprehensive introduction to students and professionals wanting an overview of database systems, and a deeper understanding to anyone already active in the field who wants to be current on significant research themes and developments.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A New Tool for File and Table Addressing
A Dynamic Index Structure for Spatial Searching
38 other sections not shown
Other editions - View all
action active algorithm allows application assume attribute benchmark blocks bucket buffer cache called changes commit complete Computer concurrency condition consider consistency contains copy cost created data base database Database Systems DBMS defined deleted described discussed disk distributed effect efficient entries event example execution existing failure field Figure function given grid hashing hB-tree Hence implementation indices insert join language lock means memory methods node objects operations optimizer path performance possible present problem Proc query records recovery redo reference relation request retrieve rule scan segment shows single space specified split step storage stored structure tion transaction tree tuples undo update utilization write written