A SPACE-EFFICIENT ALGORITHM FOR PAGING UNBALANCED BINARY TREES

Rui A. E. Tavares, Elias P. Duarte Jr

Abstract

This work presents a new approach for paging large unbalanced binary trees which frequently appear in computational biology. The proposed algorithm aims at reducing the number of pages accessed for searching, and at decreasing the amount of unused space in each page as well as reducing the total number of pages required to store a tree. The algorithm builds the best possible paging when it is possible and employs an efficient strategy based on bin packing for allocating trees that are not complete. The complexity of the algorithm is presented. Experimental results are reported and compared with other approaches, including balanced trees. The comparison shows that the proposed approach is the only one that presents an average number of page accesses for searching close to the optimal and, at the same time, the page filling percentage is also close to the optimal.

References

  1. Gonnet, G. H. ; Baeza-Yates, R. Handbook of Algorithms and Data Structures: in Pascal and C. AddisonWesley, 1991, 424 p.
  2. Cohen, J. Bioinformatics - An Introduction for Computer Scientists. ACM Computing Surveys, v. 36, n. 2, p. 122-158, 2004.
  3. Pedersen, C. N. S. Algorithms in Computational Biology. PhD Dissertation, University of Aarhus, Denmark, 2000, 210 p.
  4. Garey, M. R. ; Johnson, D. S. Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman and Company, 1979, 338 p.
  5. Frakes, W. B. ; Baeza-Yates, R. Information Retrieval Data Structures and Algorithms. Prentice Hall, 1992, 464 p.
  6. Baeza-Yates, R. ; Ribeiro-Neto, B. Modern Information Retrieval. Addison-Wesley, 1999, 513 p.
  7. Vitter, J. S. External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys, v. 33, n. 2, p. 209-271, 2001.
  8. Henrich, A. ; SIX, H.W. ; Widmayer, P. Paging Binary Trees with External Balancing. Proceedings of the 15th International Workshop on Graph-theoretic Concepts in Computer Science, p. 260-276, Netherlands, 1990.
  9. Clark, D. R. ; Munro, J. I. Efficient Suffix Trees on Secondary Storage. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, p. 383-391, Atlanta, 1996.
  10. Diwan, A. A. ; Rane, S. ; Seshadri, S. ; Sudarshan, S. Clustering Techniques for Minimizing External Path Length. Proceedings of the 22nd VLDB Conference, p. 342-353, India, 1996.
  11. Gil, J. ; Itai, A. How to Pack Trees. Journal of Algorithms, v. 32, n. 2, p. 108-132, 1999.
  12. Bender, M. A. ; Demaine, E. D. ; Farach-Colton, M. Efficient Tree Layout in a Multilevel Memory Hierarchy. Proceedings of the 10th Annual European Symposium on Algorithms, p. 165-173, Italy, 2002.
Download


Paper Citation


in Harvard Style

A. E. Tavares R. and P. Duarte Jr E. (2007). A SPACE-EFFICIENT ALGORITHM FOR PAGING UNBALANCED BINARY TREES . In Proceedings of the Second International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8111-05-0, pages 38-43. DOI: 10.5220/0001334500380043


in Bibtex Style

@conference{icsoft07,
author={Rui A. E. Tavares and Elias P. Duarte Jr},
title={A SPACE-EFFICIENT ALGORITHM FOR PAGING UNBALANCED BINARY TREES},
booktitle={Proceedings of the Second International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2007},
pages={38-43},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001334500380043},
isbn={978-989-8111-05-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - A SPACE-EFFICIENT ALGORITHM FOR PAGING UNBALANCED BINARY TREES
SN - 978-989-8111-05-0
AU - A. E. Tavares R.
AU - P. Duarte Jr E.
PY - 2007
SP - 38
EP - 43
DO - 10.5220/0001334500380043