Patent Document ID: 8078645
Application ID: 12170025

Base Claim:
1. A method implemented on a machine having at least one processor, storage, and communication platform, comprising: traversing through a data stream containing a plurality of name-value pairs organized in a multi-level nested data structure; and for each name-value pair encountered in the multi-level nested data structure, if the name-value pair is located at two levels outside an innermost level, then constructing a new table as a current table corresponding to the name-value pair, if the name-value pair is located at one level outside the innermost level, then constructing a new row within the current table as a current row corresponding to the name-value pair, and if the name-value pair is located at the innermost level, then adding the name-value pair to the current row of the current table as a field.

---

Claim 9:
9. A method as recited in claim 1 , further comprising: for each name-value pair encountered that is located at two levels outside the innermost level, determining a total size of data nested within the name-value pair; and selecting the table corresponding to the name-value pair located at two levels outside the innermost level that has the largest total size of data nested within the name-value pair.