On Thursday, March 13, 2025, Durgamahesh Manne <maheshpostgr...@gmail.com> wrote:
> > > ------------------------------------------------------------ >>>>> ------------------------------------------------------------ >>>>> ------------------------------------------------------------ >>>>> -------------------------------------- >>>>> >>>> Result (cost=2.80..2.83 rows=1 width=1) (actual time=0.029..0.030 >>> rows=1 loops=1) >>> InitPlan 1 (returns $0) >>> -> Index Only Scan using idx_cachekeys on cachekeys >>> (cost=0.55..2.80 rows=1 width=0) (actual time=0.028..0.028 rows=1 loops=1) >>> Index Cond: ((cachetype = 'BoMatrix'::text) AND (trsid = >>> 'daznbetuk'::text) AND (brandid = 'daznbet'::text) AND (sportid = >>> 'BOX'::text) AND (competitionid = 'U-1998'::text) AND (eventid = >>> 'U-523596'::text)) >>> Heap Fetches: 1 >>> Planning Time: 0.084 ms >>> Execution Time: 0.043 ms >>> >> >> >> To return one row takes 43ms is not optimal >> > You are off by a factor of 1000 in your claimed performance. It’s 0.043ms David J.
