Scribd Logo
Upload

Welcome to Scribd!

  • Algoritma Fagin

    Uploaded by

    Orban Cannon
    7 views1 page
    Fagin's algorithm (FA) does sorted access on all lists in parallel. For every item do random access to the other lists to fetch all of its values. Stop when at least k items were seen (in the sorted access) in all lists Sort the list Why is this important?

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Fagin's algorithm (FA) does sorted access on all lists in parallel. For every item do random access to the other lists to fetch all of its values. Stop when at least k items were seen (in the sorted access) in all lists Sort the list Why is this important?

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Algoritma Fagin

    Uploaded by

    Orban Cannon
    Fagin's algorithm (FA) does sorted access on all lists in parallel. For every item do random access to the other lists to fetch all of its values. Stop when at least k items were seen (in the sorted access) in all lists Sort the list Why is this important?

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Fagin's algorithm (FA) Do sorted access on all lists in parallel For every item do random access to the other

    lists to fetch all of its values Stop when at least k items were seen (in the sorted access) in all lists Sort the list Why is this enough?

    You might also like