Presentation	2007-10-15 B-tree Processing on a Functional Memory System and Its Evaluation Jun MIYAZAKI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In this paper, we propose and evaluate a more efficient B-tree traversal method than conventional cache-conscious B-trees using the improved functional memory system that we have previously developed. We have been developing a high performance B-tree traversal scheme using CMP which is one of the data transfer methods that our functional memory system supports. However, the B-tree has less performance than the conventional cache-conscious ones, such as ABC-tree, because of the overhead of CMP itself. We first show and try to solve the causes of the overhead, and then, pursue more efficient B-tree processing scheme than the conventional cache-conscious ones.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	main memory database / B-tree / memory system / performance evaluation
Paper #	DE2007-116,DC2007-13
Date of Issue

Conference Information
Committee	DE
Conference Date	2007/10/8(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Data Engineering (DE)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	B-tree Processing on a Functional Memory System and Its Evaluation
Sub Title (in English)
Keyword(1)	main memory database
Keyword(2)	B-tree
Keyword(3)	memory system
Keyword(4)	performance evaluation
1st Author's Name	Jun MIYAZAKI
1st Author's Affiliation	Graduate School of Information Science, NAIST()
Date	2007-10-15
Paper #	DE2007-116,DC2007-13
Volume (vol)	vol.107
Number (no)	254
Page	pp.pp.-
#Pages	6
Date of Issue