Method for Processing Structured Data Using an Object-Oriented Computer Language

1. A memory accessible to an application program being executed on a data processing system, comprising: an object-oriented data structure stored in said memory, the data structure for encapsulating data used by the application program and including a base dictionary object implemented as a hashtable and being capable of storing value type data and container type data, said container type data being capable of storing said value type data and said container type data, said base dictionary object containing at least one datum of either said value type data or said container type data and having a name arranged in a table, said base dictionary object being chosen from a class of dictionary objects, said data being encapsulated by adding said at least one datum to an empty instance of said base dictionary object and, if said datum is of said value type data, storing said datum under a particular name in said base dictionary object and, if said datum is of said container type data, creating a new dictionary sub-object stored in, and accessible from, said base dictionary object under the particular name, said sub-object being capable of storing said value type data and said container type data; wherein additional data is configured to be dynamically added to said base dictionary object, said sub-object or an additional sub-object according to the type of data.

2. The memory according to claim 1 wherein the data structure further comprises at least one marker for separating corresponding ones of either said container type datum or said value type datum.

3. The memory according to claim 2 wherein said marker comprises a character included with said particular name corresponding to said datum.

4. The memory according to claim 1 further comprising a database for storing said data.

5. The memory according to claim 1 wherein said data originates from a web page.

6. A method for encapsulating data for storage thereof, each datum being one of value type data and container type data, wherein said container type data is capable of storing said value type data and said container type data, said method comprising: choosing a base dictionary object from a class of dictionary objects, said dictionary object capable of storing said value type data and said container type data; creating an empty instance of said base dictionary object and implementing a hashtable in said base dictionary object for storing said datum; and adding a datum to said base dictionary object, said datum having a name arranged in a table, wherein if said datum is of said value type data, storing said datum under a particular name in said base dictionary object and, if said datum is of said container type data, creating a new dictionary sub-object stored in, and accessible from, said base dictionary object under the particular name, said sub-object being capable of storing said value type data and said container type date.

7. A method according to claim 6 further comprising: obtaining an additional datum; adding said additional datum to said base dictionary object under a second particular name if said additional datum is of said value type data; adding said additional datum to said sub-object under the second particular name if said additional datum is of said value type data and a member of said sub-object; and creating an additional dictionary sub-object stored in and accessible from said base dictionary object under the second particular name if said additional datum is of said container type data.

8. A method according to claim 7 further comprising repeating the adding and creating for at least one further datum included in a set of said data.

9. A method according to claim 6 further comprising storing said datum in a database.

10. A method according to claim 6 further comprising including a marker with said particular name corresponding to said datum for separating said datum from others of said data.

11. A method according to claim 6 wherein said data originates from a web page.

12. A method according to claim 6 wherein the determination that said datum is of said container type data is made based on the determination that said particular name corresponding to said datum includes a container indicia.

13. A method for updating a set of data encapsulated in a base dictionary object implemented as a hashtable to include a new datum, each datum in said set of data being one of a value type data and a container type data and having a name arranged in a table, said value type data capable of being stored in said container type data said method comprising: determining a name and type of said new datum; if said type of said new datum is said value type, searching said table to determine if said name of said new datum is included in said table, if said name of said new datum is included, updating said base dictionary object with said new datum, if said name of said new datum is not included, adding said new datum to said base dictionary object and adding the name to said table; and if said name of said new datum is said container type, searching said table to determine if a sub-object exists having said name of said new datum, if said sub-object exists, updating said sub-object to include said new datum, if said sub-object does not exist, creating a new sub-object including said new datum and storing said new sub-object in said base dictionary object.

14. A method according to claim 13 wherein said new datum originates from a web page.