Abstract
This paper presents an algorithm to perform batch insertions into tree structured files. The efficiency of the algorithm is formally analyzed. To demonstrate the usefulness of the algorithm, optimum batch insertion points are determined in one particular example. The example demonstrates that batch operations for tree structured files may be used to achieve the advantages of a differential database representation and, at the same time, avoid the drawbacks previously attributed to the use of differential files.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
