Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...