Metrics for evaluating database selection techniques
World Wide Web
QUEST - Querying Specialized Collections on the Web
ECDL '00 Proceedings of the 4th European Conference on Research and Advanced Technology for Digital Libraries
Comparing the performance of collection selection algorithms
ACM Transactions on Information Systems (TOIS)
Evaluating database selection algorithms for distributed search
Proceedings of the 2003 ACM symposium on Applied computing
Information Retrieval with Distributed Databases: Analytic Models of Performance
IEEE Transactions on Parallel and Distributed Systems
Query-driven document partitioning and collection selection
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
| Hi-index | 0.00 |
We examine a class of database selection algorithms that require only document frequency information. The CORI algorithm is an instance of this class of algorithms. In previous work, we showed that CORI is more effective than gGlOSS when evaluated against a relevance-based standard. In this paper, we introduce a family of other algorithms in this class and examine components of these algorithms and of the CORI algorithm to begin identifying the factors responsible for their performance. We establish that the class of algorithms studied here is more effective and efficient than gGlOSS and is applicable to a wider variety of operational environments. In particular, this methodology is completely decoupled from the database indexing technology so is as useful in heterogeneous environments as in homogeneous environments.