Paper Info
Title
Structured data retrieval using cover density ranking
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.
Year
DOI
Venue
2010
10.1145/1868366.1868367
KEYS
Keywords
Field
DocType
keyword search system,ranking function,state-of-the-art ranking function,cover density ranking,structured data retrieval,unstructured ranking function,effective mean,structured cover density ranking,search term,keyword search,search result,information need,structured data,social network,user requirements,relational database
World Wide Web,Information needs,Social media,Social network,Ranking,Relational database,Information retrieval,Computer science,Microblogging,Search-oriented architecture,Ranking (information retrieval),Data model
Conference
Citations 
PageRank 
References 
9
0.53
18
Authors
2
Name
Order
Citations
PageRank
Joel Coffman1572.90
Alfred C. Weaver247355.79