Can, F.Altingövde I.S.Demir, E.2016-02-082016-02-0820040306-43791873-6076http://hdl.handle.net/11693/24168Our research shows that for large databases, without considerable additional storage overhead, cluster-based retrieval (CBR) can compete with the time efficiency and effectiveness of the inverted index-based full search (FS). The proposed CBR method employs a storage structure that blends the cluster membership information into the inverted file posting lists. This approach significantly reduces the cost of similarity calculations for document ranking during query processing and improves efficiency. For example, in terms of in-memory computations, our new approach can reduce query processing time to 39% of FS. The experiments confirm that the approach is scalable and system performance improves with increasing database size. In the experiments, we use the cover coefficient-based clustering methodology (C3M), and the Financial Times database of TREC containing 210158 documents of size 564 MB defined by 229748 terms with total of 29545234 inverted index elements. This study provides CBR efficiency and effectiveness experiments using the largest corpus in an environment that employs no user interaction or user behavior assumption for clustering. © 2003 Elsevier Ltd. All rights reserved.EnglishCluster-based retrievalClusteringInformation retrievalPerformanceQuery processingAlgorithmsData structuresIndexing (of information)Information retrievalInformation scienceOptimizationPerformanceCluster-based retrievalClusteringIn-memory computationsQuery processingQuery languagesArticle10.1016/S0306-4379(03)00062-0