Ruby is known for its elegant and expressive syntax, making it one of the most enjoyable programming languages to work with. In this blog post, we will explore some interesting aspects of Ruby, including syntax sugar, operator methods, useful array operations, and handy built-in methods.
Ruby Syntax Sugar
Ruby provides several shorthand notations that enhance code readability and reduce verbosity. Let’s explore some useful syntax sugar techniques.
Shorthand for Array and Symbol Arrays
Instead of manually writing arrays of strings or symbols, Ruby provides %w and %i shortcuts.
words = %w[one two three] # => ["one", "two", "three"]
symbols = %i[one two three] # => [:one, :two, :three]
Many mathematical and array operations in Ruby are actually method calls, thanks to Ruby’s message-passing model.
puts 1.+(2) # => 3 (Same as 1 + 2)
Array Indexing and Append Operations
words = %w[zero one two three four]
puts words.[](2) # => "two" (Equivalent to words[2])
words.<<('five') # => ["zero", "one", "two", "three", "four", "five"] (Equivalent to words << "five")
Avoiding Dot Notation with Operators
# Bad practice
num = 10
puts num.+(5) # Avoid this syntax
# Good practice
puts num + 5 # Preferred
Using a linter like rubocop can help enforce best practices in Ruby code.
none? Method in Ruby Arrays
The none? method checks if none of the elements in an array satisfy a given condition.
numbers = [1, 2, 3, 4, 5]
puts numbers.none? { |n| n > 10 } # => true (None are greater than 10)
puts numbers.none?(&:odd?) # => false (Some numbers are odd)
This method is useful for quickly asserting that an array does not contain specific values.
Exponent Operator (**) and XOR Operator (^)
Exponentiation
Ruby uses ** for exponentiation instead of ^ (which performs a bitwise XOR operation).
puts 2 ** 3 # => 8 (2 raised to the power of 3)
puts 10 ** 0.5 # => 3.162277660168379 (Square root of 10)
XOR Operator
In Ruby, ^ is used for bitwise XOR operations, which differ from exponentiation.
This is particularly useful for cleaning up user input or text from external sources.
Conclusion
Ruby’s syntax sugar, operator methods, and built-in methods make code more readable, expressive, and powerful. By leveraging these features effectively, you can write clean, efficient, and maintainable Ruby code.
Ruby on Rails is known for its developer-friendly syntax and expressive code structure. One of the key reasons behind this elegance is its use of Domain-Specific Languages (DSLs). DSLs make Rails configurations, routes, and testing more intuitive by allowing developers to write code that reads like natural language.
In this blog post, we’ll explore what DSLs are, how Rails implements them, and why they make development in Rails both powerful and enjoyable.
What is a DSL?
A Domain-Specific Language (DSL) is a specialized language designed to solve problems in a specific domain. Unlike general-purpose languages (like Ruby or Java), a DSL provides a more concise and readable syntax for a particular task.
Two types of DSLs exist:
Internal DSLs: Written using an existing programming language’s syntax (e.g., Rails DSLs in Ruby).
External DSLs: Separate from the host language and require a custom parser (e.g., SQL, Regular Expressions).
Rails uses Internal DSLs to simplify web development. Let’s explore some core DSLs in Rails and how they work under the hood.
1. Routes in Rails: A Classic Example of DSL
In config/routes.rb, Rails provides a DSL to define application routes in a clear and structured way.
Example:
Rails.application.routes.draw do
resources :users do
resources :posts
end
get '/about', to: 'pages#about'
root 'home#index'
end
How Does This Work?
resources :users automatically generates RESTful routes for UsersController.
get '/about', to: 'pages#about' maps a GET request to the about action in PagesController.
root 'home#index' sets the default landing page.
Why Use a DSL for Routes?
Concise & Readable: Avoids manually defining each route.
Expressive Syntax: Reads like a structured list of instructions.
Rails extends DSL capabilities with ActiveSupport::Concern, which allows modular mixins in models and controllers.
Example:
module Trackable
extend ActiveSupport::Concern
included do
before_save :track_changes
end
private
def track_changes
puts "Tracking changes!"
end
end
class User < ApplicationRecord
include Trackable
end
How This Works:
included do ... end executes code when the module is included in a class.
before_save :track_changes hooks into the Rails lifecycle to run before saving a record.
Why a DSL for Mixins?
Encapsulation: Keeps related logic together.
Reusability: Can be included in multiple models.
Cleaner Code: Removes redundant callbacks in models.
Conclusion: Why Rails Embraces DSLs
DSLs in Rails make the framework expressive, flexible, and developer-friendly. They provide:
By leveraging DSLs, Rails makes web development intuitive, allowing developers to focus on building great applications rather than writing repetitive code.
So next time you’re defining routes, configuring settings, or writing tests in Rails—remember, you’re using DSLs that make your life easier!
Rails 8.x has arrived, bringing exciting new features and enhancements to improve productivity, performance, and ease of development. From built-in authentication to real-time WebSocket updates, this latest version of Rails continues its commitment to being a powerful and developer-friendly framework.
Let’s dive into some of the most significant features and improvements introduced in Rails 8.
Rails 8 Features & Enhancements
1. Modern JavaScript with Importmaps & Hotwire
Rails 8 eliminates the need for Webpack and Node.js, allowing developers to manage JavaScript dependencies more efficiently. Importmaps simplify dependency management by fetching JavaScript packages directly and caching them locally, removing runtime dependencies.
Key Benefits:
Faster page loads and reduced complexity
No need for Node.js or Webpack
Dependencies are cached locally and loaded efficiently
Example: Pinning a Package
bin/importmap pin local-time
This command fetches the package from npm and stores it locally for future use.
Hotwire Integration
Hotwire enables dynamic page updates without requiring heavy JavaScript frameworks. Rails 8 fully integrates Turbo and Stimulus, making frontend interactivity more seamless.
Importing Dependencies in application.js:
import "trix";
With this setup, developers can create reactive UI elements with minimal JavaScript.
2. Real-Time WebSockets with Action Cable & Turbo Streams
Rails 8 enhances real-time functionality with Action Cable and Turbo Streams, allowing WebSocket-based updates across multiple pages without additional JavaScript libraries.
Setting Up Turbo Streams in Views:
<%= turbo_stream_from @object %>
This creates a WebSocket channel tied to the object.
Any changes to the object will be instantly reflected across all connected clients.
Why This Matters:
No need for third-party WebSocket npm packages
Real-time updates are built into Rails
Simplifies building interactive applications
3. Rich Text with ActionText
Rails 8 continues to support ActionText, making it easy to handle rich text content within models and views.
Model Level Implementation:
has_rich_text :body
This enables rich text storage and formatting for the body attribute of a model.
View Implementation:
<%= form.rich_text_area :body %>
This adds a full-featured WYSIWYG text editor to the form, allowing users to create and edit rich text content seamlessly.
Displaying Updated Timestamps:
<%= time_tag post.updated_at %>
This helper formats timestamps cleanly, improving date and time representation in views.
4. Deployment with Kamal – Simpler & Faster
Rails 8 introduces Kamal, a modern deployment tool that simplifies remote deployment by leveraging Docker containers.
Deployment Steps:
Setup Remote Serverkamal setup
Installs Docker (if missing) and configures the server.
Deploy the Applicationkamal deploy
Builds and ships a Docker container using Rails’ default Dockerfile.
File Uploads with Active Storage
By default, Kamal stores uploaded files in Docker volumes, but this can be customized based on specific deployment needs.
5. Built-in Authentication – No Devise Needed
Rails 8 introduces native authentication, reducing reliance on third-party gems like Devise. This built-in system manages password encryption, user sessions, and password resets while keeping signup flows flexible.
Ensure manifest and service-worker routes are enabled.
Verify PWA files: pwa/manifest.json.erb and pwa/service-worker.js.
Deploy and restart the application to see the Install button in the browser.
Final Thoughts
Rails 8 is packed with developer-friendly features that improve security, real-time updates, and deployment workflows. With Hotwire, Kamal, and native authentication, it’s clear that Rails is evolving to reduce dependencies while enhancing performance.
Are you excited about Rails 8? Let me know your thoughts and experiences in the comments below!
Ruby on Rails is a powerful framework for building web applications. If you’re setting up your development environment on macOS in 2025, this guide will walk you through installing Ruby 3.4, Rails 8, and a best IDE for development.
1. Installing Ruby and Rails
“While macOS comes with Ruby pre-installed, it’s often outdated and can’t be upgraded easily. Using a version manager like Mise allows you to install the latest Ruby version, switch between versions, and upgrade as needed.” – Rails guides
Install Dependencies
Run the following command to install essential dependencies (takes time):
zsh completions have been installed to: /opt/homebrew/share/zsh/site-functions ==> Summary 🍺 /opt/homebrew/Cellar/rust/1.84.1: 3,566 files, 321.3MB ==> Running brew cleanup rust… ==> openssl@3 A CA file has been bootstrapped using certificates from the system keychain. To add additional certificates, place .pem files in /opt/homebrew/etc/openssl@3/certs
and run /opt/homebrew/opt/openssl@3/bin/c_rehash ==> rust zsh completions have been installed to: /opt/homebrew/share/zsh/site-functions
By following this guide, you’ve successfully set up a robust Ruby on Rails development environment on macOS. With Mise for version management, Rails installed, and VS Code configured with essential extensions, you’re ready to start building Ruby on Rails applications.
When a client request comes into a Rails application, it doesn’t always go directly to the MVC (Model-View-Controller) layer. Instead, it might first pass through middleware, which handles tasks such as authentication, logging, and static asset management.
Rails uses middleware like ActionDispatch::Static to efficiently serve static assets before they even reach the main application.
ActiveRecord: Object-relational mapping (ORM) system for database interactions.
Action Pack: Handles the controller and view layers.
Active Support: A collection of utility classes and standard library extensions.
Action Mailer: A framework for designing email services.
The Role of Browsers in Asset Management
Web browsers cache static assets to improve performance. The caching strategy varies based on asset types:
Images: Rarely change, so they are aggressively cached.
JavaScript and CSS files: Frequently updated, requiring cache-busting mechanisms.
The Era of Sprockets
Historically, Rails used Sprockets as its default asset pipeline. Sprockets provided:
Conversion of CoffeeScript to JavaScript and SCSS to CSS.
Minification and bundling of assets into fewer files.
Digest-based caching to ensure updated assets were fetched when changed.
The Rise of JavaScript & The Shift Towards Webpack
The release of ES6 (2015-2016) was a turning point for JavaScript, fueling the rise of Single Page Applications (SPAs). This marked a shift from traditional asset management:
Sprockets was effective but became complex and difficult to configure for modern JS frameworks.
Projects started including package.json at the root, indicating JavaScript dependency management.
Webpack emerged as the go-to tool for handling JavaScript, offering features like tree-shaking, hot module replacement, and modern JavaScript syntax support.
The Landscape in 2024: A More Simplified Approach
Recent advancements in web technology have drastically simplified asset management:
ES6 Native Support in All Major Browsers
No need for transpilation of modern JavaScript.
CSS Advancements
Features like variables and nesting eliminate the need for preprocessors like SASS.
HTTP/2 and Multiplexing
Enables parallel loading of multiple assets over a single connection, reducing dependency on bundling strategies.
Enter Propshaft: The Modern Asset Pipeline
Propshaft is the new asset management solution introduced in Rails, replacing Sprockets for simpler and faster asset handling. Key benefits include:
Digest-based file stamping for effective cache busting.
Direct and predictable mapping of assets without complex processing.
Better integration with HTTP/2 for efficient asset delivery.
Rails 8 Precompile Uses Propshaft
What is Precompile? A Reminder
Precompilation hashes all file names and places them in the public/ folder, making them accessible to the public.
Propshaft improves upon this by creating a manifest file that maps the original filename as a key and the hashed filename as a value. This significantly enhances the developer experience in Rails.
Propshaft ultimately moves asset management in Rails to the next level, making it more efficient and streamlined.
The Future of Asset Management in Rails
With advancements like native ES6 support and CSS improvements, Rails continues evolving to embrace simpler, more efficient asset management strategies. Propshaft, combined with modern browser capabilities, makes asset handling seamless and more performance-oriented.
As the web progresses, we can expect further simplifications in asset pipelines, making Rails applications faster and easier to maintain.
Stay tuned for more innovations in the Rails ecosystem!
Order
.where("created_at < ?", last_created_at)
.order(created_at: :desc)
.limit(20)
This is called keyset pagination or cursor pagination.
Scenario 6 – SELECT *
Query:
SELECT*
FROM users;
Returns:
id
name
email
city
address
bio
avatar
...
Suppose the page only displays:
name
city
Why fetch everything?
Better:
SELECT
name,
city
FROM users;
Rails:
User.select(:name, :city)
Scenario 7 – COUNT(*)
Suppose:
SELECTCOUNT(*)
FROM orders;
On:
300 million rows
Question:
Can this be slow?
Yes.
Because PostgreSQL must count visible rows.
Unlike some databases, PostgreSQL generally doesn’t maintain an exact row count that’s instantly available for arbitrary COUNT(*).
Scenario 8 – DISTINCT
Query:
SELECTDISTINCT users.*
FROM users
JOIN orders
ON users.id=orders.user_id;
Question:
Why is DISTINCT needed?
Because JOIN duplicates users.
Could EXISTS express the requirement more directly?
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id=u.id
);
Sometimes that’s clearer.
Scenario 9 – Functions in WHERE
Query:
SELECT*
FROM users
WHERE LOWER(email)='john@example.com';
Normal email index?
Not useful.
Solution:
CREATE INDEX idx_lower_email
ON users(LOWER(email));
Expression index.
Scenario 10 – Too Many Indexes
Suppose:
users
↓
12 indexes
Problem?
Every INSERT must update:
Table
+
12 indexes
Indexes speed reads but slow writes.
Always consider the workload.
Optimization Decision Tree
When a query is slow, ask:
Is PostgreSQL scanning too many rows?
│
▼
Yes
│
▼
Would an index help?
│
▼
Yes
│
▼
Do I already have one?
│
▼
No
│
▼
Create the correct index.
But also ask:
Am I returning unnecessary data?
Am I sorting unnecessarily?
Am I joining unnecessarily?
Am I executing the query too many times?
Real Rails Optimization Example
Suppose this page loads slowly:
@orders = Order
.where(status: "completed")
.order(created_at: :desc)
.limit(20)
Questions:
Is there an index on status?
Is there an index on created_at?
Would a composite index help?
Potential solution:
CREATE INDEX idx_orders_status_created_at
ON orders(status, created_at DESC);
Why?
Because the query filters by status and orders by created_at.
Senior Interview Exercise
Suppose you see:
SELECT*
FROM orders
WHERE user_id =100
ORDERBY created_at DESC
LIMIT20;
Which index would you create?
Many people answer:
(user_id)
(created_at)
A stronger answer is:
CREATE INDEX idx_orders_user_created
ON orders(user_id, created_at DESC);
Because it supports both the filter and the ordering in one index.
Common Performance Mistakes
Mistake 1
Adding indexes without measuring.
Mistake 2
Using SELECT * everywhere.
Mistake 3
Ignoring N+1 queries.
Mistake 4
Using huge OFFSET values.
Mistake 5
Creating duplicate indexes.
Mistake 6
Ignoring EXPLAIN ANALYZE.
Senior-Level Mental Model
Every query has a “cost.”
The cost comes from:
Rows read
+
Rows sorted
+
Rows joined
+
Rows transferred
+
Application round trips
The goal of optimisation is to reduce one or more of these.
Practical Exercises
Exercise 1
Create:
CREATE INDEX idx_orders_user_created
ON orders(user_id, created_at DESC);
Run:
EXPLAIN ANALYZE
SELECT*
FROM orders
WHERE user_id=1
ORDERBY created_at DESC
LIMIT20;
Observe whether PostgreSQL can avoid an explicit Sort.
Exercise 2
Compare:
SELECT*
FROM users;
with:
SELECT name, city
FROM users;
Think about the amount of data returned.
Exercise 3
Write three versions of:
“Find users with completed orders.”
Using:
JOIN
EXISTS
IN
Then compare their execution plans.
Exercise 4
Find a query that performs a Seq Scan.
Add an appropriate index.
Run EXPLAIN ANALYZE again.
What changed?
Interview Case Study
Imagine you’re in a senior Rails interview.
The interviewer says:
“A customer reports that the Orders page takes 6 seconds to load.”
A strong answer isn’t:
“I’ll add an index.”
A stronger answer is:
Reproduce the issue.
Identify the SQL generated by ActiveRecord.
Run EXPLAIN ANALYZE.
Inspect scan types, joins, and sort operations.
Check existing indexes.
Decide whether the fix belongs in the SQL, indexes, ActiveRecord code, or schema.
Measure again after the change.
That systematic approach demonstrates senior-level thinking.
Homework
Build a small benchmark using your practice schema.
Populate:
100,000 users
500,000 orders
Measure these queries before and after adding indexes:
Find a user by email.
Find recent orders for a user.
Find completed orders.
Find users with no orders.
For each query, record:
Execution plan
Execution time
Scan type
Rows estimated
Rows returned
Explain why PostgreSQL chose each plan.
What’s Next?
At this point, you’re already covering topics that many experienced Rails developers never study in depth.
For Day 8, I recommend Window Functions:
ROW_NUMBER()
RANK()
DENSE_RANK()
LAG()
LEAD()
Running totals
Moving averages
Top N per group
Window functions are common in reporting, analytics, and senior backend interviews because they solve problems that are difficult or inefficient with plain GROUP BY. Understanding them will significantly broaden your SQL toolkit.
Today we’ll go beyond “create an index” and learn how senior backend engineers decide which index to create.
This is one of the most valuable topics for PostgreSQL and Rails interviews.
By the end of this lesson, you should be able to answer questions like:
Why did you create that index?
instead of just saying
Because the query was slow.
Today’s Goals
We’ll learn:
Composite Indexes
Leftmost Prefix Rule
Covering Indexes (Index Only Scan)
Included Columns (INCLUDE)
Partial Indexes
Expression Indexes
Unique Indexes
Choosing the right index
B-tree vs Hash vs GIN vs GiST vs BRIN
Rails migration examples
Real production examples
Part 1 – Let’s Create a Realistic Table
We’ll use a slightly more realistic table.
DROP TABLE IF EXISTS users;
CREATE TABLE users (
id BIGSERIAL PRIMARY KEY,
email TEXT,
city TEXT,
age INTEGER,
active BOOLEAN,
created_at TIMESTAMP
);
Populate it:
INSERT INTO users(email, city, age, active, created_at)
SELECT
'user' || i || '@example.com',
CASE
WHEN i % 4 = 0 THEN 'Boston'
WHEN i % 4 = 1 THEN 'Chicago'
WHEN i % 4 = 2 THEN 'New York'
ELSE 'Dallas'
END,
20 + (i % 40),
(i % 10 <> 0),
NOW() - (i || ' days')::interval
FROM generate_series(1,100000) i;
Part 2 – Composite Indexes
Suppose your application frequently runs:
SELECT *
FROM users
WHERE city = 'Chicago'
AND age = 30;
Many developers think:
I’ll create two indexes.
CREATE INDEX idx_users_city
ON users(city);
CREATE INDEX idx_users_age
ON users(age);
Sometimes PostgreSQL can combine them using a Bitmap Index Scan.
But often, a composite index is even better.
CREATE INDEX idx_users_city_age
ON users(city, age);
How PostgreSQL Stores It
Think of it as sorting by the first column, then by the second.
Conceptually:
Boston
20
21
22
23
Chicago
20
21
22
23
24
25
Dallas
...
Notice:
Everything is ordered by:
city
↓
age
The Leftmost Prefix Rule
This is probably the most important composite-index interview question.
Suppose you have:
(city, age)
Will it help?
Query 1
WHERE city='Chicago'
✅ Yes
Because the index starts with city.
Query 2
WHERE city='Chicago'
AND age=30
✅ Yes
Perfect.
Query 3
WHERE age=30
❌ Usually No
Why?
Imagine a dictionary.
Can you find:
age = 30
without first knowing the city?
No.
The index is organised by city first.
Senior Interview Question
Which is better?
(city, age)
or
(age, city)
Answer:
It depends on your query patterns.
Suppose:
95% of queries are:
WHERE city='Chicago'
Choose:
(city, age)
Suppose:
95% are:
WHERE age=30
Choose:
(age, city)
There is no universally “better” order.
Practical Exercise
Create:
CREATE INDEX idx_users_city_age
ON users(city, age);
Now test:
EXPLAIN ANALYZE
SELECT*
FROM users
WHERE city='Chicago';
Test:
EXPLAIN ANALYZE
SELECT*
FROM users
WHERE city='Chicago'
AND age=30;
Test:
EXPLAIN ANALYZE
SELECT*
FROM users
WHERE age=30;
Observe which queries use the composite index.
Part 3 – Covering Indexes
Suppose you run:
SELECT email
FROM users
WHERE email='user500@example.com';
Question:
Why read the whole table?
The index already contains:
email
↓
pointer
If PostgreSQL can answer the query using only the index, it may perform an:
Index Only Scan
instead of:
Index Scan
Why Is It Faster?
Index Scan:
Index
↓
Find pointer
↓
Read table
↓
Return email
Index Only Scan:
Index
↓
Return email
The table doesn’t need to be accessed.
Important Detail
Index Only Scans are only possible when PostgreSQL knows that the table pages are “all-visible” via the Visibility Map, which is maintained by VACUUM.
We’ll study this in PostgreSQL Internals.
Try It
Create:
CREATE INDEX idx_users_email
ON users(email);
Run:
EXPLAIN ANALYZE
SELECT email
FROM users
WHERE email='user90000@example.com';
Sometimes you’ll see:
Index Only Scan
Sometimes:
Index Scan
We’ll later learn why.
Part 4 – INCLUDE Columns
Suppose your application frequently runs:
SELECT
email,
city
FROM users
WHERE email='user100@example.com';
A normal email index stores:
email
↓
pointer
The planner still needs to visit the table to fetch city.
PostgreSQL allows:
CREATE INDEX idx_users_email_include
ON users(email)
INCLUDE(city);
Now:
email is part of the searchable index key.
city is stored in the index payload.
This can allow an Index Only Scan for:
SELECT email, city
...
without making city part of the search order.
Interview Question
Difference between:
(email, city)
and
(email)
INCLUDE(city)
Answer:
city in a composite index affects the index ordering and can be used for searching.
city in INCLUDE cannot be searched efficiently but can be returned without accessing the table.
Part 5 – Partial Indexes
One of PostgreSQL’s best features.
Suppose:
100,000 users
90,000 active
10,000 inactive
Your application only searches active users.
Instead of indexing everybody:
CREATE INDEX idx_users_active
ON users(active);
Create:
CREATE INDEX idx_active_email
ON users(email)
WHERE active=true;
Now the index contains only active users.
Advantages:
Smaller index
Faster scans
Less maintenance
Query
SELECT*
FROM users
WHERE active=true
AND email='user100@example.com';
Perfect candidate.
Rails Migration
add_index:users,
:email,
where:"active = true"
Part 6 – Expression Indexes
Suppose users log in with:
WHERE LOWER(email)=LOWER(?)
Without an expression index:
PostgreSQL can’t efficiently use a normal email index because you’re applying a function to the column.
Create:
CREATE INDEX idx_users_lower_email
ON users(LOWER(email));
Now:
SELECT*
FROM users
WHERE LOWER(email)=LOWER('JOHN@test.com');
can use the index.
Rails Example
User.where(
"LOWER(email)=?",
email.downcase
)
Expression indexes are extremely common for case-insensitive searches.
Part 7 – Unique Indexes
Earlier we learned:
email UNIQUE
Internally PostgreSQL implements this using a unique index.
You can also create one directly:
CREATEUNIQUE INDEX idx_users_email_unique
ON users(email);
Now duplicates are impossible.
Interview Question
Difference between:
UNIQUECONSTRAINT
and
CREATEUNIQUE INDEX
Practically, both enforce uniqueness.
The preferred way for business rules is usually a UNIQUE constraint, which PostgreSQL implements using a unique index under the hood.
Part 8 – Index Types
So far we’ve only used:
B-tree
PostgreSQL supports several index types.
B-tree (Default)
Good for:
=
<
BETWEEN
ORDER BY
Most common.
Hash
Good for:
=
only.
Rarely needed because B-tree also supports equality efficiently.
GIN
Great for:
JSONB
Arrays
Full-text search
Rails examples:
where("tags @> ARRAY['ruby']")
or
where("metadata @> ?", ...)
GiST
Useful for:
Geospatial data
PostGIS
Range types
BRIN
Designed for huge tables where rows are naturally ordered.
Example:
Logs
Millions of rows
Ordered by timestamp
A BRIN index is tiny compared with a B-tree.
Quick Comparison
Index
Best Use
B-tree
Default choice
Hash
Equality only
GIN
JSONB, arrays, full-text
GiST
Geometry, ranges
BRIN
Huge sequential tables
Part 9 – Real Rails Examples
Login
User.find_by(email:params[:email])
Index:
(email)
User Orders
user.orders
Index:
(user_id)
Dashboard
Order.where(status:"pending")
Maybe:
(status)
But ask:
How selective is status?
If 95% are pending, maybe not.
Recent Orders
Order
.order(created_at::desc)
.limit(20)
Good candidate:
(created_at)
Or even:
(created_at DESC)
Part 10 – Choosing the Right Index
Never ask:
Which index can I create?
Ask:
Which queries does my application actually run?
Example:
95%
WHERE email=?
Index email.
Example:
95%
WHERE city='Chicago'
Index city.
Example:
95%
WHERE city='Chicago'
AND age=30
Composite index.
Indexes should be driven by query patterns, not by table columns.
Common Mistakes
Mistake 1
Creating:
(city)
(age)
when almost every query filters on both together.
Mistake 2
Wrong column order.
(age, city)
when almost every query starts with city.
Mistake 3
Using functions without expression indexes.
LOWER(email)
Mistake 4
Indexing everything.
Indexes are not free.
Senior-Level Insights
Composite indexes should reflect how your application filters data, not simply the table schema.
Partial indexes are often a better solution than full indexes when only a subset of rows is queried frequently.
Expression indexes solve a very common performance problem when functions are applied in WHERE clauses.
Covering indexes reduce table lookups and can enable Index Only Scans.
The best index is the one that matches your most common query pattern—not necessarily the one that indexes the most columns.
Practical Exercises
Exercise 1
Create:
(city, age)
Run:
EXPLAIN ANALYZE
SELECT*
FROM users
WHERE city='Boston';
Exercise 2
Run:
SELECT*
FROM users
WHERE city='Boston'
AND age=35;
Observe the plan.
Exercise 3
Run:
SELECT*
FROM users
WHERE age=35;
Explain why the composite index is or isn’t used.
Exercise 4
Create:
CREATE INDEX idx_lower_email
ON users(LOWER(email));
Run:
EXPLAIN ANALYZE
SELECT*
FROM users
WHERE LOWER(email)=LOWER('user100@example.com');
Exercise 5
Create a partial index:
CREATE INDEX idx_active_users
ON users(email)
WHERE active=true;
Run:
SELECT*
FROM users
WHERE active=true
AND email='user100@example.com';
Compare the execution plan with and without the partial index.
Homework
Create and test:
A composite index
A partial index
An expression index
A unique index
For each index, answer:
Which query benefits?
Why?
Would a different index be better?
Use EXPLAIN ANALYZE to verify your assumptions.
Day 6C Preview
Next, we’ll become execution plan detectives.
We’ll take real EXPLAIN ANALYZE outputs like:
Gather
Hash Join
Nested Loop
Memoize
Bitmap Heap Scan
Bitmap Index Scan
Sort
Aggregate
Limit
Materialize
and decode every single line.
By the end of Day 6C, we’ll be able to sit in a senior interview, look at a PostgreSQL execution plan, and explain not just what PostgreSQL did, but why it chose that plan. That is a skill that sets experienced backend engineers apart.
In this post let’s find out how the data structure look like for a b-tree index in postgresql. Also we analyse our following test query results using EXPLAIN ANALYSE
EXPLAIN ANALYSE SELECT * FROM users WHERE city='Chicago';
QUERY PLAN ----- Seq Scan on users (cost=0.00..2332.00 rows=24780 width=51)
(actual time=0.077..21.085 rows=25000 loops=1)
CREATE INDEX idx_users_city ON users(city);
CREATE INDEX EXPLAIN ANALYSE SELECT * FROM users WHERE city='Chicago';
QUERY PLAN ---- Bitmap Heap Scan on users (cost=280.34..1672.09 rows=24780 width=51)
(actual time=3.309..15.732 rows=25000 loops=1)
Q1) How can PostgreSQL build a B-tree index for emails when every email is unique?
Short answer: Yes. The index contains one entry for every row.
The tree lets PostgreSQL eliminate huge portions of the search space.
Instead of checking every row, it follows the correct branch.
Does it consume memory?
Yes.
Every index consumes disk space.
If you have:
1 million rows
and create an index on email,
the index also has approximately 1 million entries.
That’s why we don’t create indexes on everything.
What happens during INSERT?
Suppose:
INSERT INTO users(email)
VALUES ('zack@test.com');
PostgreSQL does two things:
Inserts the row into the table.
Inserts a new entry into the B-tree.
That’s why indexes make:
INSERT
UPDATE
DELETE
slightly slower.
Interview Question
If an index has one entry per row, isn’t searching still O(n)?
No.
Because of the B-tree.
Searching isn’t done linearly.
It’s approximately:
O(log n)
instead of
O(n)
For:
1,000,000 rows
a B-tree may require only around 20–25 comparisons rather than scanning all million rows.
Q2. Why did PostgreSQL use a Bitmap Heap Scan instead of an Index Scan?
Your output:
Before index:
Seq Scan on users
rows = 25000
After index:
Bitmap Heap Scan
rows = 25000
This is actually exactly what PostgreSQL should do.
Let’s understand why.
Your data distribution
Remember how you inserted the data?
CASE
WHEN i % 4 = 0 THEN 'Boston'
WHEN i % 4 = 1 THEN 'Chicago'
WHEN i % 4 = 2 THEN 'New York'
ELSE 'Dallas'
END
So:
100,000 rows
↓
4 cities
↓
25,000 users per city
That means:
Chicago
↓
25%
of the table
Option 1 — Sequential Scan
Without index:
Read
100000 rows
↓
Return
25000 rows
One pass through the table.
Option 2 — Normal Index Scan
Imagine PostgreSQL used the city index.
It would do something like:
Index
↓
Find row 4
↓
Jump to table
↓
Find row 9
↓
Jump to table
↓
Find row 13
↓
Jump to table
...
25000 times
That’s a lot of random table accesses.
Random disk reads (or random memory accesses) are expensive.
Option 3 — Bitmap Heap Scan
This is PostgreSQL’s compromise.
Step 1:
Read the index.
Chicago
↓
Rows
4
9
13
22
31
...
99998
Instead of fetching the rows immediately, PostgreSQL creates a bitmap.
Conceptually:
Rows to fetch
4
9
13
22
31
...
Then it sorts/groups those row locations by table page.
Only then does it read the table.
So instead of:
Index
↓
Table
↓
Index
↓
Table
↓
Index
↓
Table
it does:
Index
↓
Collect all matching row locations
↓
Read table pages efficiently
↓
Return rows
This reduces random I/O significantly.
When does PostgreSQL choose Bitmap Heap Scan?
Typically when:
Some rows match
but
not too few
and
not almost all.
Think of it like this:
Rows matched
Likely plan
1 row
Index Scan
100 rows
Index Scan
5,000 rows
Bitmap Heap Scan
25,000 rows
Bitmap Heap Scan
99,000 rows
Seq Scan
The exact thresholds depend on statistics and cost estimates.
Why not an Index Scan?
Your query returns:
25,000 rows
That’s 25% of the table.
PostgreSQL thinks:
“Using the index is worthwhile, but fetching 25,000 rows one-by-one would be inefficient. I’ll gather all matching row locations first and then fetch the data in batches.”
That’s why you got:
Bitmap Heap Scan
Understanding our EXPLAIN ANALYZE Output
Seq Scan on users
(cost=0.00..2332.00 rows=24780 width=51)
(actual time=0.077..21.085 rows=25000 loops=1)
Let’s decode it.
Seq Scan
PostgreSQL reads every row.
cost
0.00..2332.00
This is not time.
It’s PostgreSQL’s internal cost estimate.
0.00 = startup cost
2332.00 = estimated total cost
Costs are used only to compare execution plans.
rows=24780
Planner estimated:
24,780 rows
Actual:
25,000 rows
Excellent estimate.
Good statistics help PostgreSQL choose the right plan.
width=51
Average row size is estimated to be:
51 bytes
This helps estimate I/O cost.
actual time
0.077..21.085
First row available after 0.077 ms.
Entire query finished after 21.085 ms.
loops=1
The node executed once.
After Creating the Index
Bitmap Heap Scan
(actual time=3.309..15.732)
Notice:
Execution time dropped from roughly:
21 ms
↓
16 ms
The improvement isn’t dramatic because your query still returns 25% of the table.
Indexes shine when they allow PostgreSQL to skip most of the table.
Want to See an Index Scan?
Try a highly selective query.
EXPLAIN ANALYZE
SELECT *
FROM users
WHERE email = 'user75000@example.com';
Since email is unique, PostgreSQL should choose:
Index Scan
because only one row matches.
A Practical Rule for Senior Engineers
When reading an execution plan, ask yourself these questions in order:
How many rows does the query return?
How many rows are in the table?
Is the predicate selective enough for an index?
What scan type did PostgreSQL choose?
Does that choice make sense?
Let’s cover the following topics in the remaining areas of Day 6.
Day 6B – Composite indexes, covering indexes, partial indexes, unique indexes, expression indexes, GIN vs GiST vs BRIN vs Hash indexes, and real-world Rails indexing strategies
Day 6C – Query optimization workshop: we’ll analyze real EXPLAIN ANALYZE outputs together, identify bottlenecks, and optimize queries step by step.
Given our role of Senior Rails Developer, Let’s spend 3 focused sessions on indexing and query optimization will provide much more value than rushing to the next topic.
Today marks an important milestone in this course.
Up until now, we’ve focused on writing correct SQL.
From today onward, we’ll focus on writing fast SQL.
This is one of the biggest differences between a mid-level Rails developer and a senior Rails developer.
A mid-level developer asks:
“Does my query work?”
A senior developer asks:
“How many rows did PostgreSQL have to examine to answer this query?”
Today’s Goals
By the end of today, you should understand:
What an index is
How PostgreSQL uses indexes
B-Tree indexes
Sequential Scan
Index Scan
Bitmap Index Scan
EXPLAIN
EXPLAIN ANALYZE
When indexes help
When indexes hurt
Composite indexes
Foreign key indexes
ActiveRecord index creation
Common interview questions
A Senior Engineer’s Mental Model
Imagine you have a book with 2 million pages.
You need to find:
Ruby on Rails
Without an Index
You start from page 1.
Page 1
Page 2
Page 3
...
Page 2,000,000
This is a Sequential Scan.
With an Index
You open the index section at the back of the book.
Ruby on Rails → Page 1,542,381
Immediately jump there.
This is an Index Scan.
That analogy is almost exactly how database indexes work.
Part 1 – Create a Practice Table
We’ll create a larger dataset than before.
DROPTABLEIFEXISTS users;
CREATETABLE users (
id BIGSERIAL PRIMARYKEY,
name VARCHAR(100),
email VARCHAR(255),
city VARCHAR(100),
age INTEGER,
active BOOLEANDEFAULTtrue
);
Insert Sample Data
Instead of inserting thousands of rows manually, PostgreSQL provides a wonderful function:
generate_series()
We’ll use it a lot.
INSERTINTO users(name, email, city, age)
SELECT
'User '|| i,
'user'|| i ||'@example.com',
CASE
WHEN i %4=0THEN'Boston'
WHEN i %4=1THEN'Chicago'
WHEN i %4=2THEN'New York'
ELSE'Dallas'
END,
20+(i %40)
FROM generate_series(1,100000) i;
Congratulations.
You now have:
100,000 users
Verify:
SELECTCOUNT(*)
FROM users;
Output:
100000
Part 2 – Why Indexes Exist
Suppose we search:
SELECT*
FROM users
WHERE email ='user75000@example.com';
Without an index:
PostgreSQL has to inspect rows one by one.
User 1
No
↓
User 2
No
↓
User 3
No
↓
...
↓
User 75,000
YES
Potentially:
75,000 comparisons
Part 3 – See PostgreSQL’s Plan
Instead of running:
SELECT*
FROM users
WHERE email='user75000@example.com';
Run:
EXPLAIN
SELECT*
FROM users
WHERE email='user75000@example.com';
You will likely see something similar to:
Seq Scan on users
This means:
Sequential Scan
Interview Question:
What is a Sequential Scan?
Answer:
PostgreSQL reads every row (or nearly every row) in the table to evaluate the query condition.
Part 4 – Create an Index
Let’s create one.
CREATE INDEX idx_users_email
ON users(email);
Run:
EXPLAIN
SELECT*
FROM users
WHERE email='user75000@example.com';
Now you’ll likely see:
Index Scan
Congratulations!
You just made your first query significantly faster.
What Is an Index?
An index is a separate data structure maintained by PostgreSQL.
Conceptually:
users table
id
name
email
...
↓
Index
email
↓
Row Location
Notice:
The table itself is not sorted.
The index is.
Part 5 – B-Tree Index
The default PostgreSQL index type is:
B-tree
Rails interviewers love asking:
What type of index does PostgreSQL create by default?
Answer:
B-tree
Good for:
=
<
BETWEEN
ORDER BY
Create explicitly:
CREATE INDEX idx_users_age
ON users
USING btree(age);
Usually:
CREATE INDEX idx_users_age
ON users(age);
creates the same thing.
Part 6 – EXPLAIN ANALYZE
Very important.
Difference:
EXPLAIN
Shows what PostgreSQL plans to do.
EXPLAIN ANALYZE
Actually runs the query and measures it.
Run:
EXPLAIN ANALYZE
SELECT*
FROM users
WHERE email='user75000@example.com';
Output looks similar to:
Index Scan
Planning Time: 0.2 ms
Execution Time: 0.1 ms
Notice:
Planning time
vs
Execution time.
Reading EXPLAIN ANALYZE
Typical output:
Index Scan using idx_users_email
(cost=0.42..8.44)
(rows=1)
(width=65)
(actual time=0.03..0.04)
(actual rows=1)
Don’t panic.
We’ll learn each part.
rows
Estimated rows.
Example:
rows=1
Planner expects:
1 row
actual rows
Returned rows.
actual rows=1
Perfect.
If estimates differ greatly from actual rows, PostgreSQL may choose a poor plan.
This is one reason why running ANALYZE (to refresh table statistics) matters.
Part 7 – Why Doesn’t PostgreSQL Always Use an Index?
This surprises many developers.
Suppose:
SELECT*
FROM users;
Would an index help?
No.
You need every row.
Sequential Scan is faster.
Suppose:
SELECT*
FROM users
WHERE active=true;
Imagine:
98%
of users
are active.
Would using an index help?
Usually not.
Why?
Using the index would require PostgreSQL to:
traverse the index
then visit almost every table row anyway
Sometimes a Sequential Scan is cheaper.
Interview Question:
Why might PostgreSQL ignore an index?
Good answer:
Because the planner estimates that scanning the entire table is cheaper than using the index, often due to low selectivity or because a large percentage of rows match the condition.
Part 8 – Selectivity
A crucial concept.
Imagine:
Gender
Male
Female
Only two values.
Index?
Not very useful.
Now:
email
Every row unique.
Excellent index.
Rule of thumb:
Higher uniqueness
↓
Better selectivity
↓
More useful index
Examples:
Good:
email
UUID
order_number
tracking_number
Poor:
gender
active
status (if only a few values)
Part 9 – Composite Indexes
Suppose we often search:
SELECT*
FROM users
WHERE city='Chicago'
AND age=25;
Instead of:
CREATE INDEX idx_city;
CREATE INDEX idx_age;
We can create:
CREATE INDEX idx_city_age
ON users(city, age);
Interview Question:
Will this index help?
WHERE city='Chicago'
Yes.
Will it help?
WHERE city='Chicago'
AND age=25
Yes.
Will it help?
WHERE age=25
Usually No.
This is called the Leftmost Prefix Rule.
Leftmost Prefix Rule
For an index:
(city, age)
Efficient for:
WHERE city='Chicago'
and
WHERE city='Chicago'
AND age=25
Not generally for:
WHERE age=25
because the index is ordered by city first.
Part 10 – Indexes on Foreign Keys
Consider:
orders
user_id
Rails creates:
belongs_to:user
You often query:
SELECT*
FROM orders
WHERE user_id=5;
Should user_id be indexed?
Absolutely.
Without it:
Every order
↓
Scan
With it:
Jump directly to user 5's orders.
Rails Migration
add_reference:orders,
:user,
foreign_key:true,
index:true
or
t.references:user,
foreign_key:true
Rails creates the index automatically.
Part 11 – Rails Examples
Find by email:
User.find_by(email:email)
Should email be indexed?
Yes.
Authentication:
User.find_by(email:params[:email])
Index?
Definitely.
Showing a user’s orders:
user.orders
Queries:
WHERE user_id=?
Index?
Yes.
Searching by created_at:
Order.order(created_at::desc)
Index?
Often yes, especially for recent-record queries or pagination.
Part 12 – Bitmap Index Scan
Sometimes PostgreSQL combines indexes.
Example:
city='Chicago'
AND
age=30
Two separate indexes:
idx_city
idx_age
Planner may choose:
Bitmap Index Scan
Meaning:
scan both indexes
combine the matching row locations
visit the table once
This can be efficient when no suitable composite index exists.
Today we move from basic filtering and aggregation into query composition.
This is an important topic for senior Rails interviews because many real production queries can be expressed in several ways:
JOIN
IN
EXISTS
Subquery
ActiveRecord association queries
A senior engineer should know not only how to write them, but also:
Which query expresses the business requirement most clearly?
Does the query preserve duplicates?
Does NULL affect the result?
Does PostgreSQL need to calculate one value or evaluate rows repeatedly?
What SQL is ActiveRecord generating?
We’ll build on the users and orders tables from Day 4.
Today’s Goals
By the end of Day 5, you should understand:
What a subquery is
Scalar subqueries
Multi-row subqueries
Subqueries in WHERE
Subqueries in FROM
Correlated subqueries
IN
EXISTS
NOT EXISTS
NOT IN and the NULL trap
ANY
ALL
JOIN vs IN vs EXISTS
ActiveRecord equivalents
Common mistakes
Senior interview questions
Part 1 – Prepare the Practice Data
We’ll use the same domain from Day 4, but add a few more rows to make today’s queries more interesting.
First, inspect your current data:
SELECT*FROM users ORDERBY id;
SELECT*FROM orders ORDERBY id;
If you want to recreate everything from scratch, run:
DROPTABLEIFEXISTS orders;
DROPTABLEIFEXISTS users;
CREATETABLE users (
id BIGSERIAL PRIMARYKEY,
name VARCHAR(100)NOTNULL,
city VARCHAR(100)
);
CREATETABLE orders (
id BIGSERIAL PRIMARYKEY,
user_id BIGINT NOTNULL,
amount NUMERIC(10,2)NOTNULL,
status VARCHAR(20)NOTNULL,
created_at TIMESTAMPNOTNULLDEFAULT NOW(),
CONSTRAINT fk_orders_user
FOREIGNKEY(user_id)
REFERENCES users(id)
);
Insert users:
INSERTINTO users(name, city)
VALUES
('John','New York'),
('Mary','Chicago'),
('Bob','Chicago'),
('Alice','Boston'),
('David','Mumbai'),
('Sara','Boston');
Insert orders:
INSERTINTO orders(user_id, amount, status)
VALUES
(1,100,'completed'),
(1,250,'completed'),
(1,75,'pending'),
(2,500,'completed'),
(2,300,'completed'),
(3,200,'pending'),
(4,800,'completed'),
(4,150,'cancelled'),
(6,1000,'completed'),
(6,1200,'completed');
Now our data looks conceptually like this:
User
Orders
John
100, 250, 75
Mary
500, 300
Bob
200
Alice
800, 150
David
No orders
Sara
1000, 1200
This dataset is intentionally designed so we can practice:
users with orders
users without orders
users above average spending
users with expensive orders
correlated subqueries
EXISTS and NOT EXISTS
Part 2 – What Is a Subquery?
A subquery is a query nested inside another SQL statement.
Example:
SELECT*
FROM orders
WHERE amount >(
SELECT AVG(amount)
FROM orders
);
The inner query is:
SELECT AVG(amount)
FROM orders;
The outer query is:
SELECT*
FROM orders
WHERE amount >(...);
Conceptually:
Inner query
↓
Calculate average order amount
↓
Return the result
↓
Outer query
↓
Find orders greater than that value
Let’s run the inner query separately first:
SELECT AVG(amount)
FROM orders;
Total amount:
4575
Number of orders:
10
Average:
457.5
Now the outer query becomes conceptually:
SELECT*
FROM orders
WHERE amount >457.5;
Result:
500
800
1000
1200
Rails Equivalent
Order.where(
"amount > (?)",
Order.select("AVG(amount)")
)
However, in Rails you may also see:
average=Order.average(:amount)
Order.where("amount > ?", average)
These are not exactly the same approach.
The first can produce one SQL statement containing a subquery.
The second executes:
Query 1 → Calculate average
Query 2 → Find orders above average
That distinction can matter when data changes between queries and when minimizing database round trips.
Part 3 – Scalar Subqueries
A scalar subquery returns:
One row
One column
Therefore, it produces a single value.
Example:
SELECT AVG(amount)
FROM orders;
Result:
457.5
We can use that result with operators such as:
=
>
<
>=
<=
<>
Example:
SELECT
id,
user_id,
amount
FROM orders
WHERE amount >(
SELECT AVG(amount)
FROM orders
);
What Happens if the Subquery Returns Multiple Rows?
Try:
SELECT*
FROM orders
WHERE amount =(
SELECT amount
FROM orders
);
The inner query returns many rows.
PostgreSQL will raise an error similar to:
more than one row returned by a subquery used as an expression
Why?
Because:
amount = ???
expects one value.
But the subquery returned:
100
250
75
500
300
...
PostgreSQL cannot compare one amount against multiple scalar values using =.
This leads us to IN.
Part 4 – IN with a Subquery
Suppose the requirement is:
Find users who have placed at least one order.
We can write:
SELECT*
FROM users
WHERE id IN(
SELECT user_id
FROM orders
);
Run the subquery separately:
SELECT user_id
FROM orders;
Result:
1
1
1
2
2
3
4
4
6
6
Conceptually:
SELECT*
FROM users
WHERE id IN(1,1,1,2,2,3,4,4,6,6);
Result:
John
Mary
Bob
Alice
Sara
David is excluded because he has no orders.
Rails Equivalent
A good ActiveRecord version is:
User.where(
id:Order.select(:user_id)
)
Conceptually, Rails can generate:
SELECT*
FROM users
WHERE id IN(
SELECT user_id
FROM orders
);
Notice the difference between:
Order.select(:user_id)
and:
Order.pluck(:user_id)
This is important.
Using select
User.where(id:Order.select(:user_id))
can remain a single SQL statement with a subquery.
Using pluck
User.where(id:Order.pluck(:user_id))
executes the inner query immediately.
Conceptually:
Query 1
SELECT user_id FROM orders;
Then Rails constructs another query:
Query 2
SELECT *
FROM users
WHERE id IN (1, 1, 1, 2, 2, 3, ...);
For a large dataset, that can be undesirable.
Senior-Level Insight
When building SQL subqueries in ActiveRecord, don’t automatically reach for pluck.
Ask:
Do I want Ruby to materialize these IDs?
Or:
Can PostgreSQL keep the work inside one SQL statement?
Part 5 – NOT IN
Suppose the requirement is:
Find users who have never placed an order.
You might write:
SELECT*
FROM users
WHERE id NOTIN(
SELECT user_id
FROM orders
);
Result:
David
With our current schema, this works because:
orders.user_id BIGINT NOTNULL
Therefore, the subquery cannot return NULL.
But NOT IN has a famous SQL trap.
Part 6 – The NOT IN + NULL Trap
Let’s create a small demonstration table.
DROPTABLEIFEXISTS order_users_demo;
CREATETABLE order_users_demo (
user_id BIGINT
);
Insert:
INSERTINTO order_users_demo(user_id)
VALUES
(1),
(2),
(NULL);
Now run:
SELECT*
FROM users
WHERE id NOTIN(
SELECT user_id
FROM order_users_demo
);
You might expect:
Bob
Alice
David
Sara
But you get:
0 rows
Why?
Because SQL uses three-valued logic:
TRUE
FALSE
UNKNOWN
Conceptually:
id NOTIN(1,2,NULL)
behaves like:
id <>1
AND id <>2
AND id <>NULL
But:
id <>NULL
is not TRUE.
It is:
UNKNOWN
And:
TRUE AND TRUE AND UNKNOWN
results in:
UNKNOWN
WHERE only keeps rows where the condition evaluates to TRUE.
This is one of the most important SQL interview traps to remember.
Part 7 – EXISTS
Now let’s solve:
Find users who have at least one order.
Using EXISTS:
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
Result:
John
Mary
Bob
Alice
Sara
David is excluded.
How Does EXISTS Work?
Look carefully:
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
The inner query references:
u.id
But u was defined in the outer query.
Therefore, this is a:
Correlated Subquery
Conceptually PostgreSQL evaluates:
John
↓
Does an order exist with user_id = John's id?
↓
Yes
↓
Keep John
Then:
Mary
↓
Does an order exist?
↓
Yes
↓
Keep Mary
Then:
David
↓
Does an order exist?
↓
No
↓
Remove David
Important: this is a useful conceptual model, but it does not mean PostgreSQL must literally execute the inner query once per outer row. The optimizer can transform correlated EXISTS queries into efficient semi-join plans.
We’ll inspect that later using:
EXPLAIN ANALYZE
Why SELECT 1?
You commonly see:
EXISTS(
SELECT1
FROM orders
...
)
Why 1?
Because EXISTS doesn’t care what columns are returned.
It only asks:
Does at least one matching row exist?
These are semantically equivalent:
EXISTS(
SELECT1
FROM orders
WHERE ...
)
EXISTS(
SELECT*
FROM orders
WHERE ...
)
EXISTS(
SELECT amount
FROM orders
WHERE ...
)
SELECT 1 communicates intent clearly.
Part 8 – NOT EXISTS
Requirement:
Find users who have never placed an order.
SELECT*
FROM users u
WHERENOTEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
Result:
David
This is called an anti-join pattern.
Conceptually:
For each user:
Does a matching order exist?
YES → reject
NO → keep
Compare With LEFT JOIN
We learned this yesterday:
SELECT u.*
FROM users u
LEFTJOIN orders o
ON o.user_id = u.id
WHERE o.id ISNULL;
And today:
SELECT u.*
FROM users u
WHERENOTEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
Both express:
Find users without orders.
The PostgreSQL optimizer may produce similar execution strategies.
However, NOT EXISTS often expresses the business requirement more directly:
Keep the user if no matching order exists.
Rails Equivalent: where.missing
Rails provides a very readable API:
User.where.missing(:orders)
Conceptually, Rails generates a LEFT OUTER JOIN with an IS NULL condition.
Another option is to build a NOT EXISTS query using Arel, but for standard Rails association queries, where.missing is usually clearer.
Rails Equivalent: where.associated
Find users who have orders:
User.where.associated(:orders)
Depending on Rails version and query construction, this uses an association join and filters out missing related rows.
You may also write:
User.joins(:orders).distinct
Remember why distinct can be needed:
John has 3 orders
JOIN result:
John
John
John
EXISTS does not duplicate John because it tests existence rather than returning matching order rows.
This is a major conceptual difference.
Part 9 – IN vs EXISTS
Let’s compare them.
IN
SELECT*
FROM users
WHERE id IN(
SELECT user_id
FROM orders
);
Conceptually:
Is this user’s ID present in the set of order user IDs?
EXISTS
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
Conceptually:
Does at least one matching order exist for this user?
Which Is Faster?
A common junior-level answer is:
EXISTS is always faster.
That’s incorrect.
Modern PostgreSQL can rewrite IN and EXISTS into similar plans, such as semi-joins.
Performance depends on:
table sizes
indexes
statistics
data distribution
selectivity
query structure
PostgreSQL planner decisions
The correct senior-level approach is:
Choose the query that expresses the requirement clearly, then inspect the execution plan when performance matters.
Later we’ll compare:
EXPLAIN ANALYZE
SELECT ...
WHERE id IN(...);
with:
EXPLAIN ANALYZE
SELECT ...
WHEREEXISTS(...);
Part 10 – Correlated Subqueries
We’ve already seen one:
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
The inner query depends on the outer query.
Let’s look at another important example.
Requirement:
Find orders whose amount is greater than the average order amount for that particular user.
This is different from:
Find orders above the global average.
Global average:
SELECT*
FROM orders
WHERE amount >(
SELECT AVG(amount)
FROM orders
);
Per-user average:
SELECT
o.id,
o.user_id,
o.amount
FROM orders o
WHERE o.amount >(
SELECT AVG(o2.amount)
FROM orders o2
WHERE o2.user_id = o.user_id
);
Notice:
o2.user_id = o.user_id
The inner query references the outer row.
Let’s manually reason through John.
John’s orders:
100
250
75
Average:
141.67
Which John’s orders are above John’s average?
250
Mary:
500
300
Average:
400
Above average:
500
Alice:
800
150
Average:
475
Above average:
800
Sara:
1000
1200
Average:
1100
Above average:
1200
Bob has only one order:
200
Average:
200
Condition:
200 > 200
False.
So Bob has no matching result.
Rails Equivalent
A direct SQL fragment is often the clearest ActiveRecord solution:
Order.where(<<~SQL)
orders.amount> (
SELECTAVG(o2.amount)
FROMorderso2
WHEREo2.user_id=orders.user_id
)
SQL
Senior Rails Insight:
Not every query should be forced into a chain of ActiveRecord methods.
For complex database logic, readable SQL inside ActiveRecord can be better than complicated Arel code.
The important things are:
parameterize external input
keep the SQL understandable
test it
inspect its execution plan when needed
Part 11 – Subqueries in FROM
A subquery can also act like a temporary result set.
Requirement:
Calculate each user’s total spending, then return only users whose total spending exceeds 500.
First calculate totals:
SELECT
user_id,
SUM(amount)AS total_spent
FROM orders
GROUPBY user_id;
Now use that result as a derived table:
SELECT*
FROM(
SELECT
user_id,
SUM(amount)AS total_spent
FROM orders
GROUPBY user_id
) user_totals
WHERE total_spent >500;
Important:
PostgreSQL requires an alias for the derived table:
user_totals
Conceptually:
orders
↓
GROUP BY user_id
↓
temporary result set
user_id | total_spent
↓
filter temporary result
↓
total_spent > 500
Of course, for this particular query, HAVING is simpler:
SELECT
user_id,
SUM(amount)AS total_spent
FROM orders
GROUPBY user_id
HAVING SUM(amount)>500;
So why learn subqueries in FROM?
Because derived tables become useful when:
aggregating in multiple stages
joining against aggregated results
ranking data
reporting queries
building complex analytical queries
Part 12 – ANY
ANY compares a value against values returned by a subquery.
Example:
SELECT*
FROM orders
WHERE amount >ANY(
SELECT amount
FROM orders
WHERE user_id =1
);
John’s order amounts:
100
250
75
The condition is:
amount > ANY (100, 250, 75)
This means:
The amount must be greater than at least one value.
Effectively:
amount > 75
because being greater than the smallest value is enough to satisfy the condition.
Therefore:
>ANY
can often be thought of as:
Greater than at least one value
Part 13 – ALL
Now:
SELECT*
FROM orders
WHERE amount >ALL(
SELECT amount
FROM orders
WHERE user_id =1
);
John’s amounts:
100
250
75
Condition:
amount > ALL (100, 250, 75)
The amount must be greater than every value.
Effectively:
amount > 250
Therefore:
>ALL
means:
Greater than every value returned by the subquery.
Important ANY / ALL Mental Model
Given:
10
20
30
Then:
value>ANY(10,20,30)
means:
value > at least one of them
Equivalent threshold:
value > 10
But:
value>ALL(10,20,30)
means:
value > every one of them
Equivalent threshold:
value > 30
Be careful: this shortcut depends on the comparison operator. For example, < ANY and < ALL have different effective thresholds.
Part 14 – ANY with ActiveRecord Arrays
You may occasionally see PostgreSQL queries like:
SELECT*
FROM users
WHERE id =ANY(ARRAY[1,2,3]);
However, normal Rails code would usually use:
User.where(id: [1, 2, 3])
which generates an IN condition.
Don’t use PostgreSQL-specific syntax unless it provides a real advantage.
Part 15 – JOIN vs IN vs EXISTS
Requirement:
Find users who have completed orders.
JOIN
SELECTDISTINCT u.*
FROM users u
JOIN orders o
ON o.user_id = u.id
WHERE o.status ='completed';
Potential issue:
The join produces one row per matching order.
Therefore, duplicates may occur.
We use:
DISTINCT
IN
SELECT*
FROM users
WHERE id IN(
SELECT user_id
FROM orders
WHERE status ='completed'
);
No duplicate users in the outer result.
EXISTS
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
AND o.status ='completed'
);
Also no duplicate users.
How Should You Choose?
Use JOIN when:
You need columns from both tables.
You need to aggregate related rows.
You intentionally need matching rows.
Use EXISTS when:
You're asking whether a related row exists.
You don't need columns from the related table.
You want existence semantics without row multiplication.
Use IN when:
You're checking membership in a set of values.
The query reads naturally as "value belongs to this result set."
Do not choose solely based on old rules such as:
EXISTS is always faster than IN.
PostgreSQL’s optimizer is smarter than that.
Part 16 – Practical PostgreSQL Exercises
Let’s practice one query at a time.
Exercise 1
Find all orders above the global average order amount.
SELECT*
FROM orders
WHERE amount >(
SELECT AVG(amount)
FROM orders
);
Rails:
Order.where(
"amount > (?)",
Order.select("AVG(amount)")
)
Exercise 2
Find users who have orders.
SQL using IN:
SELECT*
FROM users
WHERE id IN(
SELECT user_id
FROM orders
);
Rails:
User.where(id:Order.select(:user_id))
Exercise 3
Find users who have orders using EXISTS.
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
Rails association-oriented alternative:
User.where.associated(:orders)
or:
User.joins(:orders).distinct
Exercise 4
Find users without orders.
SELECT*
FROM users u
WHERENOTEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
);
Rails:
User.where.missing(:orders)
Exercise 5
Find users who have at least one completed order greater than 400.
SELECT*
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
AND o.status ='completed'
AND o.amount >400
);
Try writing the ActiveRecord version yourself before looking below.
One option:
User
.joins(:orders)
.where(orders: { status:"completed" })
.where("orders.amount > ?", 400)
.distinct
Exercise 6
Find orders above the average order amount for that order’s user.
SELECT*
FROM orders o
WHERE o.amount >(
SELECT AVG(o2.amount)
FROM orders o2
WHERE o2.user_id = o.user_id
);
This is today’s most important correlated subquery exercise.
Run it and manually verify every returned row.
Part 17 – Common Mistakes
Mistake 1: Using = with a Multi-Row Subquery
Wrong:
WHERE id =(
SELECT user_id
FROM orders
)
If multiple rows are returned, PostgreSQL raises an error.
Use:
IN
or:
EXISTS
depending on the requirement.
Mistake 2: Using NOT IN Without Considering NULL
Potentially dangerous:
WHERE id NOTIN(
SELECT user_id
FROM some_table
)
If the subquery can return NULL, the result may surprise you.
Safer existence-oriented query:
WHERENOTEXISTS(...)
Mistake 3: Using pluck When You Want a SQL Subquery
Potentially inefficient:
User.where(id:Order.pluck(:user_id))
Better:
User.where(id:Order.select(:user_id))
when you want PostgreSQL to handle the operation as a subquery.
Mistake 4: Using JOIN + DISTINCT for Every Existence Check
User.joins(:orders).distinct
works.
But if your requirement is simply:
Does a matching row exist?
EXISTS more directly expresses the requirement.
Mistake 5: Assuming a Correlated Subquery Always Executes Once Per Row
Conceptually, we reason about it that way.
Physically, PostgreSQL may optimize it into:
Semi Join
Anti Join
Hash Join
Nested Loop
other execution strategies
Always distinguish:
SQL semantics
from:
physical execution plan
This distinction is very important for senior-level interviews.
Part 18 – Senior Interview Questions
Try answering these without looking back.
Q1
What is the difference between a normal subquery and a correlated subquery?
Q2
What happens if a scalar subquery returns multiple rows?
Q3
What’s the difference between:
Order.select(:user_id)
and:
Order.pluck(:user_id)
when used to build another query?
Q4
Why can NOT IN return zero rows when the subquery contains NULL?
Q5
What’s the difference between:
JOIN
and:
EXISTS
when one user has many matching orders?
Q6
Is EXISTS always faster than IN in PostgreSQL?
Q7
What is a semi-join?
Q8
What is an anti-join?
Q9
When would you use a subquery in the FROM clause instead of HAVING?
Q10
What is the difference between:
>ANY
and:
>ALL
Part 19 – Today’s Interview Challenge
Do not run this immediately.
First predict the result.
SELECT
u.id,
u.name
FROM users u
WHEREEXISTS(
SELECT1
FROM orders o
WHERE o.user_id = u.id
AND o.amount >(
SELECT AVG(o2.amount)
FROM orders o2
WHERE o2.user_id = u.id
)
);
Questions:
What does the innermost query calculate?
Is the innermost query correlated?
What does the middle EXISTS query check?
Which users will be returned?
Will a user with exactly one order be returned?
Why does this query not need DISTINCT?
Try to manually execute it for:
John
Mary
Bob
Alice
David
Sara
If you can reason through this query confidently, your understanding of SQL has moved beyond basic CRUD querying.
Homework
Use the users and orders tables.
Write both SQL and ActiveRecord for each exercise.
Find users who have at least one completed order.
Find users who have no completed orders.
Find orders greater than the global average order amount.
Find orders greater than the average order amount for their respective user.
Find users whose total order amount is greater than the average total spending across all users who have orders.
Find users who have an order greater than every order placed by John. Use ALL.
Find users who have an order greater than at least one order placed by Sara. Use ANY.
Rewrite “users without orders” using:
LEFT JOIN
NOT EXISTS
NOT IN
Then explain the NULL behavior of each approach.
Write a query using a subquery in FROM to calculate user totals, then join the derived table with users to display:
user name
total spent
Use EXPLAIN ANALYZE to compare:
IN
versus:
EXISTS
for finding users with orders.
Don’t worry if you can’t interpret the complete execution plan yet. Save the output – we’ll learn how to read it systematically.
Day 6 Preview
On Day 6, we’ll cover Indexes and EXPLAIN ANALYZE.
This is one of the most important transitions in the course because we’ll move from:
“Can I write the correct query?”
to:
“Can I explain why this query is fast or slow?”
We’ll cover:
How PostgreSQL stores tables and indexes conceptually
B-tree indexes
Single-column indexes
Composite indexes
Index selectivity
Sequential Scan
Index Scan
Bitmap Index Scan
EXPLAIN
EXPLAIN ANALYZE
Why PostgreSQL sometimes ignores an index
Indexes for foreign keys
Rails migrations for indexes
Query optimization interview questions
For a senior Rails interview, Day 6 is one of the highest-value lessons in the entire course.