Abstract: A computerized mechanism to formulate a data flow representation from a syntax tree. The syntax tree may be, for instance, an abstract syntax tree (AST) that is formulated by compiling query script, such as big data query script. Each node in the syntax tree is composed of one or more tokens (script portions) that are taken from the query script, which relationships between the tokens being syntactically represented by links between those tokens. Accordingly, the data flow representation may also be a data flow representation of the original query script itself. In order to formulate the data flow representation from the syntax tree, the data types of the various inputs and outputs of the syntax tree nodes are identified and bound to a corresponding data flow. This may be performed whilst honoring dependencies between the nodes. The data flow may be visualized to an author or reviewer of the script.

Abstract: A user trainable user interface page classification system applies a rule set to information associated with a user interface page to determine whether the user interface page satisfies a domain page condition. If the user interface page does not satisfy the domain page condition, a user trains the system such that the user interface page classification system classifies the user interface page as a domain page. The rule set of the user interface page classification system is updated, and the updated rule set is applied to the information associated with the user interface page. The user interface page classification system then classifies the user interface page as a domain page.

Abstract: A user trainable user interface page classification system applies a rule set to information associated with a user interface page to determine whether the user interface page satisfies a domain page condition. If the user interface page does not satisfy the domain page condition, a user trains the system such that the user interface page classification system classifies the user interface page as a domain page. The rule set of the user interface page classification system is updated, and the updated rule set is applied to the information associated with the user interface page. The user interface page classification system then classifies the user interface page as a domain page.

Abstract: A user trainable user interface page classification system applies a rule set to information associated with a user interface page to determine whether the user interface page satisfies a domain page condition. If the user interface page does not satisfy the domain page condition, a user trains the system such that the user interface page classification system classifies the user interface page as a domain page. The rule set of the user interface page classification system is updated, and the updated rule set is applied to the information associated with the user interface page. The user interface page classification system then classifies the user interface page as a domain page.

Abstract: A computerized mechanism to formulate a data flow representation from a syntax tree. The syntax tree may be, for instance, an abstract syntax tree (AST) that is formulated by compiling query script, such as big data query script. Each node in the syntax tree is composed of one or more tokens (script portions) that are taken from the query script, which relationships between the tokens being syntactically represented by links between those tokens. Accordingly, the data flow representation may also be a data flow representation of the original query script itself. In order to formulate the data flow representation from the syntax tree, the data types of the various inputs and outputs of the syntax tree nodes are identified and bound to a corresponding data flow. This may be performed whilst honoring dependencies between the nodes. The data flow may be visualized to an author or reviewer of the script.

Abstract: A computerized mechanism to automatically correlate positions of query script to portions of a data flow representation of the query script. When parsing the query script to generate the tokens, at least some of the tokens have an associated script location marker that identifies a location in the query script where the token originated from. The syntax tree of multiple nodes is then formulated, each node comprising one or more of the tokens parsed from the query script. Accordingly, the syntax tree retains the script location markers. A data flow representation of the query script is then formulated into a data flow representation. That data flow representation might, for instance, be based on the syntax tree, but augmented with data types of the various data flows. Nevertheless, the location marker is retained within the data flow representation.