IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v20y2007i2d10.1007_s10959-007-0063-4.html
   My bibliography  Save this article

Optimal Policies to Obtain the Most Join Results

Author

Listed:
  • Nariankadu D. Shyamalkumar

    (The University of Iowa)

  • Ralph P. Russo

    (The University of Iowa)

  • Ramon Lawrence

    (University of British Columbia)

Abstract

Consider two finite or infinite populations, each member of which carries a positive integer valued label. Samples are drawn without replacement. A match is said to occur between two sampled members if they are from different populations and carry the same label. The object is to sample from the two sources in an order that maximizes the number of matches, uniformly across all steps. An optimal strategy is identified in the infinite case. In the finite case, while an optimal policy is shown to not always exist, we identify a policy which beats one that is commonly used. The work is motivated by a database problem in computer science. Many of the results are established through the probabilistic technique of coupling.

Suggested Citation

  • Nariankadu D. Shyamalkumar & Ralph P. Russo & Ramon Lawrence, 2007. "Optimal Policies to Obtain the Most Join Results," Journal of Theoretical Probability, Springer, vol. 20(2), pages 237-256, June.
    • Handle: RePEc:spr:jotpro:v:20:y:2007:i:2:d:10.1007_s10959-007-0063-4
    DOI: 10.1007/s10959-007-0063-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-007-0063-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-007-0063-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:20:y:2007:i:2:d:10.1007_s10959-007-0063-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.