Tagged articles

311 articles

Page 4 of 4

Jun 30, 2017 · Frontend Development

Understanding Pagination: Traditional vs. Infinite Scrolling and How to Implement Them

This article explains the differences between traditional page‑number pagination and infinite‑scroll (streaming) pagination, compares their characteristics, and provides detailed front‑end and back‑end implementation methods along with common pitfalls and optimization techniques such as caching, cursor‑based paging, and client‑side deduplication.

back-end developmentcache optimizationcursor pagination

0 likes · 12 min read

Understanding Pagination: Traditional vs. Infinite Scrolling and How to Implement Them

dbaplus Community

Jun 22, 2017 · Databases

Turning a 5‑Second Oracle Pagination Query into Sub‑Second Speed

This article walks through a real‑world Oracle pagination query that took over five seconds for just fifteen rows, analyzes why ORDER BY caused the slowdown, and demonstrates a step‑by‑step rewrite using a WITH clause and index‑driven access that reduces execution time to under one second.

OracleSQLindex

0 likes · 10 min read

Turning a 5‑Second Oracle Pagination Query into Sub‑Second Speed

Suning Design

May 27, 2017 · Frontend Development

When to Use Pagination, Load More, or Infinite Scroll? A Data‑Driven Design Guide

This article examines the usability trade‑offs of pagination, "load more" buttons, and infinite scroll, referencing Baymard research to help designers choose the most effective data‑loading interaction for their product's context and improve overall user experience.

DesignUXfrontend

0 likes · 7 min read

When to Use Pagination, Load More, or Infinite Scroll? A Data‑Driven Design Guide

ITPUB

Mar 7, 2017 · Databases

Why MySQL LIMIT Pagination Slows Down and How to Speed It Up with Covering Indexes

This article examines the performance problems of MySQL LIMIT pagination on a table with over 800,000 rows, demonstrates timing tests for various offsets, and presents covering‑index techniques that dramatically reduce query time, including practical SQL examples.

LIMITcovering indexmysql

0 likes · 6 min read

Why MySQL LIMIT Pagination Slows Down and How to Speed It Up with Covering Indexes

ITPUB

Aug 31, 2016 · Databases

Taming Black‑Swan Database Failures: Pagination, Join, and Count(*) Optimizations

The article examines how unpredictable "black‑swan" incidents caused by slow, high‑frequency queries can destabilize database systems and presents concrete MySQL optimization techniques for large pagination, join operations, and concurrent count(*) queries that reduced slow‑query volume by about ninety percent.

Count OptimizationJOIN optimizationmysql

0 likes · 9 min read

Taming Black‑Swan Database Failures: Pagination, Join, and Count(*) Optimizations

Qunar Tech Salon

Jul 8, 2016 · Databases

Optimizing MySQL Pagination for Large Datasets

The article explains why traditional LIMIT OFFSET pagination becomes inefficient on large MySQL tables, analyzes the performance impact of counting rows and using SQL_CALC_FOUND_ROWS, and presents several optimized techniques—including index‑based counting, keyset pagination, page‑number caching, and temporary‑table approaches—to achieve fast and scalable pagination.

Database OptimizationSQLmysql

0 likes · 8 min read

Optimizing MySQL Pagination for Large Datasets

Java High-Performance Architecture

Jan 16, 2016 · Databases

How to Efficiently Paginate Across Sharded Databases Without Heavy Overhead

This article explains a practical method for performing pagination on a sharded table by querying each database up to the target offset, merging and sorting the results, and extracting the required page while discussing performance drawbacks and an optimization when data distribution is uniform.

SQLdistributed databasespagination

0 likes · 5 min read

How to Efficiently Paginate Across Sharded Databases Without Heavy Overhead

ITPUB

Nov 23, 2015 · Databases

Why MySQL LIMIT with ORDER BY on Non‑Unique Columns Is Unstable and How to Fix It

In MySQL 5.6, using LIMIT together with ORDER BY on a non‑unique column can produce nondeterministic result sets, a known bug that persists regardless of indexing, and the article shows how adding a secondary unique sort key resolves the uncertainty for reliable pagination.

Database BugLIMITOrder By

0 likes · 6 min read

Why MySQL LIMIT with ORDER BY on Non‑Unique Columns Is Unstable and How to Fix It

21CTO

Oct 23, 2015 · Databases

How to Efficiently Paginate 100M User IDs in MySQL

This article examines three SQL pagination strategies for a 100‑million‑row favorites table, compares their correctness and performance using EXPLAIN analysis, and demonstrates why a GROUP BY approach with proper indexing yields the most reliable and fast results.

Large DataSQLindex

0 likes · 5 min read

How to Efficiently Paginate 100M User IDs in MySQL

21CTO

Aug 10, 2015 · Backend Development

Designing Practical RESTful APIs: Best Practices for Real‑World Apps

This article presents practical guidelines for designing, versioning, securing, and documenting RESTful APIs, covering resource modeling, URL conventions, filtering, sorting, pagination, authentication, rate limiting, error handling, and response formats to help developers build flexible and user‑friendly public APIs.

BackendHTTPRESTful API

0 likes · 22 min read

Designing Practical RESTful APIs: Best Practices for Real‑World Apps

Java High-Performance Architecture

Jul 2, 2015 · Databases

Boost MySQL Pagination: Fast Alternatives to LIMIT OFFSET

Using LIMIT OFFSET for pagination becomes inefficient beyond thousands of rows, but by leveraging indexed ID ranges, delayed joins, or index‑only scans you can retrieve pages in milliseconds, dramatically improving performance for large datasets.

SQLindexoptimization

0 likes · 2 min read

Boost MySQL Pagination: Fast Alternatives to LIMIT OFFSET