An Efficient Mechanism for Deep Web Data Extraction Based on Tree-Structured Web Pattern Matching

Algorithm 1

Matrix alignment procedure.

Step 1: Begin.

Step 2: Assign row =1 and shiftLength =0 for Matrix M.

Step 3: If (M! = align) then.

Step 4: Align alignedRow (row, M).

Step 5: ShiftColumn (row, shiftLength, 1.

Step 6: M = (row, ShiftColumn, shiftLength).

Step 7: Return M.

Step 8: Else.

Step 9: Increment Row (row = row +1).

Step 10: Go to step.

Step 11: End If.

Step 12: Assign Child leaf node with alignment result (M).

Step 13: End.