<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>数据库索引 on Answer</title>
    <link>https://answer.freetools.me/tags/%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B4%A2%E5%BC%95/</link>
    <description>Recent content in 数据库索引 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sat, 07 Mar 2026 14:02:59 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B4%A2%E5%BC%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>分页设计的三十年陷阱：从OFFSET的性能灾难到Cursor的工程突围</title>
      <link>https://answer.freetools.me/%E5%88%86%E9%A1%B5%E8%AE%BE%E8%AE%A1%E7%9A%84%E4%B8%89%E5%8D%81%E5%B9%B4%E9%99%B7%E9%98%B1%E4%BB%8Eoffset%E7%9A%84%E6%80%A7%E8%83%BD%E7%81%BE%E9%9A%BE%E5%88%B0cursor%E7%9A%84%E5%B7%A5%E7%A8%8B%E7%AA%81%E5%9B%B4/</link>
      <pubDate>Sat, 07 Mar 2026 14:02:59 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%88%86%E9%A1%B5%E8%AE%BE%E8%AE%A1%E7%9A%84%E4%B8%89%E5%8D%81%E5%B9%B4%E9%99%B7%E9%98%B1%E4%BB%8Eoffset%E7%9A%84%E6%80%A7%E8%83%BD%E7%81%BE%E9%9A%BE%E5%88%B0cursor%E7%9A%84%E5%B7%A5%E7%A8%8B%E7%AA%81%E5%9B%B4/</guid>
      <description>深入剖析API分页设计的核心问题。从OFFSET在大数据量下的线性性能下降原理，到Cursor分页如何利用B-tree索引实现O(1)复杂度。基于Slack、Stripe、Twitter、GitHub等公司的实践，分析数据一致性、非唯一排序导致的行丢失、COUNT查询开销等陷阱，并提供不同场景下的分页策略选择框架。</description>
    </item>
    <item>
      <title>为什么数据库索引选择B&#43;树而不是Hash？从磁盘IO特性到范围查询的技术真相</title>
      <link>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B4%A2%E5%BC%95%E9%80%89%E6%8B%A9b-%E6%A0%91%E8%80%8C%E4%B8%8D%E6%98%AFhash%E4%BB%8E%E7%A3%81%E7%9B%98io%E7%89%B9%E6%80%A7%E5%88%B0%E8%8C%83%E5%9B%B4%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%8A%80%E6%9C%AF%E7%9C%9F%E7%9B%B8/</link>
      <pubDate>Sat, 07 Mar 2026 05:05:02 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B4%A2%E5%BC%95%E9%80%89%E6%8B%A9b-%E6%A0%91%E8%80%8C%E4%B8%8D%E6%98%AFhash%E4%BB%8E%E7%A3%81%E7%9B%98io%E7%89%B9%E6%80%A7%E5%88%B0%E8%8C%83%E5%9B%B4%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%8A%80%E6%9C%AF%E7%9C%9F%E7%9B%B8/</guid>
      <description>为什么数据库索引选择B&#43;树而不是Hash？从磁盘IO特性到范围查询的技术真相</description>
    </item>
    <item>
      <title>索引越多查询越慢？从写入放大到优化器误判的完整技术解析</title>
      <link>https://answer.freetools.me/%E7%B4%A2%E5%BC%95%E8%B6%8A%E5%A4%9A%E6%9F%A5%E8%AF%A2%E8%B6%8A%E6%85%A2%E4%BB%8E%E5%86%99%E5%85%A5%E6%94%BE%E5%A4%A7%E5%88%B0%E4%BC%98%E5%8C%96%E5%99%A8%E8%AF%AF%E5%88%A4%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8A%80%E6%9C%AF%E8%A7%A3%E6%9E%90/</link>
      <pubDate>Fri, 06 Mar 2026 21:42:59 +0800</pubDate>
      <guid>https://answer.freetools.me/%E7%B4%A2%E5%BC%95%E8%B6%8A%E5%A4%9A%E6%9F%A5%E8%AF%A2%E8%B6%8A%E6%85%A2%E4%BB%8E%E5%86%99%E5%85%A5%E6%94%BE%E5%A4%A7%E5%88%B0%E4%BC%98%E5%8C%96%E5%99%A8%E8%AF%AF%E5%88%A4%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8A%80%E6%9C%AF%E8%A7%A3%E6%9E%90/</guid>
      <description>从B-tree的页分裂机制到缓冲池竞争，从优化器基数估计到索引碎片化，深度解析索引隐藏成本的完整技术链条。基于PostgreSQL基准测试数据、pganalyze写入开销模型、SQL Server索引维护指南等权威信源，揭示&amp;#34;索引越多越好&amp;#34;这一认知误区背后的技术真相，以及读密集与写密集场景下的索引设计权衡。</description>
    </item>
  </channel>
</rss>
