跳到主要导航 跳到搜索 跳到主要内容

Comparison of parallel algorithms for path expression query in object database systems

  • Northeastern University China
  • Kyushu University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Proposes a new parallel algorithm for computing path expressions, named the "parallel cascade semi-join" (PCSJ) algorithm. Moreover, a new scheduling strategy called the "right-deep zigzag tree" is designed to further improve the performance of the PCSJ algorithm. The experiments have been implemented in a distributed and parallel NOW (network of workstations) environment. The results show that the PCSJ algorithm outperforms two other parallel algorithms [the parallel forward pointer chasing (PFPC) algorithm and the index-splitting parallel algorithm (IndexSplit)] when computing path expressions with restrictive predicates, and that the right-deep zigzag tree scheduling strategy has a better performance than the right-deep tree scheduling strategy.

源语言英语
主期刊名Proceedings - 7th International Conference on Database Systems for Advanced Applications, DASFAA 2001
出版商Institute of Electrical and Electronics Engineers Inc.
250-257
页数8
ISBN(电子版)0769509967, 9780769509969
DOI
出版状态已出版 - 2001
已对外发布
活动7th International Conference on Database Systems for Advanced Applications, DASFAA 2001 - Hong Kong, 中国
期限: 18 4月 200121 4月 2001

出版系列

姓名Proceedings - 7th International Conference on Database Systems for Advanced Applications, DASFAA 2001

会议

会议7th International Conference on Database Systems for Advanced Applications, DASFAA 2001
国家/地区中国
Hong Kong
时期18/04/0121/04/01

指纹

探究 'Comparison of parallel algorithms for path expression query in object database systems' 的科研主题。它们共同构成独一无二的指纹。

引用此