Paper Info
Title
An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data
Abstract
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
Year
DOI
Venue
2007
10.1109/SAINT-W.2007.23
SAINT Workshops
Keywords
Field
DocType
data management system,tree structure,flexible information unit,elaborate use,query intention,data retrieval,tree structured data,user input keyword,data storage,enormous volume,query manor,indevidual retrieval mechanism,tree data structures,search engines,human factors
Query optimization,Data mining,Query language,Information retrieval,Query expansion,Computer science,Data retrieval,Tree (data structure),Tree structure,Document retrieval,Incremental decision tree
Conference
ISBN
Citations 
PageRank 
0-7695-2757-4
0
0.34
References 
Authors
2
4
Name
Order
Citations
PageRank
Taira Yoda100.34
Hidenari Kiyomitsu202.70
Kazuhiro Ohtsuki32119.56
Jun-ya Morishita459.90