Abstract
Partitioning of very large document databases is a necessity to reduce the space/time complexity of retrieval operations. Modern information retrieval (IR) environments demand dynamic clustering to constantly achieve this goal. In this article, a new strategy is proposed for dynamic cluster maintenance. The strategy is based on the cover coefficient (CC) concept. The maintenance performance and behavior are tested on a database consisting of 214 ACM Transactions on Database Systems abstracts, titles, and keywords. The similarity/stability characteristics, cost analysis, and retrieval effectiveness of both unclustered and reclustered documents are among the problems studied.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
