Abstract
Given two partitions A and B of a totally ordered set S, of size n, corresponding to the equivalence relations R A and R B respectively, the refinement problem calls for the computation of the partition C corresponding to the relation R A and R B. We present an algorithm for this problem. As an application, we present an algorithm that converts an inverted lists structure to a multiple attribute tree for a set of multi-dimensional points. Using the idea of the proposed algorithm we present an alternate algorithm for an existing partition algorithm. The alternate algorithm is very simple to implement and direct to prove.
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.
