Sorting stability refers to the property of a sorting algorithm that maintains the relative order of records with equal keys. This is crucial in scenarios where multiple sorting criteria are applied sequentially, ensuring that the outcome of previous sorts is preserved.