Table of Contents

Search

  1. Preface
  2. Introduction
  3. Defining a System
  4. Flattening IDTs
  5. Link Tables
  6. Loading a System
  7. Persistent-ID (Dynamic Clustering)
  8. Cluster Governance
  9. Static Clustering
  10. Simple Search
  11. Search Performance
  12. Miscellaneous Issues
  13. Limitations
  14. Error Messages

Search Performance

Search Performance

A search client calls the MDM-Registry Edition with a search record. The Server retrieves a set of similar records from the database (known as the candidate-set).
Each candidate is scored against the search record to determine the degree of similarity. Records that score above the score-threshold defined in the Search-Definition are returned to the search client.
The process may be optimized by:
  • reducing the size of the candidate-set, thereby reducing the amount of scoring required, and/or
  • reducing the cost of scoring two records, and/or
  • reducing the size of the IDX to improve database cache efficiency
The following sections discuss ways in which to achieve these goals.

0 COMMENTS

We’d like to hear from you!