Introducing Multi-Level Nested Kits Into Existing E-Commerce Systems

• US 20080071840A1
• Filed: 09/14/2006
• Published: 03/20/2008
• Est. Priority Date: 09/14/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hoyos, Carlos, Srikanth, Viswanath, Perazolo, Marcelo, Balasubramaniam, Rajesh
• Application Number:
  US11/531,722
• Publication Number:
  US 20080071840A1
• Time in Patent Office: Days
• US Class Current: 707/200
• CPC Class Codes: G06F 16/2255 Hash tables

Abstract

A representation of static and dynamic nested kits in an existing e-commerce ordering system to facilitate migration of existing e-commerce systems to support nested kits. Physical components of a nested kit remain in an order item table of a database, but non-physical components are placed in a separate database table, and the in-memory representation of the nested kit is represented as a hash-map of nodes, where each node is aware of its parent and child relationship.

Claims

1. A method comprising:

storing physical components of a nested kit in an order item table of a database;

storing the entire nested kit relationship in a separate table; and

providing a representation of the nested kit as a hash map of nodes where each node is aware of a node parent relationship and node children relationship.

2. A method of claim 1 wherein:

each entry in the hash map comprises information about the entry.

3. A method of claim 1 wherein:

each entry in the hash map comprises a link to the node parent and the node children.

4. The method of claim 1 wherein:

each entry in the hash map comprises a link to a parent and a child of the entry.

5. The method of claim 1 wherein:

upon actuation of a part of a display, an associated key assists in making a direct access to a node corresponding to the key and displays details associated with the node corresponding to the key.

6. The method of claim 1 further comprising:

facilitating packslip generation by relying on the representation of the node.

7. A system comprising:

a processor;

a data bus coupled to the processor; and

a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code comprising instructions executable by the processor and configured for;

storing physical components of a nested kit in an order item table of a database; and

,

providing an in memory representation of the nested kit as a hash map of nodes where each node is aware of a node parent relationship and node children relationship.

8. The system of claim 7, wherein:

each entry in the hash map comprises information about the entry.

9. A system of claim 7 wherein:

each entry in the hash map comprises a link to the node parent and the node children.

10. The system of claim 7 wherein:

each entry in the hash map comprises a link to a parent and a child of the entry.

11. The system of claim 7 wherein:

upon actuation of a part of a display, an associated key assists in making a direct access to a node corresponding to the key and displays details associated with the node corresponding to the key.

12. The system of claim 7 wherein:

the hash map nodes facilitate packslip generation by relying on the in memory representation of the node.

13. A computer program product comprising:

a computer usable medium having computer usable program code embodied therewith, the computer usable program code comprising

computer usable program code configured to store physical components of a nested kit in an order item table of a database; and

computer usable program code configured to provide a representation of the nested kit as a hash map of nodes where each node is aware of a node parent relationship and node children relationship.

14. The computer program product of claim 13, wherein:

each entry in the hash map comprises information about the entry.

15. The computer program product of claim 13 wherein:

each entry in the hash map comprises a link to the node parent and the node children.

16. The computer program product of claim 13 wherein:

each entry in the hash map comprises a link to a parent and a child of the entry.

17. The computer program product of claim 13 wherein:

upon actuation of a part of a display, an associated key assists in making a direct access to a node corresponding to the key and displays details associated with the node corresponding to the key

18. The computer program product of claim 13 wherein:

the hash map nodes facilitate packslip generation by relying on the in memory representation of the node.