Top-k Algorithms and Applications

  • Gautam Das
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5463)

Abstract

In recent years, there has been a great deal of interest in developing effective techniques for ad-hoc search and retrieval in relational databases, document and multimedia databases, scientific information systems, and so on. A popular paradigm for tackling this problem is top-k querying, i.e., the ranking of the results and returning the k results with the highest scores. Numerous variants of the top-k retrieval problem and several algorithms have been introduced in recent years. In this tutorial we shall discuss the top-k problem in detail, especially the fundamental algorithms such as FA and TA, important variants such as algorithms operating under restricted sorted/random access, deterministic and probabilistic approximations, as well as distributed and streaming top-k computations. A significant portion of the tutorial will be focused on applications of these top-k algorithms, especially in the context of the Web services and online databases, multimedia, documents and relational databases.

Keywords

relational databases top-k algorithms search engines keyword queries 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Gautam Das
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Texas at ArlingtonArlingtonUSA

Personalised recommendations