The invention discloses an efficient novel memory index structure
processing method. The method comprises the steps of before the
skip list processing, calculating the query distribution and the datadistribution conditions through the statistical information; selecting the sentinel nodes inserted into a
skip list structure; obtaining an optimal
sentinel node configuration result by solving the minimum average operation cost of a
skip list after the nodes are inserted; inserting the sentinel nodes into the bottom-layer skip
list structure, then establishing an upper-layer CSB + tree structurefrom bottom to top through a Bulkload method after the sentinel nodes in the bottom-layer skip
list structure are completely inserted, and quickly positioning the sentinel nodes; and for each piece ofdata needing to be queried or inserted, finding the nearest sentry node through the upper-layer CSB +
tree structure, and starting to operate the skip
list from the nearest sentry node. According tothe method, on the basis of reserving the advantages of simple implementation, good
concurrency, suitability for range query and the like of a traditional skip list structure, the cache
utilization rate of the whole operation process is improved, so that the memory index performance is obviously improved.