LH* RS-A highly-available scalable distributed data structure

ACM Transactions on Database Systems

Volumn 30, Issue 3, 2005, Pages 769-811

  Litwin, Witold ^a   Moussa, Rim ^a   Thomas Schwarz, S J ^b,c  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b SANTA CLARA UNIVERSITY   (United States)

^c Santa Clara University   (United States)

Author keywords

Grid computing; High availability; Linear hashing; P2P; Physical database design; Scalable distributed data structure

Indexed keywords

GRID COMPUTING; HIGH AVAILABILITY; LINEAR HASHING; P2P; PHYSICAL DATABASE DESIGN; SCALABLE DISTRIBUTED DATA STRUCTURE;

BINARY CODES; COMPUTER NETWORKS; DATA STRUCTURES; PERSONAL COMPUTERS; SERVERS; SOFTWARE PROTOTYPING; STORAGE ALLOCATION (COMPUTER);

DISTRIBUTED DATABASE SYSTEMS;

EID: 33745183330     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1093382.1093386     Document Type: Article

References (55)

1. ALVAREZ, G., BURKHARD, W., AND CRISTIAN, F. 1997. Tolerating multiple failures in RAID Architecture with Optimal Storage and Uniform Declustering. In International Symposium on Computer Architecture, ISCA-97, 62-72.
2. ANDERSON, D. AND KUBIATOWICZ, J. 2002. The Worldwide Computer. In Scientific American 286, 3, March.
3. THE BOXWOOD PROJECT. http://research.microsoft.com/research/sv/Boxwood/.
4. BARTALOS, G. 1999. Internet: D-day at eBay. Yahoo INDIVIDUAL INVESTOR ONLINE, (July 19).
5. BERTINO, E., OOI, B. C., SACKS-DAVIS, R., TAN, K. L., ZOBEL, J., SHIDLOVSKY, B., AND CATANIA, B. 1999. Indexing Techniques for Advanced Database Systems. Kluver.
6. LH under Windows NT. In SCI-2000 (Systemics, Cybernetics, and Informatics), Orlando, Florida.
7. LH under SDDS-2000. In Distributed Data and Structures 4 (Proceedings of WDAS 2002), Carleton Scientific, 1-12.
8. BURKHARD, W. A. AND MENON, J. 1993. Disk array storage system reliability. In Proceedings of the 22nd International Symposium on Fault Tolerant Computing, Toulouse, 432-441.
9. BEN-GAN, I., AND MOREAU, T. Advanced Transact-SQL For SQL Server 2000. 2003. Apress, ISBN 1-8931115-82-8.
10. BREITBART, Y., VINGRALEK, R., AND WEIKUM, G. 1996. Load control in scalable distributed file structures. Distributed and Parallel Databases 4, 4, 319-354.
11. BREITBART, Y. AND VINGRALEK, R. 1998. Addressing and balancing issues in distributed B+ trees. In 1st Workshop on Distributed Data and Structures (WDAS '98), Carleton-Scientific.
12. COM. ACM. 1997. Special Issue on High-Performance Computing (Oct).
13. CERIA Home page: http://ceria.dauphine.fr/
14. http://www.contingencyplanningresearch.com/cod.htm. 1996. Cost of a downtime Study.
15. DINGLEDINE, R., FREEDMAN, M., AND MOLNAR, D. 2000. The free haven project: Distributed anonymous storage service. Workshop on Design Issues in Anonymity and Unobservability (July).
16. DONOGHUE, A. BOLDLY 2003. Googling into the future, http://insight.zdnet. co.uk/internet/ecommerce/0,39020454,39116781,00.htm
17. ECONOMIST 2003. Moving up the stack, www.economist.com. May.
18. GRIBBLE, S., BREWER, E., A., HELLERSTEIN, J., AND CULLER, D. 2000. Scalable, Distributed Data Structures for Internet Service Construction. 4th Symposium on Operating Systems Design and Implementation (OSDI'00).
19. GRAY, J., SZALAY, A. S., IHAKAR, A., KUNSZT, P. S., STOUGHTON, C., SLUTZ, D. R., AND VAN DEN BERG, J. 2002. Data Mining of SDDS SkyServer Database. International Workshop on Distributed Data Structures, (WDAS'02), Carleton Scientific.
20. HASKIN, R. AND SCHMUCK, F. 1996. The Tiger Shark File System. COMPCON-96, 1996.
21. HELLERSTEIN, L., GIBSON, G., KARP, R., KATZ, R., AND PATTERSON, R. 1994. Coding techniques for handling failures in large disk arrays. Algorithmica, vol. 12, p. 182-208.
22. KNUTH, D. 1998. The art of computer programming. Vol. 3 Sorting and searching. 2nd Ed. Addison-Wesley, 780.
23. KUBIATOWICZ, J. 2003. Extracting guarantees from chaos. In Communications of the ACM, 46, 2, Feb.
24. LH: A scalable high performance data structure for switched multicomputers. In Apers, P., Gardarin, G., Bouzeghoub, M., (eds.) Extending Database Technology, EDBT96, Lecture Notes in Computer Science, vol. 1057. Springer Verlag.
25. LINDBERG, R. 1997. A Java Implementation of a Highly Available Scalable and Distributed Data Structure LH*g. Master Th. LiTH-IDA-Ex-97/65. U. Linkoping, 1997/62.
26. LITWIN, W. 1994. Linear hashing: A new tool for file and table addressing. Reprinted from VLDB80 in Readings in Databases, edited by M. Stonebraker, 2nd Edition, Morgan Kaufmann Publishers.
27. LITWIN, W. 1980. Linear hashing: A new algorithm for files and tables addressing. International Conference on Databases. Aberdeen, Heyden, p. 260-275.
28. S A high-availability and high-security Scalable Distributed Data Structure. IEEE-Res. Issues in Data Eng. (RIDE-97).
29. LITWIN, W., MENON J., AND RISCH, T. 1998. LH* with Scalable Availability. IBM Almaden Res. Rep. RJ 10121 (91937), (May).
30. LITWIN, W., MENON, J., RISCH, T., AND SCHWARZ, T. 1999. Design Issues For Scalable Availability LH* Schemes with Record Grouping. DIMACS Workshop on Distributed Data and Structures, Princeton U. Carleton Scientific.
31. RS: A Highly Available Distributed Data Storage System. Research Prototype Demonstration. VLDB Toronto.
32. RS: A Highly Available Distributed Data Storage System. CERIA Tech. Rep. (Dec).
33. LITWIN, W., NEIMAT, M.-A., AND SCHNEIDER, D. 1993. Linear Hashing for Distributed Files. ACM-SIGMOD International Conference on Management of Data.
34. LITWIN, W., NEIMAT, M.-A., AND SCHNEIDER, D. 1996. A Scalable Distributed Data Structure. ACM Trans. Datab. Syst., Dec.
35. LITWIN, W. AND NEIMAT, M.-A. 1996. High-Availability LH* Schemes with Mirroring, International Conference on Cooperating Information Systems, (COOPIS) IEEE Press.
36. LITWIN, W. AND RISCH, T. 1997. LH*g: A High-availability Scalable Distributed Data Structure through Record Grouping. Res. Rep. CERIA, U. Dauphine and U. Linkoping (May).
37. LITWIN, W. AND RISCH, T. 2001. LH*g: A high-availability scalable distributed data structure by record grouping. IEEE Trans. Knowl. Data Eng. 14, 4, 923-927.
38. RS: A high-availability scalable distributed data structure using Reed Solomon codes. ACM-SIGMOD International conference on Management of Data.
39. LITWIN, W. AND RISCH, T. 2002. LH*g : A High-availability scalable distributed data structure by record grouping. IEEE Trans. Knowl. Data Eng. 14, 4, July/Aug.
40. RS: A scalable distributed highly-available data structure, Master Thesis, Feb., CS Dep. U. Linkoping, Sweden.
41. LUBY, M., MITZENMACHER, M., SHOKROLLAHI, M., SPIELMAN, D., AND STEMANN, V. 1997. Practical Loss-Resilient Codes, STOC 97, Proceedings of the twenty-ninth annual ACM Symposium on Theory of Computing, El Paso, TX, 150-159.
42. MACWILLIAMS, F. J. AND SLOANE, N. J. A. 1997. The Theory of Error Correcting Codes. Elsevier/North Holland, Amsterdam.
43. MOUSSA, R. 2003. In Distributed Data and Structures 4, Carleton Scientific (Records of WDAS 2002, Paris).
44. RS. CERIA Res. Rep. [CERIA].
45. RS parity management. Distributed Data and Structures 4, Records of the 4th International Meeting (WDAS 2002), Paris, France.
46. PÂRIS, J. F. 1993. The management of replicated data. In Proceedings of the Workshop on Hardware and Software Architectures for Fault Tolerance. Mt. St. Michel, Fr. June.
47. RAMAKRISHNAN, R. 1999. Database Management Systems. McGraw Hill.
48. RFC 793-Transmission Control Protocol http://www.faqs.org/rfcs/rfc793. html
49. SABARATNAM M., TORBJORNSEN, AND HVASSHOVD, S.-O. 1999. Evaluating the effectiveness of fault tolerance in replicated database management systems. 29th. Annual Interantional Symposium on Fault Tolerant Computing.
50. SCHWARZ, T. 2003. Generalized Reed Solomon Codes for Erasure Correction in SDDS. Workshop on Distributed Data and Structure 4, WDAS-4, Paris, Carleton Scientific.
51. SDDS-BIBLIOGRAPHY. http://192.134.119.81/SDDS-bibliograhic.html, http://ceria.dauphine.fr/witold.html
52. VINGRALEK, R., BREITBART, Y., WEIKUM, G. AND SNOWBALL. 1998. Scalable storage on networks of workstations. Distributed and Parallel Databases 6, 2, 117-156.
53. WEATHERSPOON, H. AND KUBIATOWICZ, J. 2002. Erasure coding vs. replication: A quantitative comparison. 1st International Workshop on Peer-to-Peer systems, IPTPS-2002. March.
54. XIN, Q., MILLER, E., SCHWARZ, T., BRANDT, S., LONG, D., LITWIN, W. 2003. Reliability mechanisms for very large storage systems. 20th IEEE mass storage systems and technologies (MSST2003), San Diego, CA. 146-156.
55. XIN, Q., MILLER, E., AND SCHWARZ, T. 2004. Evaluation of distributed recovery in large-scale storage systems. In 13th IEEE International Symposium on High Performance Distributed Computing (HPDC'04), Honolulu, HI.