This invention relates to a method for converting and storing classification data of existing codes having different numbers of levels and different number of digits in each level in their hierarchial structure.
The world is fast moving towards computerization and the current wave in IT is e-commerce. With all companies and business houses vying for a domain in the cyber world, the e-business applications are becoming more and more popular. A majority of these applications are business to business (B2B) in nature where buyers and sellers negotiate trade over the electronic media. A major problem faced in such cases is of cataloging the products and providing some universal method of categorizing them. The products are generally identified using product identification number and are classified in a hierarchial structure using codes. These are generally numeric codes, with different predefined levels used to classify things.
For example a hypothetical 3 digit 3 level code would look like:
Currently, there are a variety of codes available on the internet that classify products and services which can be used by applications:—Harmonic, NACE, NAFTA are a few popular ones. However, there is no code, which is exhaustive and completely covers all domains of services and products. One caters to services, the other to products, one caters to the IT industry, another to manufacturing. For example, the Harmonic code, which is the most widely used code (used majority of applications and by trade opportunities sites) does not have the product category ‘Computer’ in it. Probably when it was created, computers were not popular.
Forming new codes is an option but customers are already used to some universal codes and refrain from using a new set of codes. This approach also prevents integration of such applications with other existing applications and with those of business partners. It also leads to confusion amongst the buyers and sellers.
The above scenario necessitates the use of more than one of the available codes and the ability to use or choose from any of them. This presents the following problems:
These problems drive the need for a generalized method to implement all codes, without difficulty and minimum effort for implementing applications over them. The method should be valid for any code and every code, for one code and any number of codes, together as well as separately.
The object of this invention is to provide a simple and effective system for enabling the storage and use of diverse classification systems in an integrated manner. The invention further not only caters to Product codes but can be used in any application where objects need to be classified in a hierarchy, for example, file systems, computer trees, users and user groups, industry segments.
To achieve the said objective this invention provides in a computing system consisting of a central processing unit with associated memory, input output devices and data storage means, a method for converting and storing classification data of existing codes having different numbers of levels and different number of digits in each level in their hierarchial structure, comprising converting the said existing codes in an integrated manner to a tabular format containing the description of existing codes, level of each code and link to the parent code, by a converting means and storing the said tabular format in the said data storage means, such that it is accessible by a common access means.
The said format contains the said existing codes such that the end user is able to see the existing code. The said format is compatible to all codes such that conversion to this format from any existing code is smooth and simple.
The said format has the following fields:
The said fields and their sizes are based on the application requirement.
In a specific embodiment the said format has the following fields:
All the existing codes and new codes are identified by the serial number, which is a running number.
The original code and the description are stored as it is for display to the end user in the application.
All codes have the serial number of their parent code along with the level of the code in the heirarchy.
The said existing codes include the widely used Harmonic, NACE, NAICE/NAFTA codes.
New codes are added to the system as and when they are generated.
The said converting means is a software programme means. The said software programme is in any computer programming language such as Java, C, C++.
The said computing system is a part of a communication network.
The said communication network is the internet.
In the instant invention, as many codes as desired may be added one after the other.
All the codes are identified by the serial number (primary key of the table), which is a running number (tbl—srl—no). This can be used to identify all products within the application. This would be the index to all searches and postings and other activities on any system. The original code (tbl—code) and the description (tbl—description) are stored as it is from the original codes list. These will be used for display to the end user in the application. The type of code is stored against each code (tbl—code—type).
All codes also have the serial number of parent code i.e. of one level above them (tbl—up—srl—no). The hierarchy level of the code (tbl—level) is also stored, as well as the status indicating whether or not it is the last level (tbl—last—lvl).
Using the above, it is very simple to incorporate any code of any kind (with different lengths, with different levels and having different number of digits to indicate levels).
The serial number is used to identify codes and also can be used as the product identification number or there may be a table relating product identification with the serial number.
For example the hypothetical code mentioned above would look like:
Where ‘|’ is the separator used to separate different columns in a row, ÿn a row, Gÿn a row, is used for the code type.
For moving through the hierarchy of any code, simple traversal is also possible. For example in a simple buyer-seller application, the products will be shown as
This will have a link to the Next page passing the serialnumber as parameter
The only problem now remains is how to put the data files (containing the codes) into this table. This can be done by incorporating a simple conversion programme which includes text parsing means.
For example, the hypothetical code assumed above will be like
The conversion program written in any suitable language, say Java, reads the input file containing the existing codes and converts it to an output file in the required table format based on specified parameters defining the code structure i.e. code identifier, number of levels, number of digits in each level and a specified starting serial number of the output table, for example,
So for the hypothetical example assumed above, we can say
In the above it is assumed that all codes not at the lowest level have 0 s at the digits for the place to fill the blanks as is the case with all the standard codes. This can however be changed with simple modification in the Java file. Application builders can write their own text parsers as well with the same logic used.
Note: The codes which do not go down to the bottom of the hierarchy are not treated as the last level. For example, if a Harmonic code 99 99 00 does not have any children it will not be treated as the last level.
If it is desired to have all levels that do not have children to be treated as the last level, the same can be done with the simple SQL query after import
A typical example of an application using this method would be:
A company that allows posting of trade opportunities on the net wants to tie up with another (share Opportunities Database so that their users get a broader market on the Net). Now as we saw different companies use different codes. Company ‘A’ may use Harmonic Codes and company ‘B’ may use 2 level 4 digit codes. Integrating would be impossible and the only technique left would be to put these codes in the description of the opportunity. If, however, the mechanism proposed is followed it would be very simple to integrate the two sites and provide an effective method to post/search opportunities.
This design provides access to all and any codes in the same manner and while building applications over this design it provides the following advantages:
Further, this invention caters not only to products and to the B2B e-commerce application but is universal and can be used anywhere where classification is required.
Step 11 provides a plurality of code sets. Each code set is characterized by a code type, such as a Harmonic code type, a NACE code type, and a NAICE/NAFTA code type, etc. Each code set comprises a plurality of codes organized according to a hierarchal structure in which each code is at a code level of the hierarchal structure, as described supra. Either the code level of the code is a highest code level or the code is linked to a parent code, as described supra.
Step 12 generates the table and step 13 stores the generated table in a data storage of a computing system, such as the computer system depicted in
The software 97 may comprise computer code that: generates the table 96; stores the generated table 96 in the data storage 94; and reads data from the table 96 stored in the data storage 94 (e.g., the “select” statement illustrated supra).
The software 97 may additionally or alternatively comprise computer code that: converts the existing codes in an integrated manner to a tabular format, containing the description of existing codes, level of codes and links to the parent codes by a converting means; and stores the tabular format in the data storage means, such that it is accessible by a common access means.
Step 21 converts the existing codes in an integrated manner to a tabular format, containing the description of existing codes, level of codes and links to the parent codes by a converting means.
Step 22 stores the tabular format in the data storage means, such that it is accessible by a common access means.
Number | Name | Date | Kind |
---|---|---|---|
5164897 | Clark et al. | Nov 1992 | A |
5201047 | Maki et al. | Apr 1993 | A |
5777876 | Beauchesne | Jul 1998 | A |
5960164 | Dorfman et al. | Sep 1999 | A |
5974407 | Sacks | Oct 1999 | A |
6035298 | McKearney | Mar 2000 | A |
6154738 | Call | Nov 2000 | A |
6279008 | Tung Ng et al. | Aug 2001 | B1 |
6385618 | Ng et al. | May 2002 | B1 |
6510433 | Sharp et al. | Jan 2003 | B1 |
6516326 | Goodrich et al. | Feb 2003 | B1 |
6609128 | Underwood | Aug 2003 | B1 |
6711593 | Gordon et al. | Mar 2004 | B1 |
6754666 | Brookler et al. | Jun 2004 | B1 |
6789195 | Prihoda et al. | Sep 2004 | B1 |
20030126139 | Lee et al. | Jul 2003 | A1 |
Number | Date | Country |
---|---|---|
1071041 | Jan 2001 | EP |
1324221 | Jul 2003 | EP |