11. A method implemented on a machine having at least one processor, storage, and communication platform, comprising: traversing through a plurality of data elements organized in a multi-level nested data structure and represented using a predefined syntax, wherein each data element includes a name portion and a value portion; and for each data element encountered in the multi-level nested data structure, if the data element is located at two levels outside an innermost level, then constructing a new table as a current table corresponding to the data element, if the data element 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 data element, and if the data element is located at the innermost level, then adding the data element to the current row of the current table as a field, wherein the field has a name corresponding to the name portion of the data element and a value corresponding to the value portion of the data element.
11. A method implemented on a machine having at least one processor, storage, and communication platform, comprising: traversing through a plurality of data elements organized in a multi-level nested data structure and represented using a predefined syntax, wherein each data element includes a name portion and a value portion; and for each data element encountered in the multi-level nested data structure, if the data element is located at two levels outside an innermost level, then constructing a new table as a current table corresponding to the data element, if the data element 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 data element, and if the data element is located at the innermost level, then adding the data element to the current row of the current table as a field, wherein the field has a name corresponding to the name portion of the data element and a value corresponding to the value portion of the data element. 14. A method as recited in claim 11 , further comprising: discarding each data element encountered that is located at more than two levels outside the innermost level.