An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data

Recently, enormous volume of data is created and it has been increasing. Various types of data are collected in data storages. Each of data management system utilises individual retrieval mechanism arbitrarily, users get into difficulty that they need to obey a query manor for each systems. In our work, we focus on the ubiquity of the retrieval and we discuss about a representation of user´s query intention and a method for reflecting it in the retrieval. Conceptually, fork and chain on a tree structure could be regarded as coordinate and subordinate respectively. Therefore, we attempt to use for data retrieval with lapping relationships between user input keywords on the tree structure. Our assuming user is a person or a device which can make a tree to issue a query. We introduce an elaborate use of the tree