OODB Bulk Loading Revisited: The Partitioned-List Approach.

Janet L. Wiener, Jeffrey F. Naughton: OODB Bulk Loading Revisited: The Partitioned-List Approach. VLDB 1995: 30-41
  author    = {Janet L. Wiener and
               Jeffrey F. Naughton},
  editor    = {Umeshwar Dayal and
               Peter M. D. Gray and
               Shojiro Nishio},
  title     = {OODB Bulk Loading Revisited: The Partitioned-List Approach},
  booktitle = {VLDB'95, Proceedings of 21th International Conference on Very
               Large Data Bases, September 11-15, 1995, Zurich, Switzerland},
  publisher = {Morgan Kaufmann},
  year      = {1995},
  isbn      = {1-55860-379-4},
  pages     = {30-41},
  ee        = {db/conf/vldb/WienerN95.html},
  crossref  = {DBLP:conf/vldb/95},
  bibsource = {DBLP,}


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 data is significantly more complicated than loading relational data due to the presence of relationships, or references, in the data; the presence of these relationships means that naive loading algorithms areslow 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 late-invsort algorithm revealed that for large data sets (ones in which a critical data structure ofthe load algorithm does not 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 does not degrade for large data sets. We present a performance study of an implementation within the Shore persistentobject repository showing that the partitioned-list algorithm is at least an order of magnitude better than previous algorithms on large data sets. In addition, because loading gigabytes and terabytes of data can take hours, we describe how to checkpoint the partitioned-list algorithm and resumea long-running load after a system crash or other interruption.

Copyright © 1995 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Umeshwar Dayal, Peter M. D. Gray, Shojiro Nishio (Eds.): VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, September 11-15, 1995, Zurich, Switzerland. Morgan Kaufmann 1995, ISBN 1-55860-379-4
Contents BibTeX


R. G. G. Cattell: The Object Database Standard: ODMG-93. Morgan Kaufmann 1993, ISBN 1-55860-302-6
Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling: Shoring Up Persistent Applications. SIGMOD Conference 1994: 383-394 BibTeX
Judith Bayard Cushing, David Maier, Meenakshi Rao, Don Abel, David Feller, D. Michael DeVaney: Computational Proxies: Modeling Scientific Applications in Object Databases. SSDBM 1994: 196-206 BibTeX
O. Deux: The Story of O2. IEEE Trans. Knowl. Data Eng. 2(1): 91-108(1990) BibTeX
Masaru Kitsuregawa, Hidehiko Tanaka, Tohru Moto-Oka: Application of Hash to Data Base Machine and Its Architecture. New Generation Comput. 1(1): 63-74(1983) BibTeX
Won Kim: UniSQL/X Unified Relational and Object-Oriented Database System. SIGMOD Conference 1994: 481 BibTeX
Charles Lamb, Gordon Landis, Jack A. Orenstein, Daniel Weinreb: The ObjectStore Database System. Commun. ACM 34(10): 50-63(1991) BibTeX
C. Mohan, Inderpal Narang: Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates. SIGMOD Conference 1992: 361-370 BibTeX
C. Mohan, Inderpal Narang: An Efficient and Flexible Method for Archiving a Data Base. SIGMOD Conference 1993: 139-146 BibTeX
C. Mohan: A Survey of DBMS Research Issues in Supporting Very Large Tables. FODO 1993: 279-300 BibTeX
C. Mohan: IBM's Relational DBMS Products: Features and Technologies. SIGMOD Conference 1993: 445-448 BibTeX
Norman W. Paton, Peter M. D. Gray: Identification of Database Objects by Key. OODBS 1988: 280-285 BibTeX
Leonard D. Shapiro: Join Processing in Database Systems with Large Main Memories. ACM Trans. Database Syst. 11(3): 239-264(1986) BibTeX
Michael Ubell: The Montage Extensible DataBlade Achitecture. SIGMOD Conference 1994: 482 BibTeX
Andrew Witkowski, Felipe Cariño, Pekka Kostamaa: NCR 3700 - The Next-Generation Industrial Database Computer. VLDB 1993: 230-243 BibTeX
Janet L. Wiener, Jeffrey F. Naughton: Bulk Loading into an OODB: A Performance Study. VLDB 1994: 120-131 BibTeX

Referenced by

  1. Wilburt Labio, Janet L. Wiener, Hector Garcia-Molina, Vlad Gorelik: Efficient Resumption of Interrupted Warehouse Loads. SIGMOD Conference 2000: 46-57
  2. Sihem Amer-Yahia, Sophie Cluet, Claude Delobel: Bulk-Loading Techniques for Object Databases and an Application to Relational Data. VLDB 1998: 534-545
  3. Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton, Mohammad Asgarian, Paul Brown, Johannes Gehrke, Dhaval Shah: The BUCKY Object-Relational Benchmark (Experience Paper). SIGMOD Conference 1997: 135-146
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:46:03 2009