IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS
A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list....
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Education for Women
2019-02-01
|
| Series: | مجلة كلية التربية للبنات |
| Online Access: | http://jcoeduw.uobaghdad.edu.iq/index.php/journal/article/view/1054 |
| _version_ | 1828553830452690944 |
|---|---|
| author | Maha shakir Ibrahim |
| author_facet | Maha shakir Ibrahim |
| author_sort | Maha shakir Ibrahim |
| collection | DOAJ |
| description | A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank. |
| first_indexed | 2024-12-12T05:25:26Z |
| format | Article |
| id | doaj.art-23e97684c9e44310a377dc11b6071845 |
| institution | Directory Open Access Journal |
| issn | 1680-8738 2663-547X |
| language | Arabic |
| last_indexed | 2024-12-12T05:25:26Z |
| publishDate | 2019-02-01 |
| publisher | College of Education for Women |
| record_format | Article |
| series | مجلة كلية التربية للبنات |
| spelling | doaj.art-23e97684c9e44310a377dc11b60718452022-12-22T00:36:29ZaraCollege of Education for Womenمجلة كلية التربية للبنات1680-87382663-547X2019-02-01242IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONSMaha shakir IbrahimA skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.http://jcoeduw.uobaghdad.edu.iq/index.php/journal/article/view/1054 |
| spellingShingle | Maha shakir Ibrahim IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS مجلة كلية التربية للبنات |
| title | IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS |
| title_full | IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS |
| title_fullStr | IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS |
| title_full_unstemmed | IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS |
| title_short | IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS |
| title_sort | implementation of the skip list data structure with it s update operations |
| url | http://jcoeduw.uobaghdad.edu.iq/index.php/journal/article/view/1054 |
| work_keys_str_mv | AT mahashakiribrahim implementationoftheskiplistdatastructurewithitsupdateoperations |