Tree-lookup for partial sums or: How can I find this stuff quickly?

被引：2

作者：

Beichl, I ^{[1
]}

Sullivan, F ^{[1
]}

机构：

[1] IDA COMP SCI,BOWIE,MD

来源：

IEEE COMPUTATIONAL SCIENCE & ENGINEERING | 1996年 / 3卷 / 01期

关键词：

D O I：

10.1109/99.486756

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An approach is presented to maintain a large list of data that is to be searched and modified frequently in the course of a computation. The approach is a simple tree that doesn't require a lot of thinking to implement. It can speed up execution tremendously because instead of searching through a list item after item for each update, possibly examining n items, only the O(log n) items need to be examined per operation.

引用

页码：13 / 15

页数：3