System and method for storing and searching buy and sell information of a marketplace

• US 6,286,002 B1
• Filed: 11/14/1997
• Issued: 09/04/2001
• Est. Priority Date: 01/17/1996
• Status: Expired due to Term

• Current Assignee: Tumbleweed Holdings LLC (Equitable IP Corporation)
• Original Assignee: @YOURCOMMAND
• Inventors: Peckover, Douglas L., Axaopoulos, Jack, Carpenter, James F. Jr.
• Primary Examiner(s): Alam, Hosain T.
• Application Number:
  US08/970,470
• Time in Patent Office: 1,390 Days
• Field of Search: 707/10, 707/1-6, 707/104, 705/26.14, 705/35-40, 705/7-10, 705/26, 705/27, 395/200.47, 395/200.48
• US Class Current: 1/1
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 30/0633 Lists, e.g. purchase orders, compilation or processing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

A method of accessing a database using a computer system. One example of the method includes the following steps. Access a tree data structure. The tree data structure includes a set of nodes linked in parent, child and sibling relations. Each node of a subset of nodes is associated with a corresponding term. Select some nodes of the set of nodes. This includes selecting a node of the set of nodes. The node has at least a sibling node. In response to selecting the node, performing one of the following actions. If the node is a first type of node, allowing a selection of the sibling node. If the node is a second type of node, not allowing a selection of the sibling node. Record a list of node selections corresponding to the selection of some nodes. Extract a set of terms from the list of node selections. Create a data structure including price information and duration of existence information. Store the data structure in the database using the set of terms. The data structures in the database can be accessed and analyzed.

Claims

1. A method of storing prospective and actual buying and selling information using a computer system, said method comprising:

accessing a first data structure, said first data structure including a set of nodes, said set of nodes having nodes with parent node and child node references;

selecting, by a software agent, a subset of said set of nodes including selecting a first node of subset of nodes, said first node having a parent node, said first node being a child node of said parent node, said parent node having a second child node, during said selecting of said subset of nodes, determining whether a selection of said second child node is possible upon selection of said first node and using said determination to allow or disallow the selection of said second child node;

recording a list of node selections corresponding to said subset of nodes;

extracting a set of terms corresponding to said list, wherein said set of terms correspond to product/service information;

a first program for receiving a series of communications, each communication defining a node to be selected;

said first program for accessing said first data structure and for determining a set of selectable nodes upon receipt of a communication;

said first program for causing a presentation about said set of selectable nodes;

storing said first data structure including storing said list of nodes in said first data structure;

storing said first data structure including using said set of terms as keys to index said first data structure in a data base;

storing a second data structure including said set of terms.

2. The method of claim 1 wherein said recording said list of node selections includes storing a path indicating an order of selection.

3. The method of claim 1 wherein said determining includes testing the type of parent node to determine whether said parent node will allow for the selection of multiple child nodes of said parent node.

4. The method of claim 1 wherein said determining includes testing whether said first node will allow for the selection of multiple child nodes of said parent node.

5. The method of claim 1 wherein said determining includes testing whether said parent node is a multinode, a category node, or an option node and if said parent node is a multinode, allowing selection of said second child node upon selection of said first child node.

6. The method of claim 1 wherein extracting said set of terms includes testing each node in said list of nodes to determine whether said node is associated with a term and including each associated term in said set of terms.

7. The method of claim 1 further including creating said second data structure and said software agent including said information including an offer price, a time period, and a description, said time period defining the time period for which the agent should be stored, the description defining a product being offered.

8. The method of claim 1 further including creating said second data structure and said software agent including said information including a buy price range, a time period, and a description, said buy price range indicating a price range that a user is willing to pay for a product, said time period defining the time period for which the agent should be stored, the description defining a product being sought.

9. The method of claim 1 further including creating said second data structure and said software agent including said information including an event definition and an action definition, said event definition defining an event upon which said agent should act, and said action defintion defining the action to be taken by said agent upon the occurrence of the event.

10. The method of claim 9 wherein said event definition defines the event as a second set of nodes are selected that correspond to a superset of said set of terms and wherein said action definition defines that the creator of said agent should be notified.

11. The method of claim 9 wherein said action definition defines that a user should be emailed with a notification that the event defined by said event definition has occurred.

12. A computer system for storing prospective and actual buying and selling information, said computer system comprising:

a server including a first program and a database, said first program for providing accessing to a first data structure, said first data structure for organizing access by a plurality of software agents to said database and for storing a record of paths said software agents used to traverse said first data structure, said first data structure allowing the selection of multiple alternative paths from some point in the first data structure and not allowing the selection of multiple alternative paths from another point in the first data structure;

a client including a second program, said client being coupled in communications with said server, said second program for presenting data from said server about said first data structure and possible paths available from a point in said first data structure, said second program for receiving selection signals, said selection signals identifying choices taken between alternative paths to traverse said first data structure; and

wherein said server further includes a second data structure, said second data structure being associated with a path used to traverse said first data structure, said second data structure having been stored in response to a request by said second program to store said second data structure with said path.

13. The computer system of claim 12 wherein said server includes an internet server, said second program includes a browser program, and said information is communicated between said internet server and said browser program.

14. The computer system of claim 12 wherein said database includes a relational database and where said path is used to index said second data structure in said relational database.

15. The computer system of claim 12 wherein said second program includes a browser program and wherein said browser has an URL for accessing said server, said URL including a definition of said path for said second data structure, said definition of said path allowing said second program to request a retrieval of all data structures associated with said path.

16. The computer system of claim 12 wherein said software agent includes information including a offer price, a time period, and a description, said time period defining the time period for which the agent should be stored, the description defining a product being offered.

17. The computer system of claim 12 wherein said software agent includes information including a buy price range, a time period, and a description, said buy price range indicating a price range that a user is willing to pay for a product, said time period defining the time period for which the agent should be stored, the description defining a product being sought.

18. The computer system of claim 12 wherein said software agent includes information including an event definition and action definition, said event definition defining an event upon which said agent should act, and said action definition defining the action to be taken by said agent upon the occurrence of the event.