Skip to main content
Springer Nature Link
Log in

Parallel Partition Sort for Database Machines

  • Chapter
Database Machines and Knowledge Base Machines

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 43))

  • 109 Accesses

Abstract

We have been researching database machines based on parallelism using a multi-processor. In this paper, we briefly describe our database machine architecture and then we describe the parallel sort method which we are investigating based on that architecture. We discuss a new parallel sorting method, called a parallel partition sort, which transfers only a small amount of data and does not place large demands on the CPU. This method is based on the top-down partitioning of data. We experimented and evaluated our method using a multiprocessor to compare our method with the block bitonic sort method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aho, A. V., Hopcroft, J. E., and Ullman, D. J., Addison-Wesley, 1974.

    Google Scholar 

  2. Batcher, K. E., Proc. Spring Joint Computer Conf., Vol. 32, 1968, pp.307–314.

    Google Scholar 

  3. Baudet, G., and Stevenson, D., IEEE Trans. Comput., C-27, No. 1, 1978.

    Google Scholar 

  4. Dewitt, D. J. et al., Proc. Int. Conf. on VLDB, 1986, pp.228–237.

    Google Scholar 

  5. Ehrensberger, M. J., Paper presented at the Minnowbrook Workshop on Database Machines, 1984.

    Google Scholar 

  6. Hsiao, D. C, and Menon, M. J., Tech. Rep. OSU-CISRC-TR-80–7, Computer and Science Information Dept., Ohio State Univ., Columbus, Ohio, 1980.

    Google Scholar 

  7. Preparata, F. P., and Vuillemin, J., Proc. 20th Sympo. Foundations of Computer Science, 1979.

    Google Scholar 

  8. Sato, H., et al., ACM SIGGRAPH 85, Vol. 19, No. 3, 1985, pp.95–102.

    Article  Google Scholar 

  9. Siegel, H. J., Proc. 4th Annual Sympo. Computer Architecture, 1977, PP23–25.

    Google Scholar 

  10. Take, R., to be submitted to 25th Annual Allerton Conf. on Communication, Control and Computing.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Laboratory, Fujitsu Laboratories Ltd., Kawasaki, Japan

    Y. Yamane & R. Take

Authors
  1. Y. Yamane
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Take
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Tokyo, Japan

    Masaru Kitsuregawa  & Hidehiko Tanaka  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers, Boston

About this chapter

Cite this chapter

Yamane, Y., Take, R. (1988). Parallel Partition Sort for Database Machines. In: Kitsuregawa, M., Tanaka, H. (eds) Database Machines and Knowledge Base Machines. The Kluwer International Series in Engineering and Computer Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1679-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1679-4_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8948-7

  • Online ISBN: 978-1-4613-1679-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation