[comp.databases] Concurrency Control and Indexing

markus@tuhold.UUCP (06/07/88)

I am looking for work concerning the interaction of concurrency 
control and indexing relations.

What algorithms have been developed or adapted for serializing access/updates
to indexing structures? For example, locking the root of a B-tree
when updating one of its leaves does not seem very efficient.
Most of the "traditional" works on db concurrency control
appear to ignore the issue.
How do existing multi-user database systems treat this problem?

Any references to research work (past and present) in this area
would be greatly appreciated.

Thanks in advance


    Markus Stumptner
    Technical University of Vienna
    Paniglg. 16, 1040 Vienna, Austria

    UUCP: tuvie!tuhold!markus

gupta@cullsj.UUCP (Yogesh Gupta) (06/11/88)

In article <1015@tuhold>, markus@tuhold (Markus Stumptner) writes:
> 
> I am looking for work concerning the interaction of concurrency 
> control and indexing relations.
> 
There are a lot of papers on this topic.  For example, in PODS 85 (i think)
there was a paper by Dr. Sagiv on the concurrency control of B-trees.  In fact
that conference had a whole session (5 papers?) on concurrency control of
directory structures in general: b-trees, hashed etc.
Hope this helps.

NB. PODS 85 - Principles of Database Systems conf. held in Portland, 3/1985(?).
-- 
Yogesh Gupta			| If you think my company will let me
Cullinet Software, Inc.		| speak for them, you must be joking.