12. The computer-implemented process of claim 10 wherein the adaptive range filter formatted in the trie format summarizes data values contained in a range of data, wherein each node of the trie represents a particular region of data, the root node of the trie represents a whole domain indexed, a parent node fully contains the regions of data of its children, and leaves contain occupied bits indicating whether data in the set of data exists in a particular region.
12. The computer-implemented process of claim 10 wherein the adaptive range filter formatted in the trie format summarizes data values contained in a range of data, wherein each node of the trie represents a particular region of data, the root node of the trie represents a whole domain indexed, a parent node fully contains the regions of data of its children, and leaves contain occupied bits indicating whether data in the set of data exists in a particular region. 19. The computer-implemented process of claim 12 wherein a trie of an adaptive range filter is encoded by: encoding each non-leaf intermediate node of the trie in breadth first traversal using two bits to indicate whether that node has 0, 1 or 2 children nodes, and encoding the occupied bits of the leaves.