Skip to content

Commit be737dd

Browse files
Tweaks
1 parent 77b1fbf commit be737dd

2 files changed

Lines changed: 11 additions & 8 deletions

File tree

content/learning-paths/servers-and-cloud-computing/bitmap_scan_sve2/01-introduction.md

Lines changed: 10 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,23 +1,27 @@
11
---
22
# User change
3-
title: "Optimize bitmap scanning with SVE and NEON on Arm servers"
3+
title: "Optimize bitmap scanning in databases with SVE and NEON on Arm servers"
44

55
weight: 2
66

77
layout: "learningpathall"
88
---
9-
## Introduction
9+
## Overview
1010

11-
Bitmap scanning is a fundamental operation in database systems — used in bitmap indexes, bloom filters, and column filters — but it can bottleneck complex analytical queries. In this Learning Path, you'll learn how to speed up these operations using Arm's SVE and NEON vector instructions, especially on Neoverse V2–based servers like AWS Graviton4.
11+
Bitmap scanning is a core operation in many database systems. It's essential for powering fast filtering in bitmap indexes, Bloom filters, and column filters. However, these scans can become performance bottlenecks in complex analytical queries.
1212

13-
In this Learning Path, you will:
13+
In this Learning Path, you’ll learn how to accelerate bitmap scanning using Arm’s vector processing technologies - NEON and SVE - on Neoverse V2–based servers like AWS Graviton4.
14+
15+
Specifically, you will:
1416

1517
* Explore how to use SVE instructions on Arm Neoverse V2–based servers like AWS Graviton4 to optimize bitmap scanning
1618
* Compare scalar, NEON, and SVE implementations to demonstrate the performance benefits of specialized vector instructions
1719

1820
## What is bitmap scanning in databases?
1921

20-
Bitmap scanning involves searching through a bit vector to find positions where bits are set (1) or unset (0). In database systems, bitmaps are commonly used to represent:
22+
Bitmap scanning involves searching through a bit vector to find positions where bits are set (`1`) or unset (`0`).
23+
24+
In database systems, bitmaps are commonly used to represent:
2125

2226
* **Bitmap Indexes**: each bit represents whether a row satisfies a particular condition
2327
* **Bloom Filters**: probabilistic data structures used to test set membership
@@ -31,7 +35,7 @@ Here's how vector processing has evolved to improve bitmap scanning performance:
3135

3236
* **Generic Scalar Processing**: traditional bit-by-bit processing with conditional branches
3337
* **Optimized Scalar Processing**: byte-level skipping to avoid processing empty bytes
34-
* **NEON**: fixed-length 128-bit SIMD processing with vector operations
38+
* **NEON**: fixed-width 128-bit SIMD processing with vector operations
3539
* **SVE**: scalable vector processing with predication and specialized instructions like MATCH
3640

3741
## Set up your Arm development environment
@@ -52,7 +56,6 @@ An effective way to achieve optimal performance on Arm is not only through optim
5256
{{% /notice %}}
5357

5458

55-
5659
Create a directory for your implementations:
5760
```bash
5861
mkdir -p bitmap_scan

content/learning-paths/servers-and-cloud-computing/bitmap_scan_sve2/_index.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ title: Accelerate Bitmap Scanning with NEON and SVE Instructions on Arm servers
33

44
minutes_to_complete: 20
55

6-
who_is_this_for: This is an introductory topic for database developers, performance engineers, and anyone optimizing data processing workloads on Arm-based cloud instances.
6+
who_is_this_for: This is an introductory topic for database developers, performance engineers, and anyone interested in optimizing data processing workloads on Arm-based cloud instances.
77

88

99
learning_objectives:

0 commit comments

Comments
 (0)