The constraint satisfaction problem is in general NP-hard. As such, our aim is to identify tractable classes of constraint
satisfaction problem instances (CSPs). Tractable classes of CSPs are normally described by limiting either the structure or
the language of the CSPs. Structural decomposition methods identify CSPs whose reduction to the acyclic class is bound by
a polynomial. These structural decompositions have been a very useful way to identify large tractable classes.
However, these decomposition techniques have not yet been applied to relational tractability results. In this paper we introduce
the notion of a typed guarded decomposition as a way to generalize the structural decompositions. We develop a no-promise
algorithm which derives large new tractable classes of CSPs that are not describable as purely structural nor purely relational
classes.