Loading...
Please wait, while we are loading the content...
Similar Documents
A new algorithm for processing joins using the multilevel grid file (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kim, Sang-Wook Cho, Wan-Sup Lee, Min-Jae Whang, Kyu-Young |
| Description | Join is an operation that is frequently used and the most expensive in processing database queries. In this paper we propose a new efficient join algorithm(called the MLGF-Join) for relations indexed by the tnul~ilevrl grirlfile(MLGF), a multidimensional dynamic hashed file organization. The MLGF-Join uses the domain space partition maintained in the directory of the MLGF. The MLGF-Join can process a join with one scan of the relations to be joined, assuming a main memory buffer is available that is sufficiently large for a range-oriented subjoin. Besides, the MLGF-Join does not require the costly preprocessing such as sorting in the sort-merge join algorithm and domain partitioning in the hash join algorithm. We also discuss the advantages of the MLGF-Join over others based on multidimensional dynamic file organizations such as the grid file, K-D tree, and multikey hashing. 1 |
| File Format | |
| Language | English |
| Publisher Date | 1995-01-01 |
| Publisher Institution | In Proceedings of the 4th International Conference on Database Systems for Advanced Applications (DASFAA’95 |
| Access Restriction | Open |
| Subject Keyword | Sort-merge Join Algorithm Domain Partitioning Main Memory Buffer Domain Space Partition Range-oriented Subjoin Hash Join Algorithm Database Query New Algorithm Grid File New Efficient Join Algorithm Multilevel Grid File Multikey Hashing Multidimensional Dynamic File Organization Processing Join Costly Preprocessing K-d Tree Tnul Ilevrl Grirlfile File Organization |
| Content Type | Text |
| Resource Type | Article |
