1. A computer-implemented process to summarize data, comprising: creating a trie-structure to index the data wherein: each node of the trie-structure represents a particular region of a domain of the data, a root node represents the whole domain of data to be indexed, each parent node fully contains the regions of its children in the trie-structure, and leaves of the trie-structure contain occupied bits indicating whether tuples in the set of data exist in the particular region of data.
1. A computer-implemented process to summarize data, comprising: creating a trie-structure to index the data wherein: each node of the trie-structure represents a particular region of a domain of the data, a root node represents the whole domain of data to be indexed, each parent node fully contains the regions of its children in the trie-structure, and leaves of the trie-structure contain occupied bits indicating whether tuples in the set of data exist in the particular region of data. 2. The computer-implemented process of claim 1 , further comprising: processing a query using the trie-structure by inspecting all leaf nodes that overlap with a range specified in the query; if the occupied bit of one of the leaf nodes is set then processing the query on the data set, otherwise deducing that the data set contains no relevant data for that query.