Join Strategies on Grid-Files
スポンサーリンク
概要
- 論文の詳細を見る
Recently, many research on multi-attribute clustered relations have been done. The multi-attribute clustering technique is the one which divides the relation into several pages according to the value of not only the primary-key attribute. It treates all attributes symmetrically. In a previous publication, we have introduced join strategies on KD-tree indexed relations. In this paper we present join strategies on Grid-files (Grid-join algorithms) showing that the I/O cost is reduced to the minimum.
- 一般社団法人情報処理学会の論文
- 1990-03-14
著者
-
Takagi Mikio
University Of Tokyo
-
Kitsuregawa M
Institute Of Industrial Science The University Of Tokyo
-
Kitsuregawa Masaru
University Of Tokyo
-
Harada Lilian
University of Tokyo
-
Harada L
Fujitsu Lab.
関連論文
- 5ZN-9 A Topical Study on the Web Spam
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
- Relational Algebra Machine GRACE
- Compact Encoding of the Web Graph Exploiting Various Power Distributions(Discrete Mathematics and Its Applications)
- Finding Neighbor Communities in the Web Using an Inter-Site Graph(Database)
- Join Strategies on Grid-Files
- Join Strategies on Multi-Dimensional C1ustered Relations
- Detecting Hijacked Sites by Web Spammer Using Link-Based Algorithms
- On Parallel Hash-Join Processing with Skewed Data
- Pipeline Stage Based Dynamic Load Balancing for Right-Deep Multi-Joins