Afficher un message
Vieux 28/03/2008, 20h17   #1
robpoz
Aucun Avatar
 
Messages: n/a
Hébergeur:
Par défaut with table design for fast range based queries

We're designing an application where we need to determine if a specified ip
address (represented as a bigint) is between a iplow and iphigh column we've
got in a sql/server table.

Currently I've got iplow and iphigh columns defined as bigint. I've also
created a clustered, unique index containing both iplow and iphigh columns.
We've got slightly over 5 million rows in our table.

How can we ideally design the table/indexes to make these queries execute as
quickly as possible. Queries such as:

select * from ip2location where iplow > 12345 and iphigh < 678910

these queries are also slow.

Thanks.

Rob


select * from ip2location where 1288141274 between iplow and
iphigh

can take up to 20 seconds to return 1 row!

I've also tried range based queries ie:


  Réponse avec citation
 
Page generated in 0,05142 seconds with 9 queries