Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
Kamesh Munagala, Utkarsh Srivastava, Jennifer Wido...
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...