摘要： 系统地介绍了基于并行化k-d树的多维数据分布方法。给出了几种构造k-d树的策 略和相应算法，并从理论上分析和比较了各种策略的通信花费及其应用范围。

关键词: 并行数据库, 数据分布, k-d树, 基于排序的方法, 基于中值的方法, 基于桶的方法

Abstract: This paper describes a Multidimensional declustering method based on k-d Tree in parallel database. It implements several strategies and algorithms for constructing k-d tree, and analyzes and compares theoretically the communi ca tion cost of these algorithms, and integrates different methods for different ap plications.

中图分类号: 

• TP311.12