SQL中Group分組獲取Top N方法實(shí)現(xiàn)可首選row_number
發(fā)布日期:2022-01-04 10:19 | 文章來源:腳本之家
復(fù)制代碼 代碼如下:
CREATE TABLE [dbo].[products](
[id] [int] IDENTITY(1,1) NOT NULL,
[name] [nvarchar](50) NULL,
[addtime] [datetime] NULL,
[city] [nvarchar](10) NULL,
CONSTRAINT [PK_products] PRIMARY KEY CLUSTERED
(
[id] ASC
)WITH (PAD_INDEX = OFF, STATISTICS_NORECOMPUTE = OFF, IGNORE_DUP_KEY = OFF, ALLOW_ROW_LOCKS = ON, ALLOW_PAGE_LOCKS = ON) ON [PRIMARY]
) ON [PRIMARY]
1、采用row_number方法,執(zhí)行5次,平均下來8秒左右,速度最快。
復(fù)制代碼 代碼如下:
select no, id,name,city
from (select no =row_number() over (partition by city order by addtime desc), * from products)t
where no< 11 order by city asc,addtime desc
2、采用cross apply方法,執(zhí)行了3次,基本都在3分5秒以上,已經(jīng)很慢了。
復(fù)制代碼 代碼如下:
select distinct b.id,b.name,b.city from products a
cross apply (select top 10 * from products where city = a.city order by addtime desc) b
3、采用Count查詢,只執(zhí)行了兩次,第一次執(zhí)行到5分鐘時,取消任務(wù)執(zhí)行了;第二次執(zhí)行到13分鐘時,沒有hold住又直接停止了,實(shí)在無法忍受。
復(fù)制代碼 代碼如下:
select id,name,city from products a
where ( select count(city) from products where a.city = city and addtime>a.addtime) < 10
order by city asc,addtime desc
4、采用游標(biāo)方法,這個最后測試的,執(zhí)行了5次,每次都是10秒完成,感覺還不錯。
復(fù)制代碼 代碼如下:
declare @city nvarchar(10)
create table #Top(id int,name nvarchar(50),city nvarchar(10),addtime datetime)
declare mycursor cursor for
select distinct city from products order by city asc
open mycursor
fetch next from mycursor into @city
while @@fetch_status =0
begin
insert into #Top
select top 10 id,name,city,addtime from products where city = @city
fetch next from mycursor into @city
end
close mycursor
deallocate mycursor
Select * from #Top order by city asc,addtime desc
drop table #Top
通過上述對比不難發(fā)現(xiàn),在面臨Group獲取Top N場景時,可以首選row_number,游標(biāo)cursor其次,另外兩個就基本不考慮了,數(shù)據(jù)量大的時候根本沒法使用。
版權(quán)聲明:本站文章來源標(biāo)注為YINGSOO的內(nèi)容版權(quán)均為本站所有,歡迎引用、轉(zhuǎn)載,請保持原文完整并注明來源及原文鏈接。禁止復(fù)制或仿造本網(wǎng)站,禁止在非www.sddonglingsh.com所屬的服務(wù)器上建立鏡像,否則將依法追究法律責(zé)任。本站部分內(nèi)容來源于網(wǎng)友推薦、互聯(lián)網(wǎng)收集整理而來,僅供學(xué)習(xí)參考,不代表本站立場,如有內(nèi)容涉嫌侵權(quán),請聯(lián)系alex-e#qq.com處理。
相關(guān)文章