{"id":12935,"date":"2021-11-30T19:15:24","date_gmt":"2021-12-01T00:15:24","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12935"},"modified":"2026-06-02T14:59:25","modified_gmt":"2026-06-02T18:59:25","slug":"tr-97-07-the-swap-with-parent-scheme-a-self-organizing-sequential-search-algorithm-which-uses-non-lexicograhic-heaps","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-07-the-swap-with-parent-scheme-a-self-organizing-sequential-search-algorithm-which-uses-non-lexicograhic-heaps\/","title":{"rendered":"TR-97-07: The Swap-with-Parent Scheme: A Self-Organizing Sequential Search Algorithm which Uses Non-lexicograhic Heaps"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-97-07: The Swap-with-Parent Scheme: A Self-Organizing Sequential Search Algorithm which Uses Non-lexicograhic Heaps\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

Carleton University
\nTechnical Report<\/a> TR-97-07
\nMay 1997<\/p>\n\n\n\n

TR-97-07: The Swap-with-Parent Scheme: A Self-Organizing Sequential Search Algorithm which Uses Non-lexicograhic Heaps *<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
B. John Oommen & Juan Dong<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

t-A common drawback to all the reported self-organizing sequeI_!.tial search algorithms is that they all fail to consider the size of the list when reorganizing it. The two extremes are the well-known and most commonly analyzed algorithms, the move-to-front rule and the transposition rule. This paper presents two new memory\u00adfree self-organizing sequential search algorithms, both of which overcome this draw\u00adback. The first algorithm is called swap-with-parent (SWP) and the second is called move-to-parent (MTP). Under the swap-with-parent heuristic, the accessed record is exchanged with its “parent” ( considering the list as a heap structure with no ordering constraints between parents and their children) and all the other records are untouched. whereas under the move-to-parent heuristic, the accessed record is moved to its parent’s positions and all the records in between get shifted back one position. It is shown that under the SWP heuristic, the Markov chain representing the scheme is time reversible. This property allows us to derive its asymptotic equi\u00adlibrium probabilities a rather complicated expression for its average search cost. We conjecture that it costs no more than the move-to-front rule and its convergence is intermediate to the move-to-front rule and the transposition rule. For the perfor\u00admance of the move-to-parent rule, empirical comparison shows that it lies between the move-to-front heuristic and the transposition heuristic, and that it is better than the swap-with-parent rule.<\/p>\n\n\n\n

TR-97-07.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-97-07 May 1997 TR-97-07: The Swap-with-Parent Scheme: A Self-Organizing Sequential Search Algorithm which Uses Non-lexicograhic Heaps * B. John Oommen & Juan Dong Abstract t-A common drawback to all the reported self-organizing sequeI_!.tial search algorithms is that they all fail to consider the size of the list when reorganizing it. The […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12157,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12935","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12935","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12935"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12935\/revisions"}],"predecessor-version":[{"id":12936,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12935\/revisions\/12936"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12157"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12935"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12935"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}