"Top-k Closest Pairs Join Query: An Approximate Algorithm for Large High ..."

Fabrizio Angiulli, Clara Pizzuti (2004)

> Home

Details and statistics

DOI: 10.1109/IDEAS.2004.63

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  - electronic edition @ ieeecomputersociety.org
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ideas/AngiulliP04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ideas/AngiulliP04
Fabrizio Angiulli, Clara Pizzuti:
Top-k Closest Pairs Join Query: An Approximate Algorithm for Large High Dimensional Data. IDEAS 2004: 103-110

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.