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. 3. The computer-implemented process of claim 1 further comprising processing multiple queries using the trie-structure and using the results of processing the multiple queries to construct a trie of minimal size that results in no false positives for the multiple queries.