A NEW DATA STRUCTURE (CLUSTER SKIP LISTS) FOR EXTREMELY FAST HANDLING OF NUMBERS

摘要

This paper discusses about a design for a new data structure that is capable of handling extremely fast storage of numbers, retrieving numbers and also searching for numbers. This structure has been designed for applications where numbers need to be stored dynamically, and where the input can be random, where the first digit that needs to be stored can be al digit number, the next can be a 20 digit number and so on. The design ensures that both the structure space, as well as operation time is minimum.rnWe shall see with specific examples, as to how this structure far exceeds the capabilities of skip lists in its performance in terms of operation time. The only restriction or disadvantage of this structure is that this high performance is possible only for operations involving numbers. But I am sure that this restriction can be easily overcome in the near future.rnThis new structure has been explained using three dimentional diagrams for easy understanding. Any suitable programming language can be used to implement this structure.