Abstract: We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We also show - as a new result - that computing hypertree decompositions is fixed-parameter intractable.