๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Relational database index design and the optimizers: DB2, Oracle, SQL server et al

โœ Scribed by Tapio Lahdenmaki, Mike Leach


Publisher
Wiley-Interscience
Year
2005
Tongue
English
Leaves
327
Edition
1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Improve the performance of relational databases with indexes designed for today's hardwareOver the last few years, hardware and software have advanced beyond all recognition, so it's hardly surprising that relational database performance now receives much less attention. Unfortunately, the reality is that the improved hardware hasn't kept pace with the ever-increasing quantity of data processed today. Although disk packing densities have increased enormously, making storage costs extremely low and sequential read very fast, random reads are still painfully slow. Many of the old design recommendations are therefore no longer valid-the optimal point of indexing has come a long way. Consequently many of the old problems haven't actually gone away-they have simply changed their appearance.This book provides an easy but effective approach to the design of indexes and tables. Using lots of examples and case studies, the authors describe how the DB2, Oracle, and SQL Server optimizers determine how to access data, and how CPU and response times for the resulting access paths can be quickly estimated. This enables comparisons to be made of the various designs, and helps you choose available choices for the most appropriate design.This book is intended for anyone who wants to understand the issues of SQL performance or how to design tables and indexes effectively. With this title, readers with many years of experience of relational systems will be able to better grasp the implications that have been brought into play by the introduction of new hardware.


๐Ÿ“œ SIMILAR VOLUMES


Relational Database Index Design and the
โœ Tapio Lahdenmaki, Michael Leach(auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐ŸŒ English

Improve the performance of relational databases with indexes designed for today's hardware<br><br> Over the last few years, hardware and software have advanced beyond all recognition, so it's hardly surprising that relational database performance now receives much less attention. Unfortunately, the

Pro SQL Server 2005 Database Design and
โœ Louis Davidson, Kevin Kline, Kurt Windisch ๐Ÿ“‚ Library ๐Ÿ“… 2006 ๐Ÿ› Apress ๐ŸŒ English

Pro SQL Server 2005 Database Design and Optimization will teach you effective strategies for designing proper databases. It covers everything from how to gather business requirements to logical data modeling and normalization. It then shows you how to implement your design on SQL Server 2005.The aut

Pro SQL Server Relational Database Desig
โœ Louis Davidson; Jessica Moss ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Apress ๐ŸŒ English

Learn effective and scalable database design techniques in a SQL Server 2016 and higher environment. This book is revised to cover in-memory online transaction processing, temporal data storage, row-level security, durability enhancements, and other design-related features that are new or changed in

Pro SQL Server Relational Database Desig
โœ Louis Davidson, Jessica Moss (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Apress ๐ŸŒ English

<p><p>Learn effective and scalable database design techniques in a SQL Server 2016 and higher environment. This book is revised to cover in-memory online transaction processing, temporal data storage, row-level security, durability enhancements, and other design-related features that are new or chan

Pro SQL Server 2008 Relational Database
โœ Louis Davidson, Kevin Kline, Scott Klein, Kurt Windisch ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Apress ๐ŸŒ English

I had not read a book covering database design since Uni, so this was a really good refresher. This was not a dull read - with a very good balance between technical detail and real world scenarios.The author's experience comes through very well, lending credibility to the examples in the text. This