Operational Transformation

Index

  1. Part I: Foundations
  2. 1 Operational Transformation
  3. 2 Assignment
  4. 3 Mapped values
  5. 4 Amount of information in a value
  6. 5 Selective undo
  7. Part II: The lattice of database states
  8. 6 Mathematical foundations
  9. 6.1 Partially ordered sets
  10. 6.2 Infimum and supremum
  11. 6.3 Hasse diagrams of finite posets
  12. 6.4 Lattices
  13. 7 The lattice of database states
  14. Part III: OT control algorithms
  15. 8 Operational Transform Control Algorithms
  16. 9 Apache Wave
  17. Part IV: OT on text
  18. 10 Operational Transformation On Text
  19. Part V: The cxOT library
  20. 11 cxOT
  21. Part VI: cxOT control algorithms
  22. 12 Base vector time
  23. Part VII: Historical research archive
  24. 13 Third-party operational transformation ideas
  25. 14 Control-algorithm foundations
  26. 14.1 Operational Transform Convergence
  27. 14.2 Control Algorithm
  28. 14.3 Quadratic complexity
  29. 14.4 Merging operations
  30. 14.5 Vector Time
  31. 14.6 Context relations and transformation variants
  32. 15 Research from 2005
  33. 15.1 Log Compression Algorithm
  34. 15.2 Single character insertion and deletion operations
  35. 15.3 Single character move operations
  36. 15.4 Multi-character insertion and deletion operations
  37. 15.5 Assignment operations
  38. 15.6 Set operations
  39. 15.7 Bag Operations
  40. 15.8 Map Operations
  41. 16 Research from 2006
  42. 16.1 Single-character move operations, revised
  43. 16.2 Multi-character move operations
  44. 17 Research from 2007
  45. 17.1 Log compression of move operations
  46. 17.2 Single-character move, insert and delete operations
  47. 18 Research from 2008
  48. 18.1 Multi-character CDM operations
  49. 18.2 Explicit-Join Repository Graph
  50. 18.3 Check-in-Only Repository Graph
  51. 18.4 Repository — Assignable fields
  52. 18.5 Lossy assignment operations
  53. 19 Multi-character CDM operations
  54. 19.1 Effects Document
  55. 19.2 Operations
  56. 19.3 Coordinate systems
  57. 19.4 Character identity, moves and aliased extractions
  58. 19.5 Applying operations
  59. 19.6 Structural list operations
  60. 19.7 Elementary interval transformations
  61. 19.8 Dual inclusion transformation
  62. 19.9 Move tracking and transpose helpers
  63. 19.10 Transpose
  64. 19.11 Merge
  65. 19.12 Complexity
  66. 19.13 Relationship to a repository representation
  67. 19.14 Tests
  68. 19.15 Implementation correspondence
  69. 20 Composite-operation primitives
  70. 20.1 Notation
  71. 20.2 Operation factorisation
  72. 20.3 List representation of composite operations
  73. 20.4 Precedes relation on composite operations
  74. 20.5 Generalised symmetric merge
  75. 20.6 Notes on causality with regard to the primitive operators
  76. 20.7 Full database states
  77. 20.8 Vector times paired with database values
  78. 20.9 Piecewise merge of paired states
  79. 20.10 Scratch pad
  80. 20.11 State machine based on interval operations
  81. 20.12 Control algorithm using interval operations
  82. 21 Efficient HB Suffix
  83. 21.1 Operations for deltas on a numerical field
  84. 21.2 Composite operations on bags based on deltas
  85. 21.3 Composite operations for insertions into a string
  86. 21.4 Siteid inheritance
  87. 21.5 The largest LFactor we can take
  88. 21.6 3-partitions of q-contiguous operations
  89. 21.7 Effective siteids
  90. 21.8 Control algorithm using merge and factorisation
  91. 21.9 Control algorithm with transient HB-suffix
  92. 21.10 Assignment operations
  93. 21.11 Vector<T> operations
  94. 21.12 Bogus solution for assignment
  95. 21.13 References
  96. 22 Research from 2009
  97. 22.1 Composite set operations
  98. 22.2 Composite set operations 4
  99. 23 Research from 2010
  100. 24 Research from 2019
  101. 25 Research from 2021–2022
  102. 25.1 String operations
  103. 25.2 SUN triples
  104. 25.3 Merging coincident string insertions
  105. 25.4 Update effective siteids when apply local operations
  106. 25.5 Right to left merge of coincident insertions?
  107. 25.6 Siteid comparison fails on composite insertions
  108. 25.7 Temporal Index values on insertion intervals
  109. 25.8 Composite operations on a text field
  110. 25.9 Factorisation of composite insertions and deletions on a text field
  111. 25.10 Merge composite string operations
  112. 25.11 Take RFactor of insertions/deletions on text field
  113. 25.12 Monotone increasing extents on interval set
  114. 25.13 Abstractions over reflected vectors in a database
  115. 25.14 Idea to avoid the need to split intervals
  116. 25.15 Sending a delta on a vector field
  117. 25.16 Initial state
  118. 25.17 Sets
  119. 26 Research from 2023
  120. 26.1 Assignment operations
  121. 27 Links to pdfs
  122. 28 History of the ceda-core implementation