[Colloq] REMINDER: Comprehensive Exam, Jing Shan, TODAY, MAY 16, 10AM

[Rachel Kalweit]

College of Computer and Information Science

PhD Comprehensive Exam:
Jing Shan

Title:
The C-Tree: An Index Framework with Efficient Concurrency Control and
Recovery

Monday, May 16, 2005
10:00am
366 West Village H

Abstract:
Indexes are used in database management systems as a mechanism to speed
up data retrieval. A good index structure should ensure that the data
access through it is efficient and transactional. For one dimensional
data, the B+-tree and its variants, such as the B$^{link}$-Tree and the
$\Pi$-tree, are used widely because of their good query performance and
concurrency control and recovery . However, structures for
multidimensional data, despite the intense research for more than two
decades, have not been so successful. Very few of the many proposed
structures are implemented in commercial databases. For those that have
been used, users are confronted with either poor performance or low
concurrency.

In this proposal, we describe an index framework with high concurrency
and a robust recovery mechanism. In particular, the spatial version of
this index preserves the high concurrency of the $\Pi$-Tree and is
expected to have a comparable performance to existing methods.

Thesis proposal committee:

Rajmohan Rajaraman
Betty Salzberg (Advisor)
David Lomet (Microsoft Research)
Donghui Zhang




_______________________________________________
Colloq mailing list
Colloq at lists.ccs.neu.edu
https://lists.ccs.neu.edu/bin/listinfo/colloq