Structured data retrieval using cover density ranking

  • Authors:
  • Joel Coffman;Alfred C. Weaver

  • Affiliations:
  • University of Virginia, Charlottesville, VA;University of Virginia, Charlottesville, VA

  • Venue:
  • Proceedings of the 2nd International Workshop on Keyword Search on Structured Data
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Keyword search in structured data is an important problem spanning both the database and IR communities. As social networking, microblogging, and other data-driven websites store increasing amounts of information in relational databases, users require an effective means for accessing that information. We present structured cover density ranking (a generalization of an unstructured ranking function) as an effective means to order search results from keyword search systems that target structured data. Structured cover density ranking was designed to adhere to users' expectations regarding the ranking of search results---namely, results containing all query keywords appear before results containing a subset of the search terms. Our evaluation shows that our ranking function provides better results than other state-of-the-art ranking functions across 3 different datasets and 150 distinct information needs.