用边缘压缩平衡 mary 搜索树

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2023-12-15 DOI:10.1007/s00236-023-00448-2

Shuyang Gao, Leen Hatem, Hosam Mahmoud

引用次数: 0

摘要

我们研究了在一种算法下生长的随机 mary 树的性能，这种算法能在边缘子树出现机会时完美地平衡 k 层。平均情况分析表明，这种边缘平衡算法大大节省了空间和搜索时间。

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

Balancing m-ary search trees with compressions on the fringe

查看原文本刊更多论文

Balancing m-ary search trees with compressions on the fringe

We investigate the performance of random m-ary trees grown under an algorithm that perfectly balances k levels, whenever the opportunity arises in a fringe subtree. The average-case analysis shows that considerable saving in space and search time is achieved by such a fringe balancing algorithm.

求助全文

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

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.