Operations on Multi-Level Nested Data Structure
First Claim
1. A method, comprising:
- traversing through a data stream containing a plurality of nested levels of name-value pairs; and
for each name-value pair encountered,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.
9 Assignments
0 Petitions
Accused Products
Abstract
Multiple sets of data are obtained from different sources. Each data set is represented using a different format having a different syntax and organized in a multi-level nested data structure. Each data set is reformatted into a standardized table format using a depth-first recursive algorithm without relying on the syntax schema of the original format of the data set. Various operations are performed on the tables corresponding to the data sets, including but not limited to joining multiple tables, grouping selected rows of a table, ranking rows of a table, adding or deleting fields from selected rows of a table, etc. Optionally, inferred namespace and text normalization are utilized for selected table operations. One or more templates are provided for converting the data set of a table to a format that may be presented to a user.
57 Citations
20 Claims
-
1. A method, comprising:
-
traversing through a data stream containing a plurality of nested levels of name-value pairs; and for each name-value pair encountered, 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method, 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, 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. - View Dependent Claims (13, 14, 15, 16)
-
-
17. A computer program product comprising a computer-readable medium having a plurality of computer program instructions stored therein, which are operable to cause at least one computing device to:
-
traverse through a data stream containing a plurality of nested levels of name-value pairs; and for each name-value pair encountered, if the name-value pair is located at two levels outside an innermost level, then construct 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 construct 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 add the name-value pair to the current row of the current table as a field. - View Dependent Claims (18, 19, 20)
-
Specification