We investigate the limitations of existing XML search methods and propose a new semantics,related relationship,to effectively capture meaningful relationships of data elements from XML data in the absence of structural constraints.Then we make an extension to XPath by introducing a new axis,related axis,to specify the related relationship between query nodes so as to enhance the flexibility of XPath.We propose to reduce the cost of computing the related relationship by a new schema summary that summarizes the related relationship from the original schema without any loss.Based on this schema summary,we introduce two indices to improve the performance of query processing.Our algorithm shows that the evaluation of most queries can be equivalently transformed into just a few selection and value join operations,thus avoids the costly structural join operations.The experimental results show that our method is effective and efficient in terms of comparing the effectiveness of the related relationship with existing keyword search semantics and comparing the efficiency of our evaluation methods with existing query engines.