1. A method of efficiently representing ranged data sets in a memory system, the method comprising: storing, in the memory system, a data structure comprising one or more nodes, wherein: the data structure comprises a binary tree data structure; each of the one or more nodes represents a unique range of numeric values by storing an upper bound and a lower bound of the range of numeric values; none of the ranges of numeric values represented by the one or more nodes overlap; and none of the ranges of numeric values represented by the one or more nodes are adjacent; receiving, at a computer system coupled to the memory system, a first range of numeric values to add to the data structure or to remove from the data structure; altering, by the computer system, the upper bound or lower bound of at least one node in the one or more nodes to represent the addition or removal of the first range of numeric values such that: none of the ranges of numeric values represented by the one or more nodes overlap; and none of the ranges of numeric values represented by the one or more nodes are adjacent; and receiving, at the computer system coupled to the memory system, a second range of numeric values to add to the data structure.