This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
Optimal tree node ordering for child/descendant navigations
Long Beach, CA, USA
March 01-March 06
ISBN: 978-1-4244-5445-7
Atsuyuki Morishima, Graduate School of Library, Information, and Media Studies, University of Tsukuba, 1-2 Kasuga, Ibaraki 305-8550 Japan
Keishi Tajima, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo, 606-8501 Japan
Masateru Tadaishi, Graduate School of Library, Information, and Media Studies, University of Tsukuba, 1-2 Kasuga, Ibaraki 305-8550 Japan
There are many applications in which users interactively access huge tree data by repeating set-based navigations. In this paper, we focus on label-specific/wildcard children/ descendant navigations. For efficient processing of these operations in huge data stored on a disk, we need a node ordering scheme that clusters nodes that are accessed together by these operations. In this paper, (1) we show there is no node order that is optimal for all these operations, (2) we propose two schemes, each of which is optimal only for some subset of them, and (3) we show that one of the proposed schemes can process all these operations with access to a constant-bounded number of regions on the disk without accessing irrelevant nodes.
Citation:
Atsuyuki Morishima, Keishi Tajima, Masateru Tadaishi, "Optimal tree node ordering for child/descendant navigations," icde, pp.840-843, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010
Usage of this product signifies your acceptance of the Terms of Use.