Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Methods of implementation of the MUMPS global data-base.

J Bowie

    Medical Informatics = Medecine Et Informatique
    |July 1, 1979
    PubMed
    Summary

    The standardized MUMPS language requires efficient data handling. Balanced-tree implementations of MUMPS globals offer significant advantages over traditional linked block methods in most environments.

    Related Concept Videos

    You might also read

    Related Articles

    Articles linked to this work by shared authors, journal, and citation graph.

    Sort by
    Same author

    A unique case of acute embolus in a renal transplant with salvage by catheter-directed thrombolysis.

    Scottish medical journal·2016
    Same author

    Improving cervical cancer screening in hospital settings.

    Preventive medicine·2000
    Same author

    Postoperative pain control with a new transdermal fentanyl delivery system. A multicenter trial.

    Anesthesiology·1995
    Same author

    Anaemic beef carcases.

    The Veterinary record·1993
    Same author

    Low plasma iron status and akathisia.

    Journal of neurology, neurosurgery, and psychiatry·1990
    Same author

    Clinical significance of ultrasonographically detected coincidental gallstones.

    Digestive diseases and sciences·1990

    Area of Science:

    • Computer Science
    • Programming Language Implementation
    • Database Management

    Background:

    • The recent standardization of the MUMPS language (ANSI X11.1-1977) has spurred interest in efficient implementation strategies.
    • A key challenge lies in the effective implementation of the MUMPS hierarchical data file, known as a global.

    Purpose of the Study:

    • To compare the efficiency of different implementation techniques for MUMPS globals.
    • To determine the most advantageous method for handling MUMPS hierarchical data structures.

    Main Methods:

    • Investigated two primary implementation techniques for MUMPS globals: traditional linked physical blocks and a self-indexing method based on balanced tree theory.
    • Conducted comparative analysis of these two methods within typical MUMPS environments.

    Main Results:

    • The balanced-tree implementation method demonstrated significant advantages.
    • This self-indexing approach proved more efficient compared to the traditional linked block technique.

    Conclusions:

    • Balanced-tree implementations are recommended for efficient MUMPS global management.
    • The self-indexing method represents a superior approach for modern MUMPS environments.

    Related Experiment Videos