摘要
许多多维索引结构随着维度的增加会遇到“维度灾难”问题,而金字塔技术是基于一种依赖特殊优化数据维度的非平均分割策略,能够克服“维度灾难”问题。本文提出了基于金字塔技术的完整算法集,并针对完备高维索引算法,对金字塔索引技术的性能特性进行了深入分析。
Most multidimensional indexing structures suffer from the ＂curse of dimensionality＂ problem because of the dimension growth. The Pyramid-Technique is based on a special partitioning strategy which is optimized for multidimensional data, and can overcome the ＂curse of dimensionality＂ problem. This paper provides a full set of algorithms based on the Pyramid-Technique, and deeply analyzes the performance characteristics of the Pyramid-Technique.
出处
《计算机工程与科学》
CSCD
2006年第10期92-94,110,共4页
Computer Engineering & Science
