Clement H. C. Leung

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Kevin H. Liu

> Home > Persons > Clement H. C. Leung

Publications

2004
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/isci/TaniarTLL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/TaniarTLL04
David Taniar, Rebecca Boon-Noi Tan, Clement H. C. Leung, Kevin H. Liu:
Performance analysis of "Groupby-After-Join" query processing in parallel database systems. Inf. Sci. 168(1-4): 25-50 (2004)
2002
[j24]
- no documents available
  - details & citations
- export record
  dblp key:
  - journals/informaticaSI/TaniarJLL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informaticaSI/TaniarJLL02
David Taniar, Yi Jiang, Kevin H. Liu, Clement H. C. Leung:
Parallel Aggregate-Join Query Processing. Informatica (Slovenia) 26(3) (2002)
1999
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/hipc/JiangLL99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hipc/JiangLL99
Yi Jiang, Kevin H. Liu, Clement H. C. Leung:
Parallel Algorithms for Queries with Aggregate Functions in the Presence of Data Skew. HiPC 1999: 207-211
1996
[c12]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/adc/LiuJL96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/adc/LiuJL96
Kevin H. Liu, Yi Jiang, Clement H. C. Leung:
Query Execution in the Presence of Data Skew in Parallel Databases. Australasian Database Conference 1996

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.