Browse Prior Art Database

Algorithm for defining default connection between components and products in software catalog

IP.com Disclosure Number: IPCOM000241228D
Publication Date: 2015-Apr-07
Document File: 2 page(s) / 42K

Publishing Venue

The IP.com Prior Art Database

Abstract

Algorithm for defining default connection between components and products in software catalog

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 51% of the total text.

Page 01 of 2

Algorithm for defining default connection between components and products in software catalog

Disclosed is a new algorithm for calculating default connection between components and products in software catalog.

Software catalog is a textual document which serves as an index during software scans to automatically identify installed software products on scanned endpoints. The document contains information about software products and corresponding components which can have many-to-many relations, it's also possible that one product is contained by another product. The problem that arises is that software scans detect components not final products (which usually consists of multiple components), and it's not trivial to match the components with the final products.

The proposed solution utilizes purely the information contained within the catalog itself to suggest the best match for components. The suggestion is provided as a score (the lower the better) and is calculated based on names similarity and by penalizing undesired keywords. In this publication a solution which favorites production (chargeable) software versions over free (demo, etc.) releases is presented. The goal of this publication is to demonstrate how Levensthein distance can be utilized in the area of software discovery and management. Having the information about components and products which have direct connections the distance between the names of the components and the products can be calculated.

Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance...