A Process-Calculus Analysis of Concurrent Operations on B-Trees

A general theory of interactive systems with changing structure, the ?-calculus, is used to study concurrent operations on a variant of the B-tree. An improved algorithm for compression of the data structure is given. Some general results on partially confluent processes and on client-server systems, couched in the ?-calculus, are presented.

[1]  P. H. Lindsay.  Human Information Processing , 1977 .

[2]  Derick Wood,et al.  A New Method for Concurrency in B-Trees , 1982, IEEE Transactions on Software Engineering.

[3]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[4]  S. B. Yao,et al.  Efficient locking for concurrent operations on B-trees , 1981, TODS.

[5]  Frits W. Vaandrager,et al.  On the relationship between process algebra and input/output automata , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[6]  Roberto Gorrieri,et al.  Proceedings of ICALP'97 , 1997 .

[7]  David Walker,et al.  Partial Confluence of Proceses and Systems of Objects , 1998, Theor. Comput. Sci..

[8]  Carla Schlatter Ellis,et al.  Concurrency in linear hashing , 1987, TODS.

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[11]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[12]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[13]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[14]  Yehoshua Sagiv.  Concurrent Operations on B*-Trees with Overtaking , 1986, J. Comput. Syst. Sci..

[15]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[16]  Chris M. N. Tofts,et al.  Proof methods and pragmatics for parallel programming , 1990 .

[17]  David Walker,et al.  On Transformations of Concurrent Object Programs , 1996, CONCUR.

[18]  Butler W. Lampson,et al.  Atomic Transactions , 1980, Advanced Course: Distributed Systems.

[19]  Davide Sangiorgi,et al.  The Name Discipline of Uniform Receptiveness , 1999, Theor. Comput. Sci..

[20]  Hartmut Wedekind.  On the Selection of Access Paths in a Data Base System , 1974, IFIP Working Conference Data Base Management.