"Computational Complexity of Sorting and Joining Relations with Duplicates."

Mahdi Abdelguerfi, Arun K. Sood (1991)

> Home

Details and statistics

DOI: 10.1109/69.109110

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  authority control:
- export record
  dblp key:
  - journals/tkde/AbdelguerfiS91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkde/AbdelguerfiS91
Mahdi Abdelguerfi, Arun K. Sood:
Computational Complexity of Sorting and Joining Relations with Duplicates. IEEE Trans. Knowl. Data Eng. 3(4): 496-503 (1991)

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.