The dynamic query approach lends itself well to this problem. Dynamic queries involve range searches on multi-key data sets.
Users directly manipulate slider or button widgets to specify ranges for each key value.
Within a dynamic query interface, changes to query fields are reflected in a visual display of the data almost instantaneously, usually within 100 ms. To reduce lengthy network delays due to the transfer of enormous volumes of data, we plan to implement a two-level query architecture. The initial level will allow the user to narrow the query selection on a coarser scope, while the second refined query level will allow users to locally view and manipulate the previously selected data subset. Because of the need for immediate feedback and display, efficient query computation must be supported using suitable data structures and search algorithms. According to their results, the multilist performs well for uniformly distributed data, but its high storage overhead only lends itself well to small data sets.