• DocumentCode
    924801
  • Title

    Combining joint and semi-join operations for distributed query processing

  • Author

    Chen, Ming-Syan ; Yu, Philip S.

  • Author_Institution
    IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
  • Volume
    5
  • Issue
    3
  • fYear
    1993
  • fDate
    6/1/1993 12:00:00 AM
  • Firstpage
    534
  • Lastpage
    542
  • Abstract
    The application of a combination of join and semi-join operations to minimize the amount of data transmission required for distributed query processing is discussed. Specifically, two important concepts that occur with the use of join operations as reducers in query processing, namely, gainful semi-joins and pure joint attributes, are used. Some semi-joint, though not profitable themselves, may benefit the execution of subsequent join operations as reducers. Such a semi-join is termed a gainful semi-join. In addition, join attributes that are not part of the output attributes are referred to as pure join attributes. They exploit the usefulness of gainful semi-joins and use the removability of pure join attributes to reduce the amount of data transmission required for query processing. Heuristic searches are developed to determine a sequence of join and semi-join reducers for query processing. Results indicate the importance of the approach to combining joins and semi-joins for distributed query processing
  • Keywords
    distributed databases; query processing; data transmission; distributed query processing; gainful semi-joins; heuristic searches; join operations; joint attributes; query processing; reducers; semijoin operations; Data structures; Error correction; Fault tolerance; Notice of Violation; Pervasive computing; Protection; Query processing; Robustness; Search methods; Tree data structures;
  • fLanguage
    English
  • Journal_Title
    Knowledge and Data Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1041-4347
  • Type

    jour

  • DOI
    10.1109/69.224205
  • Filename
    224205