Scalable Distributed Data Structures: State-of-the Art

6 June, 2016

Título:Scalable Distributed Data Structures: State-of-the Art
Prof. Dr. Witold Litwin
Witold Litwin
ACM Fellow
Professeur U. Paris 9 Dauphine
Directeur du CERIA
Fecha impartición: 25-27 de febrero de 2004.
Horario: de 16 a 20 horas.
Aula de audiovisuales. Biblioteca. Planta sótano
Duración: 10 horas.
Lugar: Escuela Politécnica Superior Universidad Carlos III. Leganés, Madrid
Material del seminario:


Breve biografía del coordinador:

Dr. Witold A. Litwin is Professor of Computer Science at the University Paris 9 (Dauphine) since 1990. He is also the Director of Centre d’Etudes et de Recherches en Informatique Appliquée (CERIA) at U. Paris 9. His research areas are the multidatabase systems and the data structures, the scalable distributed data structures especially. The multidatabase system design techniques and the linear hash data structures he has proposed in 80-ties are among most renowned contributions to these domains. They are routinely taught in the database and the data structures courses. They are also present in major database systems, as well as in other popular products, e.g., of Netscape and of Microsoft. Dr. Litwin has been invited lecturer and scientist at several universities. In the US, he taught database courses among others at UC Berkeley in 1992-94, at Santa Clara University in 1991 and Stanford University in 1990-91. His course on Multidatabase Systems was broadcast on Stanford Educational TV Network (SITN). He was visiting scientist at prominent US research centers, including IBM Almaden Research Center, in 1997 and 1998 and part time at Hewlett Packard Palo Alto Laboratories, between 1990 and 1994, as well as at U. of Maryland in 1989. Between 1980 and 1989 Dr. Litwin was Research Director at Institut National de Recherche en Informatique et Automatique (INRIA, France), and Expert for ISO Committee on Open Systems. Dr. Litwin wrote over hundred fifty research papers, edited or contributed to eleven books, and was Program Committee member of over fifty international database conferences. He is ACM-Fellow 2002, and member of IEEE.


SDDSs are a new class of data structures specifically for multicomputers. An SDDS file can span over the storage of many computers linked through a high-speed network. Such files typically reside for processing in the distributed RAM storage. They can attain sizes and access performance impossible for the traditional files. These capabilities of SDDSs open new perspectives for many applications : DBMSs, multimedia and video servers, real-time or high performance computing…


The SD linear hash partitioning schemes

LH* The SD range partitioning schemes RP*

The SD high-availability schemes: LH*rs & others

Overview of other notable SDDS schemes

The algebraic signatures in SDDSs

The SDDS-2000 architecture and demo

The SD-SQL Server SDDS applications & concluding remarks