CS@GWU homepage


world wide web
cs @ gwu

Department of Computer Science
The George Washington University
801 22nd Street NW, Suite 704
Washington DC 20052

Voice: (202) 994-7181
Fax: (202) 994-4875
E-mail: cs@gwu.edu

Seminar/talk Summary





Title


Top-k Algorithms and Applications

Date


2009-11-16 12:00 PM

Speaker


Gautam Das, Ph.D.
University of Texas at Arlington

Place


Room 736 Academic Center, CS Conference Room

Content


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 talk 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 talk 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.

Detail



Attachment: Gautam Das CS Colloquium.pdf




Back