Algorithmic aspects of multiversion concurrency control
β Scribed by Thanasis Hadzilacos; Christos H. Papadimitriou
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 945 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The amalgamation of leaf-labeled trees into a single (super)tree that "displays" each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well-known polynomialtime algorithm can be used to solve this problem whenever
ects of Combinatorics ects of Combinatorics wi!J be bia, Canada, ay 1'7-21, 'hW6. y the Simon Fraser ersity of Victoria and the University of stish Columbia. speakers are tentatively schedul ster sessions will be arrar-bed.
This paper describes the algorithmic aspects of a multigrid solver based on the adaptive generation of a sequence of discretizing meshes. Non-uniform discretization is obtained by conΓΏning ΓΏner meshes to progressively smaller subdomains. New meshes are generated through bisection reΓΏnement according