摘要
本文是[1]的续篇,讨论了多存储部件上的多维区域查询操作的时间复杂性,给出了最坏与平均时间复杂性的分析表达式。
Abstract This paper is the continuation of [l]. The time complexity of the multi-dimenssional range queries in multiple storage units is discussed. The worst case and average case bounds of the time complexity are given in the paper.
出处
《黑龙江大学自然科学学报》
CAS
1990年第4期45-50,共6页
Journal of Natural Science of Heilongjiang University
关键词
多存储部件
查询
时间复杂性
multiple storage units, multi-dimensional query, time complexity.
