Optimization of Queries with Fragmented Relations and Large Join Queries
碩士 === 國立中興大學 === 資訊科學學系 === 83 === Aiming at reducing the communication cost for distributed query optimization, this thesis investigates two problems, minimizing the communication cost for queries that refer to n fragments (n>=2...
Main Authors: | Chun-Xian Chang, 張純嫻 |
---|---|
Other Authors: | Kuen-Fang J.Jea |
Format: | Others |
Language: | en_US |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/03335774856839337995 |
Similar Items
-
Efficient algorithms for optimizing large join queries
by: Huang, Shang Yi, et al.
Published: (1995) -
Optimization for Multi-Join Queries on the GPU
by: Xue-Xuan Hu, et al.
Published: (2020-01-01) -
Answering Join Queries Instantly
by: Hamdi, Mohammed
Published: (2018) -
A new approach to join reordering in query optimization
by: Pilehvar, Mostafa
Published: (2005) -
RELATION CO-CLUSTERING FOR FAST JOIN QUERY PROCESSING
by: Asiri, Metab Saeed
Published: (2017)