Abstract:
A new approach is proposed to development of query processing algorithms which are represented as relation algebra expressions so as to reduce the processing time through fragmentation of relation expressions (representations of relation expressions as a sequence of simpler expressions) and subsequent simplification of these expressions by using secondary indexation of the attributes of the relations being processed.