An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems.

@article{DBLP:journals/dpd/LinO95,
  author    = {Xuemin Lin and
               Maria E. Orlowska},
  title     = {An Efficient Processing of a Chain Join with the Minimum Communication
               Cost in Distributed Database Systems},
  journal   = {Distributed and Parallel Databases},
  volume    = {3},
  number    = {1},
  year      = {1995},
  pages     = {69-83},
  ee        = {db/journals/dpd/LinO95.html, http://kapis.www.wkap.nl/oasis.htm/77078},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An5-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Online Edition