OODB Bulk Loading Revisited: The Partitioned-List Approach

Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more complicated than loading relational data due to the presenceof relationships, or references, in the data; the presence of these relationships means that naive loading algorithms are slow to the point of being unusable. In our previous work, we presented the late-invsort algorithm, which performed significantly better than naive algorithms on all the data sets we tested. Unfortunately, further experimentation with the lateinvsort algorithm revealed that for large data sets (ones in which acritical data structure of the load algorithm doesnot fit in memory), the performance of late-invsort rapidly degrades to where it, too, is unusable. In this paper we propose a new algorithm, the partitioned-list algorithm, whose performance almost matches that of late-invsort for smaller data sets but doesnot degrade for large ...

• Type: Conference
• Year: 1995
• Where: VLDB
• Authors: Janet L. Wiener, Jeffrey F. Naughton
• Keywords: Algorithm, Data Sets, Database, Large Data Sets, VLDB 1995