Contacts
| Mail Address: | tada[at]slis.tsukuba.ac.jp |
| Laboratory: | Atsuyuki Morishima Lab, University of Tsukuba. |
| Address: | 1-2 Kasuga, Tsukuba, Ibaraki 305-8550, Japan |
| Tel & FAX: | +81-29-859-1556(Sorry, in Japanese only) |
Projects
The InfoSpace Governor Project
This is joint work with: Ken'ichi Ishikawa, Keishi Tajima, Shoji Mochizuki, Isamu Suzuki, Mariko Kodama, Masateru TadaishiProfile
| Birth Place: | Uozu, Toyama, Japan |
| Programming Language: | Java |
| Interests: | Algorithms, Retrieving and Managing Large Data, XML, etc. |
Publications
- Atsuyuki Morishima, Keishi Tajima, Masateru Tadaishi. Optimal Tree Node Ordering for Child/Descendant Navigations. The 26th International Conference on Data Engineering (ICDE 2010), pp.840-843,Long Beach, California, USA, March 1-6, 2010.
- Masateru Tadaishi, Atsuyuki Morishima, Keishi Tajima. "A Method to Evaluate Regular Path Expressions from Any Graph Node", Forum on Data Engineering and Information Management(DEIM Forum 2009), 8pages, Sizuoka, Japan,Mar. 2009.
- Masateru Tadaishi, Atsuyuki Morishima, Keishi Tajima. "Proposal of a Graph Data Storage for Efficient Processing of Child/Descendant Queries", DBSJ Journal Vol.7, No.3 , pp. 55-60, Dec. 2008.
- Masateru Tadaishi, Atsuyuki Morishima, Keishi Tajima. "Proposal of an Efficient Method to Process Child/Descendant Queries for Large Graph Structures", IPSJ SIG Technical Reports Vol.2008, No.88 (2008-DBS-146), pp. 229-234, Sep. 2008.
- Masateru Tadaishi, Atsuyuki Morishima, Keishi Tajima. "On An Efficient Processing Scheme of Regular Path Expressions for Large Tree Structures", Proc. of the 70th National Convention of IPSJ vol 1, pp. 603-604, Mar. 2008.
