• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • An efficient permutation-based parallel algorithm for range-join in hypercubes

    Author(s)
    Shen, Hong
    Griffith University Author(s)
    Shen, Hong
    Year published
    1995
    Metadata
    Show full item record
    Abstract
    The range-join of sets R and S is defined to be the set containing all tuples (r, s) that satisfy e, I 1 r -s I I e2 where r E R, s ES, e, and e2 are fixed constants. This paper proposes an efficient parallel range-join algorithm in hypercubes. To compute the range-join of two sets R and S on a hypercube of p processors (p I I R 1 = m I I S 1 = n), the proposed algorithm simply permutes the elements of R to obtain their possible combinations with the elements of S and thus all possible local range-joins. Requiring only O((m + n)/p) local memory at each processor, our algorithm has a time complexity O(((n/p) + m) log(n/p)) ...
    View more >
    The range-join of sets R and S is defined to be the set containing all tuples (r, s) that satisfy e, I 1 r -s I I e2 where r E R, s ES, e, and e2 are fixed constants. This paper proposes an efficient parallel range-join algorithm in hypercubes. To compute the range-join of two sets R and S on a hypercube of p processors (p I I R 1 = m I I S 1 = n), the proposed algorithm simply permutes the elements of R to obtain their possible combinations with the elements of S and thus all possible local range-joins. Requiring only O((m + n)/p) local memory at each processor, our algorithm has a time complexity O(((n/p) + m) log(n/p)) in the best case when no element in S matches any element in R; O(T,k,,, + (m/p)) in the worst case when all elements in S match each element in R, where Tk SDr, = O(k log k) when all elements in S are distinct, and T&, = O(k) when all elements in S are equal, k = n/p. The general-case time complexity of the algorithm is also shown.
    View less >
    Journal Title
    Parallel Computing
    Volume
    21
    Issue
    2
    DOI
    https://doi.org/10.1016/0167-8191(94)00069-M
    Subject
    Distributed Computing
    Cognitive Sciences
    Publication URI
    http://hdl.handle.net/10072/120340
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander