Table of contents

  1. Front Matter
  2. Pages 1-11
  3. Pages 13-34
  4. Pages 35-57
  5. Pages 115-120
  6. Back Matter

About this book

Introduction

Parallel execution of SQL queries against large databases offers a solution to the problem of reducing query response. This book addresses the related optimization problem: Given an SQL query, find the plan that delivers the result in minimal time. The author presents and analyzes new theoretical findings and efficient algorithms pertaining to parallel operation at a practical level of granularity relevant to database system operations. The optimization results balance the advantages and costs of parallel execution of SQL queries. The techniques presented are applicable to modern system configurations, where computation is performed on pipelining-capable workstations operating in parallel, and can be used to construct SQL compilers able to exploit parallel machines effectively.

Keywords

SQL Scheduling algorithms compiler database database system optimization time

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0020710
  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-62065-5
  • Online ISBN 978-3-540-49638-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Pharma
Chemical Manufacturing
Biotechnology
Electronics
Telecommunications
Consumer Packaged Goods
Energy, Utilities & Environment