Skip to search formSkip to main contentSkip to account menu

Merge algorithm

Known as: Merge tree, Balanced k-way merge sort, K-way merge 
Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements… 
Wikipedia (opens in a new tab)

Related topics

Related topics

37 relations
AlgorithmAll nearest smaller valuesAnalysis of parallel algorithmsArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Towards Visual Mega-Analysis of Voxel-based Measurement in Brain Cohorts
We present a visualization prototype for comparative analysis of factional anisotropy (FA) distributions constructed from three… 
2011
2011
Research on Subjective Trust Model Based on Cloud Model for Open Networks
The subjective trust relationship is uncertain in the open network; it has fuzziness and uncertainty of dual characteristics… 
Review
2011
Review
2011
Observability of Dual AGN in Merging Galaxies
Supermassive black holes (SMBHs) have been detected in the centers of most nearby massive galaxies. Galaxies today are the… 
2008
2008
Visual Tracing of Automatic Ontology Merging
Modern distributed systems frequently use autonomous software agents that use ontologies for communication. If each agent owns an… 
2008
2008
A Linear List Merging Algorithm
Abstract : A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element… 
2005
2005
A Fault-Tolerant Three-Way Merge for XML and HTML
Three-way merging is a technique that is used to reintegrate changes to a document when multiple independently modified copies… 
2001
2001
Data classification and management in very large data warehouses
A data warehouse mainly deals with historical data and specialized retrieval. In this research, we classify historical data and… 
2000
2000
Topology-independent region tracking with level sets
This paper presents a new approach to the tracking of regions in an image sequence. Unlike most other methods, the proposed… 
1993
1993
A Log-Structured History Data Access Method (LHAM)
There are numerous applications that require on–line access to a history of business events. Ideally, both historical and current… 
1992
1992
An index implementation supporting fast recovery for the POSTGRES storage system
The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)