Incremental pseudo rectangular organization of information relative to a domain

Abstract

Information resources in today's cyber communities over the World Wide Web are increasingly growing in size with an ever increasing pace of change. As information demand increases, more knowledge management and retrieval applications need to exhibit a degree of resilience towards information change, and must be able to handle incremental changes in a reasonable time. In this paper we are defining a new system that utilizes new conceptual methods using the notion of pseudo maximal rectangles (i.e. the union of all non enlargeable rectangles containing a pair (a,b) of a binary relation) for managing incremental information organization and structuring in a dynamic environment. The research work in hand focuses on managing changes in an information store relevant to a specific domain of knowledge attempted through addition and deletion of information. The incremental methods developed in this work should support scalability in change-prone information stores and be capable of producing updates to end users in an efficient time. The paper will also discuss some algorithmic aspects and evaluation results concerning the new methods. © 2012 Springer-Verlag.