SIMD PARALLEL ALGORITHMS FOR NESTED RELATIONAL DATABASE IMPLEMENTATION

THE RESEARCHERS PROPOSE USING THE DATA STRUCTURE MACHINE, A MASSIVELY PARALLEL COMPUTER, FOR IMPLEMENTING A NESTED RELATIONAL DATABASE SYSTEM. NESTED RELATIONAL DATABASES AREFORMED BY RELAXING THE FIRST NORMAL FORM (1NF) REQUIREMENT THAT WAS IMPOSED ON RELATIONAL DATABASES. AS A RESULT, VALUES CAN BE COMPLEX OBJECTS INSTEAD OF ATOMIC VALUES WE ASSOCIATE WITH THE RELATIONAL MODEL. OBJECT-ORIENTED DATABASES, ENGINEERING AND GRAPHICS APPLICATIONS, AND IMAGE ANALYSIS CAN ALL BENEFIT FROM AN EFFICIENT NESTED RELATIONALDATABASE IMPLEMENTATION. THE DATA STRUCTURE MACHINE (DSM) IS A PARTICULARLY GOOD CANDIDATE FOR A NESTED RELATIONAL DATABASE COMPUTER. THE SCALING PROPERTIES THAT THE SIMPLE TREE-BASE CONNECTION TOPOLOGY PROVIDE, WILL ALLOW THE DSM TO GROW TO A MASSIVE DEGREE OF PARALLELISM. FURTHER, THE DSM IS OPTIMIZED TO EXPLOIT LOCALITY WITHIN DATA STRUCTURES. A PROPOSED SERIAL NESTED RELATIONAL DATABASE IMPLEMENTATION BY DESHPAND AND VAN GUCHT MAINTAINS THE LOCALITY PROPERTIES THAT THE DSM EXPLOITS. WITH DESHPAND, THE RESEARCHERS HAVE MAPPED, AS AN ABSTRACT IMPLEMENTATION, THE SERIAL MODEL ONTO THE PARALLEL ARCHITECTURE OF THE DSM. THEY PLAN TO TRANSFORM THIS ABSTRACT IMPLEMENTATION TO A PHYSICAL IMPLEMENTATION ON A PROTOTYPE DSM. TRANSFORMATION OF THE CRITICAL ALGORITHMS CAN BE DONE DURING PHASE I OF THIS PROJECT.