用于本地化搜索的avl树

Q4 Mathematics

信息与控制 Pub Date : 1985-10-01 DOI:10.1016/S0019-9958(85)80034-6

Athanasios K. Tsakalidis

{"title":"用于本地化搜索的avl树","authors":"Athanasios K. Tsakalidis","doi":"10.1016/S0019-9958(85)80034-6","DOIUrl":null,"url":null,"abstract":"<div>We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time O(log d), where d is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance d costs O(log d). This result demonstrates the power of the oldest basic data structure, the AVL-tree. A special case of interest is an efficient implementation of searchable priority queues such that Deletemin requires only constant time.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 173-194"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80034-6","citationCount":"0","resultStr":"{\"title\":\"AVL-trees for localized search\",\"authors\":\"Athanasios K. Tsakalidis\",\"doi\":\"10.1016/S0019-9958(85)80034-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time O(log d), where d is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance d costs O(log d). This result demonstrates the power of the oldest basic data structure, the AVL-tree. A special case of interest is an efficient implementation of searchable priority queues such that Deletemin requires only constant time.</div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 173-194\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80034-6\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800346\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

我们提出了一种基于avl树的数据结构，它允许在时间O(log d)内执行插入或删除，其中d是从指向文件末尾的手指搜索位置的距离。将手指移动到距离d需要花费O(log d)。这个结果展示了最古老的基本数据结构avl树的强大功能。我们感兴趣的一个特殊情况是可搜索优先级队列的有效实现，这样Deletemin只需要恒定的时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

AVL-trees for localized search

We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time O(log d), where d is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance d costs O(log d). This result demonstrates the power of the oldest basic data structure, the AVL-tree. A special case of interest is an efficient implementation of searchable priority queues such that Deletemin requires only constant time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

信息与控制 Mathematics-Control and Optimization

CiteScore

1.50

自引率

0.00%

发文量

4623

期刊介绍：