DocumentCode
2500684
Title
Scheduling of page fetches in join operations using B c-trees
Author
Goyal, P. ; Li, H.F. ; Regener, E. ; Sadri, F.
Author_Institution
Concordia Univ., Montreal, Que., Canada
fYear
1988
fDate
1-5 Feb 1988
Firstpage
304
Lastpage
310
Abstract
The authors consider B c-trees in a centralized system with large main memory, and show that in some cases the join operation using B c-trees out performs other join techniques. The results can be used for estimating the cost of join using B c-trees and then making a decision regarding the most efficient join technique to be used
Keywords
data structures; database management systems; database theory; scheduling; trees (mathematics); Bc-trees; centralized system; join cost estimation; join operations; join technique; main memory; page fetches; scheduling; Databases; Indexing; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 1988. Proceedings. Fourth International Conference on
Conference_Location
Los Angeles, CA
Print_ISBN
0-8186-0827-7
Type
conf
DOI
10.1109/ICDE.1988.105473
Filename
105473
Link To Document