Year: 1991
Type: article
Abstract: This paper describes a new algorithm for performing joins in the absence of access paths.This algorithm is shown to perform better than the Merging Scan algorithm, which can be considered the paradigm of join algorithms.Finally this algorithm is compared with another recent sub-soti-merge algorithm.
Authors: M. Negri, G. Pelagatti
Institutions: University of Brescia, Politecnico di Milano
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2005272677