|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007)
H-Tree: A data structure for fast path-retrieval in rooted trees.
Morelia, Michoacan, Mexico
September 24-September 28
ISBN: 0-7695-2899-6
| ASCII Text | x | ||
| Akram Shehadi Saynez, Maria Josefa Somodevilla, Manuel Martin Ortiz, Ivo H. Pineda, "H-Tree: A data structure for fast path-retrieval in rooted trees.," Mexican International Conference on Computer Science, pp. 25-32, Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007), 2007. | |||
| BibTex | x | ||
| @article{ 10.1109/ENC.2007.26, author = {Akram Shehadi Saynez and Maria Josefa Somodevilla and Manuel Martin Ortiz and Ivo H. Pineda}, title = {H-Tree: A data structure for fast path-retrieval in rooted trees.}, journal ={Mexican International Conference on Computer Science}, volume = {0}, year = {2007}, isbn = {0-7695-2899-6}, pages = {25-32}, doi = {http://doi.ieeecomputersociety.org/10.1109/ENC.2007.26}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Mexican International Conference on Computer Science TI - H-Tree: A data structure for fast path-retrieval in rooted trees. SN - 0-7695-2899-6 SP25 EP32 A1 - Akram Shehadi Saynez, A1 - Maria Josefa Somodevilla, A1 - Manuel Martin Ortiz, A1 - Ivo H. Pineda, PY - 2007 KW - Rooted tree KW - Huffman coding KW - path retrieval KW - hash table KW - depth-first search. VL - 0 JA - Mexican International Conference on Computer Science ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ENC.2007.26
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.
Index Terms:
Rooted tree, Huffman coding, path retrieval, hash table, depth-first search.
Citation:
Akram Shehadi Saynez, Maria Josefa Somodevilla, Manuel Martin Ortiz, Ivo H. Pineda, "H-Tree: A data structure for fast path-retrieval in rooted trees.," enc, pp.25-32, Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.