摘要
讨论了并行XML数据库系统中的分片问题,并提出了两种物理分片策略:路径实例均衡法和节点轮循法·前者将DOM树中的路径实例集合析散以提高I/O并行性,后者以轮循方式析散具有不同tagname的对象节点,从而最小化查询代价·通过仿真试验对这两种分片方法进行了评价和验证·
?The data partitioning issues in parallel XML database systems were discussed and two physical data partitioning strategies were proposed: Path Instance Balancing strategy and Node RoundRobin strategy. The former declusters all path instances set in a DOM tree over all sites so as to improve I/O parallelism, and the latter declusters all object nodes with different tag names over all sites in a roundrobin way so as to minimize the query cost. These methods were evaluated and verified by the simulation experiments.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2002年第12期1135-1138,共4页
Journal of Northeastern University(Natural Science)
基金
教育部高等学校优秀青年教师教学科研奖励计划基金资助项目
教育部高等学校骨干教师资助计划资助项目
