using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using java.io;
using edu.stanford.nlp.process;
using edu.stanford.nlp.ling;
using edu.stanford.nlp.trees;
using edu.stanford.nlp.parser.lexparser;
using Console = System.Console;
nam
我有一个简单的示例books表,其中包含一个整数id主键("books_pkey" PRIMARY KEY, btree (id))和100,000,000行随机行。如果我跑:
EXPLAIN
SELECT *
FROM books
ORDER BY id
OFFSET 99999999
LIMIT 1;
我看到的查询计划如下:
Limit (cost=3137296.54..3137296.57 rows=1 width=14)
-> Index Scan using books_pkey on books (cost=0.57..3137296.57 r