Data Integrity Institute Inc. has developed and through research continues to systematically improve upon some of the most efficient sorting algorithm based on advanced nanotechnology research.
Today's major database and ETL engines use comparison based sorting algorithms derived from the well known quick sort, heap sort, merge sort, etc., algorithms. All of these comparison based algorithms operate on the item level, utilizing multiple active and passive comparisons per item.
Active comparison compares a selected item with other items by calling comparison functions customized to handle a comparison for a particular item type, which returns three possible outcomes: equal (0), greater than (+1), or less than (-1). The comparison process can be very slow because of the need to compare each item to other items multiple times and especially because of the customized comparison function call overhead.
Passive comparison checks each item several times for the position of that item in the memory array and/or in the file to ensure that that item is within its expected boundaries. This is done to eventually swap compared items and for many other purposes. The position of an item is represented by an integer, but it is still time consuming to perform the checks several times for each item.
Through its nanotechnology research initiative, Data Integrity Institute Inc. has developed the most efficient sorting algorithm that does not operate on the item level, but rather on the item sub level (nano level), and never performs either active or passive comparison of items. With such fine granulation there is no overhead making the sorting process fast and efficient.
