Abstract: Methods and systems for automatically identifying and selecting preferred classification and regression trees are disclosed. Embodiments of the disclosed invention may be used to identify a specific decision tree or group of preferred trees that are predictively consistent across train and test samples evaluated against at least one node-specific constraint imposed by the decision-maker, while also having high predictive performance accuracy. Specifically, for a tree to be identified as preferred by embodiments of the disclosed invention, the train and test samples when evaluated node-by-node must agree on at least one key measure of predictive consistency. In addition to this node-by-node criterion, the decision-maker may adjust selection constraints to permit selection of a tree having a small number of node-by-node consistency disagreements, but with high overall tree predictive performance accuracy.

Abstract: Methods and systems for automatically identifying and selecting preferred size classification and regression trees are disclosed. The invention is used to identify a specific decision tree or group of preferred size trees that are consistent across train and test samples in node-specific details that are often important to decision makers. Specifically, for a tree to be identified as preferred by this system, the train and test samples must both agree on key measures for every terminal node of the tree. In addition to this node-by-node criterion, an additional tree selection method may be imposed. Accordingly, the train and test samples rank order the nodes on a relevant measure in the same way. Both consistency criteria may be applied in a fuzzy manner in which agreement must be close but need not be exact.

Abstract: The present invention provides a method and system for automatically identifying and selecting preferred classification and regression trees. The invention is used to identify a specific decision tree or group of trees that are consistent across train and test samples in node-specific details that are often important to decision makers. Specifically, for a tree to be identified as preferred by this system, the train and test samples must both agree on key measures for every terminal node of the tree. In addition to this node-by-node criterion, an additional tree selection method may be imposed. Accordingly, the train and test samples rank order the nodes on a relevant measure in the same way. Both consistency criteria may be applied in a fuzzy manner in which agreement must be close but need not be exact.

Abstract: A system and method for simplifying data access between tiers in a multi-tier system is disclosed. In an embodiment, a method is provided for receiving a request for service from a browser at a generic data access object (GDAO) layer; generating, by use of a data processor, a single, shared, generic data transfer object (GDTO) at the GDAO layer; calling through to a database tier, the database tier providing database metadata; and using the database metadata to include result data in the GDTO and return the GDTO in response to the request.

Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.

Abstract: A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object.

Abstract: Approaches for indexing and retrieving spatial data with a quadtree index in database management systems are described. In an embodiment, data objects are stored without decomposition within a linearized quadtree stored within a B-tree index. In another embodiment, a method determines an optimal execution plan for a spatial query by parsing it to determine a query type and geometry object associated with the query. The method tessellates the query object by recursively decomposing the quadtree blocks that cover it. Cost-based decomposition decisions are made by consulting a cost model furnished by the database management system to minimize the cost of the resulting index range plan on the B-tree storage. Thus, data-directed query decomposition enacted by the method results in the optimal cost index range plan for the current data distribution and system context. In another embodiment, a system identifies and displays an optimal index range plan in a user interface.

Abstract: A method of creating a family tree includes receiving a request from a user to return a file that includes the family tree and using a plurality of primary source records to construct the family tree based on the request. The records indicate multiple alternatives for at least one branch of the family tree. The method also includes sending a file that includes the family tree to the user. The file includes the alternatives.

Abstract: Systems, methods, and other embodiments associated with spatial query processing using query window indexes are described. One example method includes receiving a spatial query on spatial data that has an associated spatial data index. The spatial query specifies a query window. A query window index structure is constructed that describes a geometry of the query window. The query window index structure is compared to the spatial data index and, when necessary, to the spatial data to determine a spatial relationship between the query window and the spatial data.

Abstract: The present invention provides a method and system for managing various Regulations, Policies and Risks (RPR). These RPR are managed for supporting Governance, Risk and Compliance requirements of an organization. The method includes defining a tree structure for a context. The tree structure is defined for one or more RPR and one or more roles of a plurality of users of the organization. The RPR are intervened across various trees. A plurality of nodes is defined for the tree. Each node includes a plurality of attributes and one or more attribute functions.

Abstract: In an embodiment of the present invention, event handlers are used to trigger actions based on events occurring on a data stream. A process of the present invention involves creating the event handler, which may be embodied in, for example, software. The creation of the event handler involves parsing all of the rules in a manner that allows events themselves to trigger actions that will ultimately involve evaluation of rule and, if necessary, firing of those rules.

Abstract: A computer memory stores a data structure representing a ternary search tree (TST) representing multiple word n-grams for a corpus of documents. The data structure includes plural records in a first memory, each record representing a node of the TST and comprising plural fields. At least some n-grams have a sequence of units. The plurality of fields includes one for identifying a given unit of the sequence for a given node, one reserved for storing payload information for the given node, and plural child fields reserved for storing information for a first, second and third child nodes of the given node. The child fields store a null value indicating the absence of the child node or an identifier identifying a memory location of the child node. For at least one record, at least one of the child fields stores an identifier identifying a memory location of a memory different than the first memory.

Abstract: Event prediction using hierarchical event features is described. In an embodiment a search engine monitors search results presented to users and whether users click on those search results. For example, features describing the search result events are universal resource locator prefix levels which are inherently hierarchically related. In an embodiment a graphical data structure is created and stored and used to represent the hierarchical relationships between features. An online training process is used in examples which enables knowledge to be propagated through the graphical data structure according to the hierarchical relations between features. In an example, the graphical data structure is used to predict whether a user will click on a search result and those predictions are used by the search engine to rank search results for future searches. In another example the events are advertisement impressions and the predictions are used by an online advertisement system.

Abstract: User experience in a designer tool manages cogeneration of a database application and a database accessible through the application. A user places a visual representation of an application element designed to control a relational or hierarchical dataset. Code is automatically called to add the application element to the application, and automatically invoked to create database schema elements designed to implement the dataset in the database under application element control. Users verify that an application element has been automatically added, and confirm that database schema elements implementing the dataset(s) under control of the application element have been automatically created. A tutorial illustrates a workflow utilizing a designer tool to cogenerate a database application and a database without a data design step. A wizard utilizes the designer tool to cogenerate a database application and a database that collectively implement a calendar, a diagram, a tree, a wiki, and/or a list.

Abstract: A method and apparatus for generating a non-linear narrative article. After generation of a non-linear narrative article from a set of narrative rules and accompanying media elements, the narrative is optimised and the media elements are also optimised into a dictionary. A narrative tree generator determines all possible paths through the narrative to generate a narrative tree and redundant parts are removed.

Abstract: A computer-readable, non-transitory medium stores therein a search program that causes a computer having access to a data block set that includes data groups respectively registered in data blocks, and a Bloom filter row of n Bloom filters that each have m bits indicating negativity in a given number of the data blocks, to execute a process that includes receiving a transposition request for the Bloom filter row; transposing the Bloom filter row into a transposed Bloom filter row of m transposed Bloom filters respectively of n bits gathered from the Bloom filters according to arrangement position in the Bloom filters; and storing the transposed Bloom filter row to a storage device, if a transposition request has been received at the receiving.

Abstract: A set of structured data may be stored using a format file and a data file. The format file may contain a hierarchical structure in the form of classes and relationships, while the data file may store the instances of the data in a serialized form. The format file may include projection types as well as repeating or nested types. The data file may contain instances of the structured data in the form of rows, with commas or other delimiters separating the data items. The structure of the data file may be created by traversing the format file to create a fully populated list of data items representing the structured data. An application may read the format file and data file to import complex data types and populate instances of those data types.

Abstract: An embodiment of the present invention includes a method for analyzing and solving possibility tree. A possibility tree having a plurality of programmable nodes is constructed and solved with a solver module executed by a processor element. The solver module executes the programming of said nodes, and tracks the state of at least a variable through a branch. When a variable of said branch is out of tolerance with a parameter, the solver disables remaining nodes of the branch and marks the branch as an invalid solution. The valid solutions are then aggregated and displayed as valid tree solutions.

Abstract: A computer-implemented method, system, and computer program product for processing special attributes within a file are provided. The method includes accessing the file with a hierarchical tree structure of file elements, and retrieving special attributes associated with the file elements. The special attributes are selectively assigned to the file elements. The method also includes interpreting the special attributes using hierarchical inheritance to pass the special attributes from subordinate file elements to higher-level file elements. The method further includes creating a file-level representation of the interpreted special attributes.

Abstract: A method for generating a widget icon is disclosed. The method includes: obtaining a widget summary information file; parsing the widget summary information file, and executing the parsed widget summary information file; and generating a widget icon according to the executed widget summary information file. A method for generating a widget summary information file and a widget engine are also provided, thus reducing the occupancy of system resources.

Abstract: Method and apparatus for storing data in a reduced redundancy form. Binary Large Objects (BLOBs) are partitioned into subblocks according to a partitioning method, and the subblocks are stored in subblock clusters. Each BLOB is represented as a list of spans of subblocks which identifies a contiguous sequence of subblocks within a cluster. Storage redundancy can be reduced because the spans of two different BLOBs can refer to the same subblocks. An index may be used to map subblock hashes to subblock cluster numbers.

Abstract: Method and apparatus for predicting properties of a target object comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods.

Abstract: Method and apparatus for predicting properties of a target object, in particular, one of an origin and a source, comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods.

Abstract: A method for locating a stem of a target tree is disclosed. The target tree is identified from a sensing dataset. At least one slice is created from the sensing dataset. The at least one slice includes at least a portion of the target tree. A tree stem location of the target tree is determined from the at least one slice. A system for locating a stem of a target tree is also disclosed. The system has a processor configured to implement the described method. The system also has a data input coupled to the processor and configured to provide the processor with the sensing dataset. The system further has a user interface coupled to either the processor or the data input.

Abstract: A tagging application (TA) is disclosed that comprises a web interface program (WIP) and a tagging program (TP). The WIP presents the facet tree by displaying elements of the facet tree selected by the user along with a known activation method for the user to select a facet element and to assign a value to the selected facet or facet element. The user may proceed to manually tag each facet and facet element by selecting a value representing the facet element to be tagged. The user may also eliminate manual selection of many of the facets and facet elements by choosing a tagging scenario and then applying the tagging scenario. Once the user has selected a tagging scenario, and has indicated that it is to be applied to the facet element, the TP takes the selected value and applies the selected tagging scenario to populate the tagging for the user in accordance with the tagging scenario. Once the tagging has been populated, the tagging program returns the tagged facet tree to the user at the user interface.

Abstract: A computer-readable medium having a link tree creation program stored thereon and readable by a computer, the link tree creation program, when executed by the computer, causes the computer to create a link tree in relation to links pertaining to Web pages receivable via a network. The link tree creation program causes a computer to function as a link search unit that searches a link from a file of a specified Web page, a link list preparation unit that adds the searched link to a list of a link tree, which root indicating a link to the specified Web page, a tree addition determination unit that compares the searched link with the root of the link tree and determines whether creating an additional link tree rooted from the searched link, and a tree creation unit that creates an additional link tree from a determination of the tree addition determination unit.

Abstract: The present invention discloses a method for reducing a tree structure in a processing system. The method includes providing a plurality of nodes in a tree structure. The method also includes querying each of the plurality of nodes based upon a threshold value, wherein the threshold is related to relevance; when a count of a particular node matches the threshold then a next child node is queried to determine if the next child node matches the threshold, if a child node does not exist for the queried node when the node is displayed. The method further includes visiting all of the parent nodes based on the querying step until all of plurality of nodes have been queried. The method finally includes displaying the nodes that satisfy the threshold value.

Abstract: Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.

Abstract: In a method for estimating a loaded execution runtime of database query, a database query for a database is received for a loaded database. Load information for the database is received. A prediction of query runtime tree is accessed. The prediction of query runtime tree is built from historical query information regarding historical database queries previously executed on the database. The prediction of query runtime tree includes a classifier function adjusted for an historical impact of loading of the database. The database query is processed through the prediction of query runtime tree, such that a loaded execution runtime of the database query is estimated based upon information pertaining to historical database queries similar to the database query.

Abstract: A structured document search system comprises an index storage unit and a search unit. The index storage unit stores indexes caused to correspond to the nodes included in the structured documents stored in a database. The indexes include node information items about the nodes to which the indexes are caused to correspond and position information items about related nodes. The node information items include position information items about the nodes to which the indexes are caused to correspond. The search unit, when the search condition specified in the search request made by the client includes value search conditions covering the values of nodes and is a specific search condition specifying a search of a related node common to the nodes, searches the index storage unit for indexes complying with the value search conditions and acquires a position information item about a related node common to the indexes searched for.

Abstract: A computer implemented method, data processing system, and computer usable program code are provided for accessing unique hierarchical data. A tree structure for a document is analyzed. A determination is made as to whether a set of unique paths exist in the tree structure. Responsive to an existence of the set of unique paths, a unique path identifier is assigned to each of the set of unique paths to create a set of unique path identifiers and assigned unique path pairs. Then, the unique path identifier and a node address for the unique hierarchical data for each of the set of unique path identifiers and assigned unique path pairs is stored into a header in the document disk page.

Abstract: The invention comprises a method of constructing an Aho-Corasick tree characterised wherein the tree is constructed in a general depth first manner, one string at a time. Preferably during construction of said string, after each node is added, failure links or extended failure links from that node to other nodes are added and failure links to nodes in the newly inserted branch are re-updated.