DBRank 2011

Fifth International Workshop on Ranking in Databases (2011)

In Conjunction with VLDB 2011

August 29, 2011, Seattle, WA, USA

[Welcome]       [Submission]    [Organization]   [Final Program] [Invited speakers]  [Previous Years]   

Welcome to DBRank 2011

The Fifth International Workshop on Ranking in Databases (DBRank 2011) focuses on the semantics, the modeling and the implementation of ranking and ordering in database systems and applications. In recent years, there has been a great deal of interest in developing effective techniques for ad-hoc search and retrieval in relational XML databases, text and multimedia databases, scientific information systems, biological databases, and so on. In particular, a large number of emerging applications require exploratory querying on such general-purpose or domain-specific databases; examples include users wishing to search bibliographic databases or catalogs of products such as homes, cars, cameras, restaurants, photographs, etc. To address the limitations of the traditional Boolean retrieval model in these emerging ad-hoc search and retrieval applications, Top-k queries and ranking query results are gaining increasing importance. In fact, in many of these applications, ranking is an integral part of the semantics, e.g., keyword search, similarity search in multimedia as well as document databases. The increasing importance of ranking is directly derived from the explosion in the volume of data handled by current applications. The user would be overwhelmed by too many unranked results. Furthermore, the sheer amount of data makes it almost impossible to process queries in the traditional compute-then-sort approach. Hence, ranking comes as a great tool for soliciting user preferences and data exploration. Ranking imposes several challenges for almost all data-centric systems.

DBRank aims at providing more insight into supporting ranking in database systems and will be an interesting addition to VLDB 2011; the workshop will be a great venue for the many research groups working on ranking worldwide, with a unique opportunity to share their experience in supporting ranking in various database systems, from relational to semi-structures and unstructured data; and on different levels from query formulation and preference modeling to query processing and optimization frameworks. The workshop covers (and is not limited to) the following topics:

  • Ranking relational data
  • Rank-aware query processing and optimization
  • New fundamental developments in top-k algorithms
  • Cost-models for top-k algorithms and operators
  • User preference specification and query languages
  • Ranking in Web and XML databases
  • Ranking in distributed and peer-to-peer databases
  • Ranking as a data exploration tool
  • Ranking queries in data streams and continuous monitoring systems
  • Applications of ranking and top-k retrieval from databases
  • Ranking multimedia data
  • Domain-specific ranking
  • Multidimensional data analysis using ranking tools
  • Personalized ranking functions
  • Learning user preferences and ranking functions
  • Ranking and information extraction

See the call for papers in pdf or in txt format.



We welcome original, unpublished manuscripts for 6-pages papers inclusive of all references and figures. Papers should report completed results. Vision papers and descriptions of work-in-progress are also welcomed as short paper submissions (3 pages). Papers must be written in English, and formatted according to the VLDB proceedings format (please, see VLDB Formatting Instructions).
The workshop proceedings will be included in the USB stick containing the VLDB 2011 proceedings (which will be distributed to all VLDB attendees).

Furthermore, a collection of best papers will be selected for extended publication in a post-proceedings book published by Springer together with a collection of best papers from other workshops on related topics. The volume publication has been already approved by Springer.

A journal special issue on the topics of the workshop is under investigation.

Paper Submission Site now open

Copyright form for accepted papers


Program Co-Chairs

Program Committee

  • Yi Chen (Arizona State University, USA)
  • Tao Cheng (Microsoft Research, USA)
  • Gautam Das (University of Texas at Arlington, USA)
  • Venkatesh Ganti (Google, USA)
  • Vagelis Hristidis (Florida International University, USA)
  • Seung-won Hwang (POSTECH, South Korea)
  • Ihab Ilyas (University of Waterloo, Canada)
  • Christian S. Jensen (Aarhus University, Denmark)
  • Chengkai Li (UT Arlington, USA)
  • Xuemin Lin (The University of New South Wales, Australia)
  • Nikos Mamoulis (University of Hong Kong, Hong Kong)
  • Mohamed F. Mokbel (University of Minnesota, USA)
  • Stelios Paparizos (Microsoft Research, USA)
  • Neoklis Polyzotis (University of California - Santa Cruz, USA)
  • Mohamed A. Soliman (Greenplum, USA)
  • Karl Schnaitter (Aster Data, USA)
  • Thomas Seidl (RWTH Aachen University, Germany)
  • Marco Tagliasacchi (Politecnico di Milano, Italy)
  • Kian-Lee Tan (National University of Singapore, Singapore)
  • Martin Theobald (Max-Planck-Institut fuer Informatik, Germany)
  • Eric Vee (Yahoo! Research, USA)
  • Jeffrey Xu Yu (Chinese University of Hong Kong, Hong Kong)
  • Xiaofang Zhou (University of Queensland, Australia)

Steering Committee

  • Gautam Das
    Computer Science and Engineering Department
    University of Texas at Arlington
  • Vagelis Hristidis
    School of Computing and Information Sciences
    Florida International University
  • Ihab F. Ilyas
    David R. Cheriton School of Computer Science
    University of Waterloo

Invited speakers


Search Computing project

Important Dates

All deadlines are at 5:00pm
Pacific Standard Time

Paper Submission
June 7, 2011
June 14, 2011 (EXTENDED)

Author Notification
July 7, 2011

Camera-Ready Version
July 21, 2011