The processing of complex data is admittedly among the major concerns of knowledge discovery from data (KDD). Indeed, a major part of the data worth analyzing is stored in relational databases and, since recently, on the Web of Data. This clearly underscores the need for Entity-Relationship and RDF compliant data mining (DM) tools. We are studying an approach to the underlying multi-relational data mining (MRDM) problem, which relies on formal concept analysis (FCA) as a framework for clustering and classification. Our relational concept analysis (RCA) extends FCA to the processing of multi-relational datasets, i.e., with multiple sorts of individuals, each provided with its own set of attributes, and relationships among those. Given such a dataset, RCA constructs a set of concept lattices, one per object sort, through an iterative analysis process that is bound towards a fixed-point. In doing that, it abstracts the links between objects into attributes akin to role restrictions from description logics (DLs). We address here key aspects of the iterative calculation such as evolution in data description along the iterations and process termination. We describe implementations of RCA and list applications to problems from software and knowledge engineering.