Answering Top K Queries Efficiently with Overlap in Sources and Source Paths

Louiqa Raschid, Maria Esther Vidal, Yao Wu, Felix Naumann, Jens Bleiholder

Challenges in answering queries over Web-accessible sources are selecting the sources that must be accessed and computing answers efficiently. Both tasks become more difficult when there is overlap among sources and when sources may return answers of varying quality. The objective is to obtain the best answers while minimizing the costs or delay in computing these answers and is similar to solving a Top K problem efficiently. We motivate these problems and discuss solution approaches.

Subjects: 1.10 Information Retrieval; 1. Applications

Submitted: May 14, 2007


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.