An efficient strategy for storing and searching binary trees in WORM external memory

Authors:
Elias P. Duarte, Jr;Karine Pires;Rui A.E. Tavares
Affiliations:
Federal University of Parana, Department of Informatics,Curitiba, PR, Brazil;Federal University of Parana, Department of Informatics,Curitiba, PR, Brazil;Federal University of Parana, Department of Informatics,Curitiba, PR, Brazil
Venue:
Journal of Information Science
Year:
2010

Citing 16
Cited 0

On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
External memory data structures

Handbook of massive data sets
Algorithms for Data Migration with Cloning

SIAM Journal on Computing
Bioinformatics—an introduction for computer scientists

ACM Computing Surveys (CSUR)
Duality Between Prefetching and Queued Writing with Parallel Disks

SIAM Journal on Computing
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems

Algorithmica
STXXL: standard template library for XXL data sets

Software—Practice & Experience
Lock-free deques and doubly linked lists

Journal of Parallel and Distributed Computing
Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
Monitoring Multiple Concurrent Service Level Parameters with Multidimensional Trees

DSOM '09 Proceedings of the 20th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management: Integrated Management of Systems, Services, Processes and People in IT
A new enhancement to the R-tree node splitting

Journal of Information Science
External selection

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of searching and storing a massive binary tree in WORM (Write Once Read Many) secondary memory. Tree nodes are organized in pages, each of which contains a fixed number of nodes. Pages are transferred to primary memory as the tree is traversed. This work presents a new strategy for paging that aims to decrease the amount of unused space in each page as well as to reduce the total number of pages required to store the tree while also reduce the number of pages accessed for searching. The algorithm employs an efficient strategy based on bin packing for allocating unbalanced trees. Experimental results are reported comparing the performance of two bin-packing heuristics, as well as other paging strategies and B-trees. Results confirm the superior performance of the proposed approach both in terms of the number of page transfers required for searching and the page filling percentage.