Skip to main content
SpringerLink
Log in

Trends in Rank Join

  • Chapter
Search Computing

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6585))

  • 704 Accesses

Abstract

This chapter reports the main findings of a panel that was moderated by Davide Martinenghi in which Ihab Ilyas, Neoklis Polyzotis, and Marco Tagliasacchi shared their thoughts with the attendees of the Second SeCo Workshop regarding current and future issues related to what was presented during the session on rank join. The topics touched upon during the discussion regarded relevance for Search Computing, pertinence of optimization, multi-way joins, approximate answers, and uncertainty.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: SIGMOD Conference, pp. 415–428 (2009)

    Google Scholar 

  2. Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDB, 754–765 (2004)

    Google Scholar 

  3. Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top- query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)

    Google Scholar 

  4. Ilyas, I.F., Martinenghi, D., Tagliasacchi, M.: Rank-join algorithms for search computing. In: SeCO Workshop, pp. 211–224 (2009)

    Google Scholar 

  5. Martinenghi, D., Tagliasacchi, M.: Proximity rank join. PVLDB 3(1), 352–363 (2010)

    Google Scholar 

  6. Martinenghi, D., Tagliasacchi, M.: Top-k pipe join. In: ICDE Workshops, pp. 16–19 (2010)

    Google Scholar 

  7. Soliman, M.A., Ilyas, I.F., Ben-David, S.: Supporting ranking queries on uncertain and incomplete data. VLDB J. 19(4), 477–501 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Waterloo, Canada

    Ihab Ilyas

  2. Politecnico di Milano, Italy

    Davide Martinenghi & Marco Tagliasacchi

  3. University of California, Santa Cruz, USA

    Neoklis Polyzotis

Authors
  1. Ihab Ilyas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Davide Martinenghi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neoklis Polyzotis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marco Tagliasacchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informazione, Politecnico di Milano, P.za L. Da Vinci, 32, 20133, Milano, Italy

    Stefano Ceri  & Marco Brambilla  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ilyas, I., Martinenghi, D., Polyzotis, N., Tagliasacchi, M. (2011). Trends in Rank Join. In: Ceri, S., Brambilla, M. (eds) Search Computing. Lecture Notes in Computer Science, vol 6585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19668-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19668-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19667-6

  • Online ISBN: 978-3-642-19668-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation