Parallel Pointer-Based Join Algorithms in Memory-mapped Environments.

Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE 1996: 266-275
  author    = {Peter A. Buhr and
               Anil K. Goel and
               Naomi Nishimura and
               Prabhakar Ragde},
  editor    = {Stanley Y. W. Su},
  title     = {Parallel Pointer-Based Join Algorithms in Memory-mapped Environments},
  booktitle = {Proceedings of the Twelfth International Conference on Data Engineering,
               February 26 - March  1, 1996, New Orleans, Louisiana},
  publisher = {IEEE Computer Society},
  year      = {1996},
  isbn      = {0-8186-7240-4},
  pages     = {266-275},
  ee        = {db/conf/icde/BuhrGNR96.html},
  crossref  = {DBLP:conf/icde/96},
  bibsource = {DBLP,}


Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 7, ICDE 1996-1998, PDIS, Hypertext, ACL DL" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Stanley Y. W. Su (Ed.): Proceedings of the Twelfth International Conference on Data Engineering, February 26 - March 1, 1996, New Orleans, Louisiana. IEEE Computer Society 1996, ISBN 0-8186-7240-4
Contents BibTeX


Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir: A Model for Hierarchical Memory. STOC 1987: 305-314 BibTeX
Alok Aggarwal, Ashok K. Chandra: Communication Complexity of PRAMs (Preliminary Version). ICALP 1988: 1-17 BibTeX
Alok Aggarwal, Ashok K. Chandra, Marc Snir: Hierarchical Memory with Block Transfer. FOCS 1987: 204-216 BibTeX
Alok Aggarwal, Jeffrey Scott Vitter: The Input/Output Complexity of Sorting and Related Problems. Commun. ACM 31(9): 1116-1127(1988) BibTeX
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7
Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker: The Uniform Memory Hierarchy Model of Computation. Algorithmica 12(2/3): 72-109(1994) BibTeX
Andrew W. Appel, Kai Li: Virtual Memory Primitives for User Programs. ASPLOS 1991: 96-107 BibTeX
Malcolm P. Atkinson, Peter J. Bailey, Kenneth Chisholm, W. Paul Cockshott, Ronald Morrison: An Approach to Persistent Programming. Comput. J. 26(4): 360-365(1983) BibTeX
Malcolm P. Atkinson, Ronald Morrison: Procedures as Persistent Data Objects. ACM Trans. Program. Lang. Syst. 7(4): 539-559(1985) BibTeX
Peter A. Buhr, Glen Ditchfield, Richard A. Stroobosscher, B. M. Younger, C. Robert Zarnke: Concurrency in the Object-oriented Language C++. Softw., Pract. Exper. 22(2): 137-172(1992) BibTeX
Peter A. Buhr, Anil K. Goel, Anderson Wai: µDatabase: A Toolkit for Constructing Memory Mapped Databases. POS 1992: 166-185 BibTeX
W. Paul Cockshott, Malcolm P. Atkinson, Kenneth Chisholm, Peter J. Bailey, Ronald Morrison: Persistent Object Management System. Softw., Pract. Exper. 14(1): 49-71(1984) BibTeX
George P. Copeland, Michael J. Franklin, Gerhard Weikum: Uniform Object Management. EDBT 1990: 253-268 BibTeX
Steven Fortune, James Wyllie: Parallelism in Random Access Machines. STOC 1978: 114-118 BibTeX
Gaston H. Gonnet, J. Ian Munro: Heaps on Heaps. SIAM J. Comput. 15(4): 964-971(1986) BibTeX
Goetz Graefe: Sort-Merge-Join: An Idea Whose Time Has(h) Passed? ICDE 1994: 406-417 BibTeX
Jia-Wei Hong, H. T. Kung: I/O Complexity: The Red-Blue Pebble Game. STOC 1981: 326-333 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
Charles Lamb, Gordon Landis, Jack A. Orenstein, Daniel Weinreb: The ObjectStore Database System. Commun. ACM 34(10): 50-63(1991) BibTeX
David J. DeWitt, Daniel F. Lieuwen, Manish Mehta: Pointer-Based Join Techniques for Object-Oriented Databases. PDIS 1993: 172-181 BibTeX
Lothar F. Mackert, Guy M. Lohman: Index Scans Using a Finite LRU Buffer: A Validated I/O Model. ACM Trans. Database Syst. 14(3): 401-424(1989) BibTeX
Patrick Martin, Per-Åke Larson, Vinay Deshpande: Parallel Hash-Based Join Algorithms for a Shared-Everything. IEEE Trans. Knowl. Data Eng. 6(5): 750-763(1994) BibTeX
J. Eliot B. Moss: Working with Persistent Objects: To Swizzle or Not to Swizzle. IEEE Trans. Software Eng. 18(8): 657-673(1992) BibTeX
Christos H. Papadimitriou, Jeffrey D. Ullman: A Communication-Time Tradeoff. SIAM J. Comput. 16(4): 639-646(1987) BibTeX
Joel E. Richardson, Michael J. Carey, Daniel T. Schuh: The Design of the E Programming Language. ACM Trans. Program. Lang. Syst. 15(3): 494-534(1993) BibTeX
Russel Schaffer, Robert Sedgewick: The Analysis of Heapsort. J. Algorithms 15(1): 76-100(1993) BibTeX
Donovan A. Schneider, David J. DeWitt: A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment. SIGMOD Conference 1989: 110-121 BibTeX
Leonard D. Shapiro: Join Processing in Database Systems with Large Main Memories. ACM Trans. Database Syst. 11(3): 239-264(1986) BibTeX
Eugene J. Shekita, Michael J. Zwilling: Cricket: A Mapped, Persistent Object Store. POS 1990: 89-102 BibTeX
Eugene J. Shekita, Michael J. Carey: A Performance Evaluation of Pointer-Based Joins. SIGMOD Conference 1990: 300-311 BibTeX
Michael Stonebraker: Operating System Support for Database Management. Commun. ACM 24(7): 412-418(1981) BibTeX
Jeffrey Scott Vitter, Elizabeth A. M. Shriver: Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica 12(2/3): 110-147(1994) BibTeX
Jeffrey Scott Vitter, Elizabeth A. M. Shriver: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories. Algorithmica 12(2/3): 148-169(1994) BibTeX
Seth J. White, David J. DeWitt: QuickStore: A High Performance Mapped Object Store. SIGMOD Conference 1994: 395-406 BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:18:24 2009