Groups | Blog | Home
all groups > sql server (alternate) > march 2004 >

sql server (alternate) : bitmap indexing in MS SQL Server 2000


DellaCroce
3/13/2004 11:23:50 PM
Can anyone point me towards information about bitmap indexing in SQL Server
2000. (before you ask, this has nothing to do with image files or fields,
it is a type of indexing used for low cardinality field indexing). I am
working on a Data Warehouse project and this came up as an issue, and I
would like to answer it with some intelligence. :-)

Also has anyone heard of bitslice indexing? This is a new one on me.

Thanks

Greg

oj
3/14/2004 5:41:03 AM
Please take a look at this article:
http://msdn.microsoft.com/library/en-us/dnsql2k/html/sqlbitmaps.asp?frame=true

--
-oj
http://www.rac4sql.net


[quoted text, click to view]

Gert-Jan Strik
3/14/2004 6:44:24 PM
[quoted text, click to view]

SQL-Server only has B-Tree indexes, no bitmap indexes.

However, SQL-Server does have index intersection. I once did a small
experiment with a table that had many columns with just a few values,
and all those columns were individually indexed, and SQL-Server did a
very good job using index intersection (using hasing and hash teams).

[quoted text, click to view]

Sorry, never heard of that.

Gert-Jan

[quoted text, click to view]

--
AddThis Social Bookmark Button