✦ LIBER ✦

Select-partitioned join: An improved partition-based join algorithm

✍ Scribed by Ho Chang; Jong Soo Park; Myunghwan Kim

Book ID: 107953392
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 916 KB
Volume: 16
Category: Article
ISSN: 0959-2954
DOI: 10.1016/0306-4379(91)90015-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hybrid join: an improved sort-based join

Hybrid join: an improved sort-based join algorithm

✍ Hwang Kyu Choi; Myunghwan Kim 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Join during merge: An improved sort base

Join during merge: An improved sort based algorithm

✍ M. Negri; G. Pelagatti 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Uniform partitioning of relations using

Uniform partitioning of relations using histogram equalization framework: An efficient parallel hash-based join

✍ Ung Kyu Park; Hwang Kyu Choi; Tag Gon Kim 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 612 KB

An improved circuit-partitioning algorit

An improved circuit-partitioning algorithm based on min-cut equivalence relation

✍ Xianyang Jiang; Xubang Shen; Tianxu Zhang; Huayu Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Network flow is an excellent approach to finding min-cuts in network because of the celebrated maxflow/min-cut theorem. For a long time, however, it has not been a practical circuit partitioning method for its relatively high computational complexity. Algorithm FBB is the first one to apply network

An efficient permutation-based parallel

An efficient permutation-based parallel algorithm for range-join in hypercubes

✍ Hong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 731 KB

An efficient profile-based algorithm for

An efficient profile-based algorithm for scratchpad memory partitioning

✍ Angiolini, F.; Benini, L.; Caprara, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 1010 KB