Transactions for Distributed Wikis on Structured Overlays

  • Stefan Plantikow
  • Alexander Reinefeld
  • Florian Schintke
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4785)

Abstract

We present a transaction processing scheme for structured overlay networks and use it to develop a distributed Wiki application based on a relational data model. The Wiki supports rich metadata and additional indexes for navigation purposes.

Ensuring consistency and durability requires handling of node failures. We mask such failures by providing high availability of nodes by constructing the overlay from replicated state machines (cell model). Atomicity is realized using two phase commit with additional support for failure detection and restoration of the transaction manager. The developed transaction processing scheme provides the application with a mixture of pessimistic, hybrid optimistic and multiversioning concurrency control techniques to minimize the impact of replication on latency and optimize for read operations. We present pseudocode of the relevant Wiki functions and evaluate the different concurrency control techniques in terms of message complexity.

Keywords

Distributed transactions content management systems structured overlay networks consistency concurrency control 

References

  1. 1.
    Gray, J.: The transaction concept: Virtues and limitations. In: Proceedings of the 7th Intl. Conf. on Very Large Databases, pp. 144–154 (1981)Google Scholar
  2. 2.
    Ghodsi, A.: Distributed k-Ary System: Algorithms for Distributed Hash Tables. PhD thesis, KTH Stockholm (2006)Google Scholar
  3. 3.
    Li, J., Stribling, J., Gil, T.M., Morris, R., Kaashoek, M.F.: Comparing the performance of distributed hash tables under churn. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Schiper, A.: Dynamic group communication. Distributed Computing 18(5), 359–374 (2006)CrossRefMATHGoogle Scholar
  5. 5.
    Schneider, F.B.: The state machine approach: A tutorial. Technical Report TR 86-800, Dept. of Comp. Sci., Cornell University (December 1986)Google Scholar
  6. 6.
    Lamport, L.: Fast paxos. Technical Report MSR-TR-2005-112, Microsoft Research (January 2006)Google Scholar
  7. 7.
    Thomasian, A.: Distributed optimistic concurrency control methods for high-performance transaction processing. IEEE Transactions on Knowledge and Data Engineering 10(1), 173–189 (1998)CrossRefGoogle Scholar
  8. 8.
    Agrawal, D., Bernstein, A.J., Gupta, P., Sengupta, S.: Distributed optimistic concurrency control with reduced rollback. Distributed Computing 2, 45–59 (1987)CrossRefGoogle Scholar
  9. 9.
    Gruber, R.E.: Optimistic Concurrency Control for Nested Distributed Transactions. PhD thesis, Massachusetts Institute of Technology (June 1989)Google Scholar
  10. 10.
    Mohan, C., Pirahesh, H., Lorie, R.: Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions. In: SIGMOD 1992. Proceedings of the 1992 ACM SIGMOD Intl. Conf. on Management of data, pp. 124–133. ACM Press, New York (1992)Google Scholar
  11. 11.
    Reed, D.P.: Naming and synchronization in a decentralized computer system, PhD thesis. Technical Report MIT-LCS-TR-205, MIT (September 1978)Google Scholar
  12. 12.
    Schütt, T., Schintke, F., Reinefeld, A.: Structured Overlay without Consistent Hashing: Empirical Results. In: GP2PC 2006. Proceedings of the Sixth Workshop on Global and Peer-to-Peer Computing (May 2006)Google Scholar
  13. 13.
    Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: P2P 2002. 2nd IEEE Intl. Conf. on Peer-to-Peer Computing, IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  14. 14.
    Plantikow, S.: Transactions for distributed wikis on structured overlay networks (in German). Diploma thesis, Humboldt-Universität zu Berlin (April 2007)Google Scholar
  15. 15.
    Mesaros, V., Collet, R., Glynn, K., Roy, P.V.: A transactional system for structured overlay networks. Technical Report RR2005-01, Université catholique de Louvain (UCL) (March 2005)Google Scholar
  16. 16.
    Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubiatowicz, J.: Pond: The OceanStore Prototype. In: Proceedings of the 2nd USENIX Conf. on File and Storage Technologies, pp. 1–14 (2003)Google Scholar
  17. 17.
    Muthitacharoen, A., Gilbert, S., Morris, R.: Etna: A fault-tolerant algorithm for atomic mutable DHT data. Technical Report MIT-CSAIL-TR-2005-044 and MIT-LCS-TR-993, CSAIL, MIT (2005)Google Scholar
  18. 18.
    Moser, M., Haridi, S.: Atomic commitment in transactional DHTs. In: First CoreGRID European Network of Excellence Symposium (2007)Google Scholar
  19. 19.
    Ghodsi, A., Alima, L.O., Haridi, S.: Symmetric replication for structured peer-to-peer systems. In: The 3rd Intl. Workshop on Databases, Information Systems and peer-to-Peer Computing (2005)Google Scholar
  20. 20.
    Litwin, W., Schwarz, T.: LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes. In: SIGMOD 2000. Proceedings of the 2000 ACM SIGMOD Intl. Conf. on Management of Data, pp. 237–248. ACM Press, New York (2000)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2007

Authors and Affiliations

  • Stefan Plantikow
    • 1
  • Alexander Reinefeld
    • 1
  • Florian Schintke
    • 1
  1. 1.Zuse Institute BerlinGermany

Personalised recommendations