Thus, data contained in some sub-region must be retrieved. This type of query is called a region query. The special case of a region of zero area is called a point query. A chip is typically described by a large collection of polygons organized in layers. Determining the components connected by such a via requires the resolution of a point query.
Similar problems arise in other areas as well.
Recent advances in data warehousing have made this type of query important to handle. Support in this area is especially challenging since the number of dimensions is on the order of tens to hundreds. Parallel R-trees, I. Kamel, C. Faloutsos, Proc. An improved R-tree Using Fractals, I. Kamel, C. Faloutsos, Proc. If you have ideas for projects or collaborations with those related program areas within the IDM, describe some of them briefly here.