Indexing of static and dynamic sets is fundamental to a large set applications such as information retrieval caching. Denoting the characteristic vector by B , we consider problem encoding multisets support approximate versions operations rank ( i ) (i.e., computing ∑ j ≤ [ ] select finding min ⁡ { p | ≥ } queries. We study multiple types approximations (allowing an error in query or result) pr...