Group Seminar: Header T-tree, A Main Memory Database Index

by Sandeep Uda Abstract: Memory resident database systems (MMDB's) store their data in main physical memory and provide very high-speed access. There are many index structures proposed which are suitable for MMDBs. T-tree has been widely accepted as a promising index structure for main memory databases. It is a balanced tree that evolved from AVL and B-trees, and a binary tree with many elements in a node. All the basic operations like insertion, deletion, update, searching single-value query and searching range queries are discussed along with their advantages and disadvantages and a new index structure is proposed which is a variation of T-tree, will be discussed with examples.

What
When	Apr 25, 2008 from 09:00 am to 10:30 am
Where	ACTR 116
Contact Name	Zonghuan Wu
Contact Phone	4821667
Add event to calendar	vCal iCal