Spatial Query Optimization: From Boolean Constraints to Range Queries

Systems of k Boolean inequations and a Boolean equation

“…Marriott and Odersky determinated satisfiability of system (2) in [8] . They applied this sistem for query optimization in databases [9]. These results are presented in [6].…”

An informal introduction to constraint database systems (extended abstract)

“…These techniques essentially work as follows: The constraints derived during the first step, are propagated in the second step to ensure their early application (Mumick et al 1990;Srivastava and Ramakrishnan 1992;Levy and Sagiv 1992;Kemp and Stuckey 1993;Stuckey and Sudarshan 1994). Helm, Marriott, and Odersky (1995) study optimization of spatial queries composed of Boolean constraints. Their optimization decomposes a given query, composed of n spatial variables into a sequence of one variable range queries.…”