LH*RS: A high-availability scalable distributed data structure using Reed Solomon Codes

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 29, Issue 2, 2000, Pages 237-248

  Litwin, Witold ^a   Thomas Schwarz, S J ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b Jesuit School of Theology   (United States)

Author keywords

High availability; Reed Solomon Codes; Scalable; SDDS

Indexed keywords

EID: 0041032346     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/335191.335418     Document Type: Article

References (38)

1. Alvarez, G., Burkhard, W., Cristian, F. Tolerating Multiple-Failures in RAID Architecture with Optimal Storage and Uniform Declustering. Intl. Symp. On Comp. Arch., ISCA-97, 1997.
2. Baru, W., C., & al. DB2 Parallel Edition. IBM Syst. Journal, 34, 2, 1995. 292-322.
3. Bartalos, G. Internet: D-Day at eBay. Yahoo INDIVIDUAL INVESTOR ONLINE, (Jul 19, 1999).
4. Bertino & al. Indexing Techn. for Advanced Database Systems. Kluver, 1999.
5. Blaum, M., Bruck, J., Menon, J. EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures. IEEE Trans. on Computers, Vol. C-44, No. 2, pp. 192-202, February 1995.
6. Blaum, M & al. Array Codes, Handbook of Coding Theory. V.S. Pless and W.C. Huffman, (ed.), Elsevier Science B.V., 1998.
7. Breitbart, Y. Vingralek, R. Distributed and Scalable B+ tree Data Structures. Workshop on Distr. Data and Struct., 1998, Carleton Scientific (publ.)
8. W. A. Burkhard, J. Menon: Disk Array Storage System Reliability. 22rd Intl. Symp. on Fault Tolerant Computing, Toulouse, June 1993, 432-441.
9. Special Issue on High-Performance Computing. Comm. Of ACM. (Oct. 1997).
10. Gribble, S. Cluster-Based Internet Services with SDDS. Master Th. UC Berkeley, 1999.
11. Haskin, R. Schmuck, F. The Tiger Shark File System. COMPCON-96, 1996.
12. Hellerstein, L, Gibson, G., Karp, R., Katz, R. Patterson, D. Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica, 1994, 12, 182-208.
13. Inktomi Corporation. http://www.inktomi.com/.
14. Breaking the Scalability Barrier on Windows NT. http://www.software.ibm.com/data/pubs/papers/nt-scale/
15. Knuth, D. THE ART OF COMPUTER PROGRAMMING. Vol. 3 Sorting and Searching. 2nd Ed. Addison-Wesley, 1998, 780.
16. J. Karlson, W. Litwin, T. Risch. LH*LH: A Scalable High Performance Data Structure for Switched Multicomputers. Extending Database Technology, EDBT96, Springer Verlag.
17. W. Litwin. Linear Hashing: A New Tool for File and Table Addressing. Reprint from VLDB80 in Readings in Databases, M. Stonebraker, 2nd Edition, Morgan Kaufmann Publishers, 1994.
18. Lindberg., R. 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.
19. S : a high-availability and high-security Scalable Distributed Data Structure. IEEE-Res. Issues in Data Eng. (RIDE-97), 1997.
20. RS : A Scalable Distributed High-Availability Data Structure. Master Th. (Feb. 2000), CS Dep., U. Linkoping, Suede.
21. Litwin, W., Menon J., Risch, T..LH* with Scalable Availability. IBM Almaden Res. Rep. RJ 10121 (91937), (May 1998), (subm.).
22. Litwin, W., Menon, J.Risch, T., Schwarz, Th. Design Issues For Scalable Availability LH* Schemes with Record Grouping. DIMACS Workshop on Distributed Data and Structures. Carleton Scientific, 1999.
23. Litwin, W., Neimat, M.-A., Schneider, D. LH* : Linear Hashing for Distributed Files. ACM-SIGMOD Intl. Conf. on Management of Data, 1993.
24. Litwin, W., Neimat, M.-A., Schneider, D. LH* - A Scalable Distributed Data Structure. ACM Trans. on Database Systems, Dec. 1996.
25. W. Litwin, M.-A. Neimat: "High-Availability LH* Schemes with Mirroring", Intl. Conf. on Coop. Inf. Systems, (COOPIS). IEEE Press 1996.
26. Litwin W., Risch, T. LH*g: a High-Availability Scalable Distributed Data Structure through Record Grouping. Res. Rep. CERIA, U. Dauphine & U. Linkoping (May. 1997).
27. RS: A High-Availability Scalable Distributed Data Structure using Reed Solomon Codes. Res. Rep. CERIA, U. Dauphine (Sept. 1999).
28. Gates, B. The Microsoft Scalability Day http://204.203.124.10/backoffice/scalability/coverage.htm
29. Marcus, M., Minc, H. A Survey of Matrix Theory and Matrix Inequalities, Dover, New York, 1992.
30. President's Inf. Techn. Advisory Comm. Interim Rep. To the Pres. Of the United States. August 1998.
31. MacWilliams, F. J., Sloane, N. J. A. The Theory of Error Correcting Codes, Elsevier/North Holland, Amsterdam, 1997.
32. Press, W. H., Teukolsky, S. A., Vetterling W. T., Flannery, B. P. Numerical Recipes in C: The Art of Scientific Computation, 2nd ed., Cambridge University Press, 1992.
33. Ramakrishnan, K. Database Management Systems. McGraw Hill, 1998.
34. Smith, D. The Cost of Lost Data. Res. Rep. School of Business and Management, Pepperdine University, 1999.
35. SDDS-bibliography. http://ceria.dauphine.fr/SDDS-bibliograhie.html
36. M. Stonebraker, G. Schloss: "Distributed RAID - A New Multiple Copy Algorithm", 6th Intl. IEEE Conf. on Data Engineering, 1990, IEEE Press, pp. 430-437.
37. Vingralek R., Breitbart Y., G. Weikum. Distributed File Organization with Scalable Cost/Performance. ACM-SIGMOD Intl. Conf. on Management of Data, 1994, 253-264.
38. Vingralek R., Breitbart Y., Weikum G. SNOWBALL: Scalable Storage on Networks of Workstations with Balanced Load. Distr. and Par. Databases, 6, 2, 1998.