作者: Hector Garcia-Molina , Narayanan Shivakumar , Chandra Chekuri
DOI:
关键词: Algorithm 、 Query optimization 、 Computer science 、 Predicate (grammar) 、 Theoretical computer science 、 Point (geometry)
摘要: Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, check if a point is within region (expensive predicate) we first bounding rectangle (approximate In general, approximate may have false positive and negative errors. this paper study problem selecting structuring in order cost processing user query, while keeping errors user-specified bounds. We model different types their dependencies, derive expressions for compound predicates, develop query optimization strategies. also complexity our strategies under various scenarios, present an experimental case that illustrates potential gains achieved optimizing queries with