loading...
An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data
Hiroshima, Japan January 15-January 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT-W.2007.232007 International Symposium on Appli ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Taira Yoda, Hidenari Kiyomitsu, Kazuhiro Ohtsuki, Jun-ya Morishita, "An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data," Applications and the Internet Workshops, IEEE/IPSJ International Symposium on, pp. 53, 2007 International Symposium on Applications and the Internet Workshops (SAINTW'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SAINT-W.2007.23,
author = {Taira Yoda and Hidenari Kiyomitsu and Kazuhiro Ohtsuki and Jun-ya Morishita},
title = {An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data},
journal ={Applications and the Internet Workshops, IEEE/IPSJ International Symposium on},
volume = {0},
year = {2007},
isbn = {0-7695-2757-4},
pages = {53},
doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT-W.2007.23},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Applications and the Internet Workshops, IEEE/IPSJ International Symposium on
TI - An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data
SN - 0-7695-2757-4
SP
EP
A1 - Taira Yoda,
A1 - Hidenari Kiyomitsu,
A1 - Kazuhiro Ohtsuki,
A1 - Jun-ya Morishita,
PY - 2007
KW - null
VL - 0
JA - Applications and the Internet Workshops, IEEE/IPSJ International Symposium on
ER -
 
Taira Yoda, Yamagata Junior College, Kobe University
Hidenari Kiyomitsu, Kobe University
Kazuhiro Ohtsuki, Kobe University
Jun-ya Morishita, Kobe University
Recently, enormous volume of data is created and it has been increasing. Various types of data is collected in data storages. Each of data management system utilises indevidual 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 subrodinate respectively. Therefore, we atempt 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.
Citation:
Taira Yoda, Hidenari Kiyomitsu, Kazuhiro Ohtsuki, Jun-ya Morishita, "An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data," saint-w, pp.53, 2007 International Symposium on Applications and the Internet Workshops (SAINTW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions