Access path selection in a relational database management system

Mar 30, 2017 · Madrid, Spain

Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price. [Access path selection in a relational database management system. SIGMOD, 1979.](

Databases are one of the backbones of our applications, we use them daily but  probably we didn't stop to analyze how things works under the hood. We take  for granted that given some declarative query (i.e with SQL), the RDBMS will try to be as efficient as possible. This enables data-independent query processing,  back in the day with systems like [IMS](  queries were done using low level information, so knowledge about the underlying data structures was needed to be able to perform efficient queries. The presented paper is the foundation for query optimization field, it decomposes the problem into three distinct subproblems:

- Cost estimation
- Relational equivalences
- Cost-based search

We'll explore how solving those sub-problems databases are able to calculate "good-enough" query plans.

Event organizers
  • Papers We Love Madrid

    Madrid chapter of Papers We Love What was the last paper within the realm of computing you read? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research publication with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper. Otherwise, just come, listen, learn, and discuss. We'll be using papers-we-love's curated repository . Please contribute by

    Recent Events

Are you organizing Access path selection in a relational database management system?

Claim the event and start manage its content.

I am the organizer

based on 0 reviews