TREE is an optimized RETE-like pattern-matching algorithm. It has been designed for a production system whose restricted data formalism leads to a highly combinatorial join step like in SOAR. TREE aims at reducing the join search spaces without using hashing techniques. Its join strategy uses constraint propagation to define the solution space of a join, then a constraint relaxation to determin...

Applications running on parallel systems often need to join a streaming relation or a stored relation with data indexed in a parallel data storage system. Some applications also compute UDFs on the joined tuples. The join can be done at the data storage nodes, corresponding to reduce side joins, or by fetching data from the storage system to compute nodes, corresponding to map side join. Both m...

| Existing methods for spatial joins require pre-existing spatial indices or other pre-computation, but such approaches are ineecient and limited in generality. Operand datasets of spatial joins may not all have pre-computed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, ...

Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets of spatial joins may not all have precomputed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, a...

Aspect-oriented programming (AOP) has been proposed for improving the modularity of implementations that cannot be encapsulated with traditional means, so called crosscutting concerns. It introduces new adaptation concepts that allow the structural extension of implementation modules and the adaptation of existing program behavior. The adaptation concepts are often achieved by new language mech...

One of the fundamental tasks that data warehouse (DW) administrator needs to perform during the physical design is to select the right indexes to speed up her/his queries. Two categories of indexes are available and supported by the main DBMS vendors: (i) indexes defined on a single table and (ii) indexes defined on multiple tables such as join indexes, bitmap join indexes, etc. Selecting relev...