집합 값을 갖는 애트리뷰트에 대한 수직적으로 분할된 블록 중첩 루프 조인

• 영문명: Vertically partitioned block nested loop join on set-valued attributes
• 발행기관: 강원대학교 산업기술연구소
• 저자명: 황환규(Whang Whan Kyu)
• 간행물 정보: 『산업기술연구』vol.28, 209~214쪽, 전체 6쪽
• 주제분류: 공학 > 공학일반
• 파일형태: PDF
• 발행일자: 2008.09.30

영문 초록

Set-valued attributes appear in many applications to model complex objects occurring in the real world. One of the most important operations on set-valued attributes is the set join, because it provides a various method to express complex queries. Currently proposed set join algorithms are based on block nested loop join in which inverted files are partitioned horizontally into blocks. Evaluating these joins are expensive because they generate intermediate partial results severely and finally obtain the final results after merging partial results. In this paper, we present an efficient processing of set join algorithm. We propose a new set join algorithm that vertically partitions inverted files into blocks, where each block fits in memory, and performs block nested loop join without producing intermediate results. Our experiments show that the vertical bitmap nested set join algorithm outperforms previously proposed set join algorithms.

목차

Abstract

1. Introduction

2. Related Work

3. Proposed Method

4. Performance Results

5. Conclusions and Future Work

참고문헌

키워드

집합 값 애트리뷰트 역 파일 비트맵 블록 중첩 루프 조인 겹침 조인 set-valued attributes inverted file bitmap Block Nested Loop join overlap join