﻿<?xml version='1.0' encoding='UTF-8'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/"><channel><title>SQLServerCentral / Discuss Content Posted by Lee Everest / Article Discussions / Article Discussions by Author  / Bitmasking...Interesting Implementation in a Relational DB / Latest Posts</title><generator>InstantForum.NET v2.9.0</generator><description>SQLServerCentral</description><link>http://www.sqlservercentral.com/Forums/</link><webMaster>notifications@sqlservercentral.com</webMaster><lastBuildDate>Tue, 21 May 2013 13:51:30 GMT</lastBuildDate><ttl>20</ttl><item><title>Bitmasking...Interesting Implementation in a Relational DB</title><link>http://www.sqlservercentral.com/Forums/Topic344401-335-1.aspx</link><description>&lt;P&gt;Lee,&lt;/P&gt;&lt;P&gt;  I found your article very intriguing.  The idea of bitmasking use hex values is indeed an old technique.  Back when programmers actually cared about memory and disk space; back when you had to.  Today's programmers take this for granted and create bloated programs that cost the end user gigabytes of space and a trip to the local computer shack for more RAM.&lt;/P&gt;&lt;P&gt;  Your article reminds us how to maximize space by representing data in hex format.  Actually reminds me a lot of IPV6 and all the hex values now used in this protocol.  Hex allows us to represent far more data in less space.  Even the authors of IPV4 learned this the hard way.  Now we use Hex for IPV6, Ok lessoned learned.&lt;/P&gt;&lt;P&gt;  Again great article and as far as using a DB for this, who cares? A DB is a data repository key word being data just as the file system (e.g. Windows registry) is used as a repository, or memory (temporary, however it is), and XML.&lt;/P&gt;&lt;P&gt;Fantastic!&lt;/P&gt;&lt;P&gt;- M. Ross&lt;/P&gt;</description><pubDate>Mon, 12 Feb 2007 18:27:00 GMT</pubDate><dc:creator>Matthew Ross</dc:creator></item></channel></rss>