15 results about "Skip list" patented technology

In computer science, a skip list is a data structure that allows O(logn) search complexity as well as O(logn) insertion complexity within an ordered sequence of n elements. Thus it can get the best of array (for searching) while maintaining a linked list-like structure that allows insertion- which is not possible in an array. Fast search is made possible by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one (see the picture below on the right).