By Topic

H-Tree: A data structure for fast path-retrieval in rooted trees.

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Akram Shehadi Saynez ; Benemerita Universidad Autonoma de Puebla, Mexico ; Maria Josefa Somodevilla ; Manuel Martin Ortiz ; Ivo H. Pineda

When repeatedly searching on a depth-first or breath-first search fashion, some nodes are visited many times, as every search requires to start at the root. By providing a way to arrange the data in a different manner and using a hash table as the primary data structure, it is possible to get average lookup times of a path, from the root to any node in constant time, although a disadvantage arises when looking at the memory needs of the approach. We propose a structure called H-tree created to reduce the time to extract a path from a rooted tree.

Published in:

Current Trends in Computer Science, 2007. ENC 2007. Eighth Mexican International Conference on

Date of Conference:

24-28 Sept. 2007