A previously proposed keyword search paradigm produces, as a query result, a ranked list of Object Summaries (OSs). An OS is a tree structure of related tuples that summarizes all data held in a relational database about a particular Data Subject (DS). However, some of these OSs are very large in size and therefore unfriendly to users that initially prefer synoptic information before proceeding to more comprehensive information about a particular DS. In this paper, the authors investigate the effective and efficient retrieval of concise and informative OSs. They argue that a good size-l OS should be a standalone and meaningful synopsis of the most important information about the particular DS. More precisely, they define a size-l OS as a partial OS composed of l important tuples.