Path: utzoo!utgpu!water!watmath!clyde!bellcore!faline!thumper!ulysses!andante!princeton!udel!gatech!purdue!decwrl!sun!pitstop!sundc!seismo!uunet!mcvax!tuvie!tuhold!markus
From: markus@tuhold.UUCP
Newsgroups: comp.databases
Subject: Concurrency Control and Indexing
Keywords: concurrency control, index, relation
Message-ID: <1015@tuhold>
Date: 7 Jun 88 15:38:25 GMT
Organization: Institut f. Angewandte Informatik, TU Vienna
Lines: 22


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