Abstract: An embodiment for evaluating rules pertaining to an event includes providing a rule trie comprising multiple nodes, wherein match conditions must be met to trigger a given rule, and each match condition corresponds to a different node. An attribute trie is provided for a string attribute, which includes a node sequence having a value. The string attribute is extracted from the event and also has a value. The value of the extracted string attribute and the value of the node sequence are compared, by traversing a path extending along the node sequence. Responsive to determining that the values of the extracted string attribute and the node sequence are the same, notice is provided that the match condition of a particular node of the rule trie has been met by an attribute of the received event.

Abstract: A disclosed data structure of a phrase tree includes, as data of each node in the phrase tree, a data block including a first area for holding a code for a character or a character string, a second area for holding, for each character that will be used, an appearance sequential number of a second character that appears next to the character or the character string, and a third area for holding, according to the appearance sequential number, a number of appearances or a code corresponding to a character string comprising the character or the character string and the second character when the number of appearances exceeds a threshold.

Abstract: An embodiment for evaluating rules pertaining to an event includes providing a rule trie comprising multiple nodes, wherein match conditions must be met to trigger a given rule, and each match condition corresponds to a different node. An attribute trie is provided for a string attribute, which includes a node sequence having a value. The string attribute is extracted from the event and also has a value. The value of the extracted string attribute and the value of the node sequence are compared, by traversing a path extending along the node sequence. Responsive to determining that the values of the extracted string attribute and the node sequence are the same, notice is provided that the match condition of a particular node of the rule trie has been met by an attribute of the received event.

Abstract: A large-scale data processing system, a large-scale data processing method, and a non-transitory tangible machine-readable medium are provided. The large-scale data processing system comprises an interface and a processor. The interface accesses a multi-dimensional data model, wherein the multi-dimensional data model comprises a plurality of dimensions, the dimensions form a multi-dimensional space of measures, each dimension is a single space comprising a plurality of members with a common set of attributes, and each measure is a data element organized and accessible through the multi-dimensional space of the cross-product of all dimensions. The processor builds at least one Tree Object (TO), wherein the TO is derived by converting the multi-dimensional data model into an N-level tree data structure according to a level order of N attributes, each tree node in the TO meets all conditions of attributes for all ancestor nodes, and N is a positive integer.

Abstract: Systems and methods for hierarchical reference counting via sibling trees are provided. The hierarchical data structure, together with its associated operations, can efficiently maintain reference counts and significantly reduce input/output (IO) operations compared to traditional techniques. The data structure presented here is applicable to any directed acyclic graph (DAG-type) structure where reference counts are used. Various embodiments of the present invention use a data structure to maintain a “sibling pointer” (pointing to the sibling node as a way to avoid reference count updates) and a “sibling count.” When nodes in the tree diverge, the sibling pointer and sibling count are updated as opposed to directly manipulating the reference counts of the children of the diverging nodes. Various other embodiments can use additional entries or fields that allow for improved efficiency and advantages.

Abstract: A method for modeling a process includes collecting data pertaining to executed process steps from one or more activity log files. The collected data is parsed to determine a set of process steps that have been performed. An incidence value representing how many times each performed process step follows each of the other performed process steps is determined. A graph representing a model of the executed process by representing each process step that has been performed as a node of the graph and each transition between process steps within each process thread as an edge on the graph is generated. The edges connecting the pairs of nodes are assigned numbers that depend upon the incidence value corresponding to how many times the process step represented by a first node of the pair is followed by the process step represented by a second node of the pair.

Abstract: A Bell Tree data structure is provided to model the process of chaining the mentions, from one or more documents, into entities, tracking the entire process; where the data structure is used in an entity tracking process that produces multiple results ranked by a product of probability scores.

Abstract: Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation.

Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for ontology based resource provisioning and management for services. For example, such an ontology based approach can be utilized in conjunction with a business support system which may be employed in conjunction with a cloud computing environment.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In one particular example, such methods, apparatuses, devices and/or systems may be directed to transforming between labeled and unlabeled trees which are elementary equivalents.

Abstract: Embodiments of techniques and systems for parallel processing of B+ trees are described. A parallel B+ tree processing module with partitioning and redistribution may include a set of threads executing a batch of B+ tree operations on a B+ tree in parallel. The batch of operations may be partitioned amongst the threads. Next, a search may be performed to determine which leaf nodes in the B+ tree are to be affected by which operations. Then, the threads may redistribute operations between each other such that multiple threads will not operate on the same leaf node. The threads may then perform B+ tree operations on the leaf nodes of the B+ tree in parallel. Subsequent modifications to nodes in the B+ may similarly be redistributed and performed in parallel as the threads work up the tree.

Abstract: A storage system includes: a data storing means configured to store storage target data and also store address data so as to be tree-structured, the address data being based on a content and storing position of data to be referred to, and the address data referring to the storage target data or other address data; an operation log generating means configured to generate an operation log that represents a content of an operation of storing the storage target data into the data storing means and a content of an operation of storing the tree-structured address data referring to the storage target data into the data storing means; and a file system committing means configured to store the storage target data and the tree-structured address data into the data storing means based on the operation log.

Abstract: Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node.

Abstract: Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions.

Abstract: A method of implementing a tree data structure comprises creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, and maintaining only one incoming pointer for each of the nodes in the tree data structure at all times. A tree data structure in which each node in the tree data structure has a single incoming pointer, and in which the tree data structure comprises a pointer directed to a local overflow node from a node at the same hierarchical level as the local overflow node.

Abstract: A recording medium stores therein an information retrieval program that causes a computer to execute generating a Huffman tree based on an XML tag written in an XML file and an appearance frequency of character data exclusive of the XML tag; compressing the XML file using the Huffman tree; receiving a retrieval condition that includes a retrieval keyword and type information concerning the retrieval keyword; setting a decompression start flag for a compression code that is for an XML start tag related to the type information, the decompression start flag instructing commencement of decompression of a compression code string subsequent to the XML start tag; detecting, in the compressed XML file, the compression code for which the decompression start flag has been set; and decompressing, when the compression code for which the decompression start flag has been set is detected, the compression code string, using the Huffman tree.

Abstract: Systems and techniques for extracting data from unstructured documents are described. One such method involves assigning one or more labels to one or more nodes in a first object model of a first web page; comparing a second object model of a second web page to the first object model; if the first object model matches the second object model to a determined degree, extracting from the second web page data associated with nodes in the second object model that match labeled nodes in the first object model; and providing the extracted data for storage in a structured database in a manner associated with the labels.

Abstract: The apparatuses and methods described herein may operate to identify, from an index structure stored in memory, a reference minimum bounding shape that encloses at least one minimum bounding shape. Each of the at least one minimum bounding shape may correspond to a data object associated with a leaf node of the index structure. Coordinates of a point of the at least one minimum bounding shape may be associated with a set of first values to produce a relative representation of the at least one minimum bounding shape. The set of first values may be calculated relative to coordinates of a reference point of the reference minimum bounding shape such that each of the set of first values comprises a first number of significant bits fewer than a second number of significant bits representing a second value associated with a corresponding one of absolute coordinates of the point.

Abstract: Provided is a graphical user interface (GUI) to associate information with an object. Different views are maintained providing different hierarchical arrangements of a set of objects. Selection is received of one view and one object in the selected view. Information is associated with the selected object, wherein the associated information is accessible in all views in which the object with which the information is associated is accessible.

Abstract: A technique for efficiently scanning various datasets in a storage system to generate metadata for shared data blocks is provided. In one embodiment, data containers in an active file system of a storage object are first scanned. Remaining images (e.g., snapshots of the file system) are arranged in a chronological order based on the age of such images in the storage object. In some instances, to perform a metadata scan of a given image, the storage server compares each data container in the given image to a corresponding data container in a prior image (from the chronological order) to identify any non-identical data blocks (i.e., blocks that are not common between the data containers of the two images) in each data container. The metadata scanner then generates metadata only for the non-identical data blocks in each data container and skips metadata generation for any remaining data blocks.

Abstract: A computer readable storage medium includes executable instructions to retrieve a dataset from a data source, where the dataset includes a first set of categories. A data structure that represents the dataset is built. A first set of merit values for the first set of categories is calculated. The first set of categories is ordered based on a criterion. The first set of categories is returned.

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.

Abstract: Techniques implemented in methods, computer-readable media apparatus, and systems for graphically exploring an in-memory database include: identifying a selected data object; searching an in-memory database for a data element associated with a search term; and determining a relationship between the data element and the selected data object; and generating a displayable graph of the relationship as a path between the data element and the selected data object, the path comprising at least two nodes, where a first node represents the selected data object and a second node represents a node associated with the data element.

Abstract: A hierarchy differences visualization system and method for visualizing differences between two hierarchical structures based on similarity metrics. The two hierarchical structures are merged into a merged hierarchical structure and differences between the two hierarchical structures are computed and displayed in a user interface using node visualization metrics. In addition, at least one path is computed to a root of the merged hierarchical structure from a selected node and displayed in the user interface. The user interface uses various node visualization metrics including color, shapes, size, underlining, strikethrough, and text transparency. In some embodiments the hierarchical structures are tree structures and the similarity metric is structural uncertainty including location uncertainty and sub-tree structure uncertainty. The location uncertainty of a node is indicated by a color of the node label and sub-tree structure uncertainty of a node is shown by various levels of transparency of node labels.

Abstract: A method of resolving conflicts between revisions to a distributed virtual file system is implemented at a computing device that is communicatively connected to a plurality of storage devices. The virtual file system at the computing device has a first revision of the virtual file system. Upon receipt of a request to synchronize the first revision of the virtual file system with the storage devices, the computing device retrieves one or more blocks from the storage devices, which are associated with a second revision of the virtual file system. The computing device then merges a first component of the first revision with a corresponding component of the second revision if a first predefined condition is met or identifies a second component of the first revision as being conflicted with a corresponding component of the second revision if a second predefined set of conditions is met.

Abstract: A method for loading information into a tree structured database includes receiving a document and forming a top-down tree characterizing the document. Leaf nodes in the top-down tree are identified. Bottom-up indices are formed for the leaf nodes, where the bottom-up indices characterizes paths from selected leaf nodes to a root node of the top-down tree. The top-down tree and bottom-up indices are stored as separately searchable entities in the tree structured database.

Abstract: Described herein are systems and methods for modeling building resources. In overview, building resources are represented by points defined in an information system. These points are defined in a manner so as to allow the generation of a hierarchical structure on their basis. A logical representation of this hierarchical structure, or part of this hierarchical structure, is viewable by a client, for example by way of a browser application. In various embodiments, the logical representation implements functionalities including alarm aggregation and/or scope of responsibility filtering.

Abstract: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during, migration.

Abstract: In a data storage and retrieval system wherein data arranged in nodes is stored and retrieved in pages, each page comprising a cluster of nodes, a method comprising: monitoring ongoing data retrieval to find retrieval patterns of nodes which are retrieved together and to identify changes in said retrieval patterns over time; and periodically reclustering the data nodes among said pages dynamically during usage of the data to reflect said changes, so that nodes more often retrieved together are migrated to cluster together and nodes more often required separately are migrated to cluster separately, thereby to keep small an overall number of page accesses of said data storage and retrieval system during data retrieval despite dynamic changes in patterns of data retrieval.

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: A numeric structure identifier (ID) that represents a tree structure of a document that includes data is received. The numeric structure ID is calculated as a product of factors, each of a form of P raised to a power of m, where p is a prime number corresponding to a node ID of a node represented by the node ID and m is a number of children of the node represented by the node ID. A first numeric node ID that represents a first node of the tree structure of the document is received. The tree structure of the document corresponding to the numeric structure ID is identified. The data of the document is stored as the tree structure identifiable by the numeric structure ID. The first node within the tree structure corresponding to the first numeric node ID is identified. A value of the identified first node is returned.

Abstract: A method and system for providing a scalable storage scheme for native hierarchically structured data of relational tables, includes a base table with indicator columns with information pertaining to hierarchically structured data of a document, data tables for storing the hierarchically structured data corresponding to the indicator columns, and node identifier indexes corresponding to the data tables for mapping between the indicator columns and the hierarchically structured data in the data tables. In an embodiment, actual data for each hierarchically structured data (such as XML) column is stored in a separate data table, and each data table has a separate node identifier index. The node identifier index is searched with a key containing the document identifier and a logical node identifier is used, and a record identifier of a record in the data table containing the node assigned the logical node identifier is retrieved.

Abstract: A versioned file system comprises a set of structured data representations. At a first time, an interface creates and exports to a data store a first structured data representation corresponding to a first version of a local file system. The first structured data representation is an XML tree having a root element, one or more directory elements associated with the root element, and one or more file elements associated with a given directory element. Upon a change within the file system (e.g., file creation, file deletion, file modification, directory creation, directory deletion and directory modification), the interface creates and exports a second structured data representation corresponding to a second version of the file system. The second structured data representation differs from the first structured data representation up to and including the root element of the second structured data representation. The data store may comprise a cloud storage service provider.

Abstract: A mechanism for mapping data between different hierarchies within an industrial automation system facilitates the user of the different hierarchies. For example, the mechanism can include at least: locating an instance of data within a first hierarchical tree; and mapping the instance of the data within the first hierarchical tree to an instance of the data within a second hierarchical tree. The first hierarchical tree and the second hierarchical tree include instances of the same data arranged in different structural organizations. Utilizing the mechanism, when an instance of data in the first hierarchical tree is changed, a corresponding instance of the data in the second hierarchical tree can be updated according to the change.

Abstract: A method of creating a family tree includes receiving genealogy data from at least one primary source and creating one or more node records and one or more link records using the genealogy data. Individual node records may be compared to identity pairs of records having similar data. For each identified pair of individual node records, the method includes comparing related individual node records and deciding based on predetermined criteria whether the identified pair of individual node records represent the same person. The method also includes consolidating the information from a plurality of records determined to represent the same person into a single person record.

Abstract: A specific item within an item class is identified by defining sets of descriptor data from a training library. The collected descriptor data is grouped and organized into a hierarchical tree, where each leaf node is defined by relations between corresponding parts of the descriptor data. Registrable sets of descriptor data are then identified from a collection of registrable samples. The registrable sets of descriptors are sorted into the hierarchical tree. When an input sample to be identified is received, a test set of descriptor data is generated from the input sample. The test set is then sorted into the hierarchical tree. Each leaf node that receives a part of the test set provides a vote for the registered samples it contains. The registered sample with the most votes is deemed a match for the input sample.

Abstract: Techniques are described for graph partitioning, and in particular, graph bisection. A lower bound is provided that is computed in near-linear time. These bounds may be used to determine optimum solutions to real-world graphs with many vertices (e.g., more than a million for road networks, or tens of thousands for VLSI and mesh instances). A packing lower bound technique determines lower bounds in a branch-and-bound tree, reducing the number of tree nodes. Techniques are employed to assign vertices without branching on them, again reducing the size of the tree. Decomposition is provided to translate an input graph into less complex subproblems. The decomposition boosts performance and determines the optimum solution to an input by solving subproblems independently. The subproblems can be solved independently using a branch-and-bound approach to determine the optimum bisection.

Abstract: A data management system, the system including: (i) an input interface for acquiring a source document; and (ii) a processor configured to: (a) divide the source document into multiple objects in response to content of the source document; (b) analyze the multiple objects to generate multiple low level sub-trees, wherein each of the low level sub-trees includes at least one of the multiple objects; (c) generate multiple mid level sub-trees, wherein each of the mid level sub-trees includes link to at least one of the low level sub-trees; (d) generate a top level sub-tree that includes multiple section links, wherein each of the section links to one of the mid level sub-trees; (e) create metadata descriptive of at least one of the sub-trees generated, wherein the metadata includes data which is not included in the source document; and (f) generate a structured document that includes the top level sub-tree, at least some of the mid level sub-trees and at least some of the low level sub-trees, and the metadata.

Abstract: Methods, apparatuses, and computer program products are provided for an address system to identify a field and/or a row in a data structure. A method may include receiving a request to modify a field of data, wherein the field of data is identified by a received field key. A method may also include determining whether the field of data was rendered for display. A method may also include modifying the field in a tree structure in an instance in which the field of data was rendered for display, wherein the received field key is configured locate an address object that is related to the field. A method may also include modifying the field of data in a tree structure in an instance in which the field of data was not rendered for display by locating the received field key in a field key lookup map, wherein the field key lookup map is configured to locate the address object.

Abstract: A system includes reception of a request for a page location corresponding to a logical page number, determination of a difference between the logical page number and a smallest logical page number of each of a plurality of converter leaf pages descending from a parent converter inner page, determination of a smallest number 2x that is greater than the number of logical page number-to-page location mappings within each one of the plurality of converter leaf pages, right-shifting of a binary representation of the difference x positions to determine a branch index, identification of one of the plurality of converter leaf pages based on the branch index and on an indexed list of converter page identifiers within the parent converter inner page, logically ANDing of the binary representation of the difference with a binary representation of 2x?1 to determine a mapping index of the identified converter leaf page, identification of a mapping of the identified converter leaf page based on the mapping index, and deter

Abstract: The present invention provides techniques for use in audience-related measurements, including hybrid techniques which include use of panel-based audience-related measurement information and census-based audience-related measurement information. Techniques are provided in which panel-based audience-related measurement information is obtained from multiple providing entities, and census-based audience-related measurement information is obtained one or more providing entities. The obtained information is stored in a database. The stored information may be provided to the information-providing entities, and may be used in calibrating or improving the accuracy of audience-related measurements.

Abstract: Some embodiments provide a method for storing a document. The method stores a content stream representation of the document that includes an ordered stream of code representations for primitive elements of the document. Each code representation of a primitive element has an index that indicates the order in the content stream of the primitive element representation. The method stores an object representation of the document that includes a set of object nodes arranged in a tree structure. Each object node references a range of indices in the content stream.

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 computerized decision tree training system may include a distributed control processing unit configured to receive input of training data for training a decision tree. The system may further include a plurality of data batch processing units, each data batch processing unit being configured to evaluate each of a plurality of split functions of a decision tree for respective data batch of the training data, to thereby compute a partial histogram for each split function, for each datum in the data batch. The system may further include a plurality of node batch processing units configured to aggregate the associated partial histograms for each split function to form an aggregated histogram for each split function for each of a subset of frontier tree nodes and to determine a selected split function for each frontier tree node by computing the split function that produces highest information gain for the frontier tree node.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for generating a custom report using an on-demand database service. These mechanisms and methods for generating an on-demand database service custom report can enable embodiments to generate reports that reflect a relationship between at least two different objects. The ability of embodiments to provide such additional insight into database contents may lead to more efficient and effective reporting.

Abstract: Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory.

Abstract: A method for validating outsourced processing of a data stream arriving at a streaming data warehouse of a data service provider includes a proof protocol. A verifier acting on behalf of a data owner of the data stream may interact with a prover acting on behalf of the data service provider. The verifier may calculate a first root hash value of a binary tree during single-pass processing of the original data stream with limited computational effort. A second root hash value may be calculated using the proof protocol between the verifier and the prover. The prover is requested to provide certain queried values before receiving random numbers used to generate subsequent responses dependent on the provided values. The proof protocol may be used to validate the data processing performed by the data service provider.

Abstract: The methods, systems, and data structures are taught for federating disparate calendaring systems into composite calendaring systems and composite calendars. First and second calendaring systems are bridged to a composite calendaring system using a bridging communication. The composite calendaring system tracks and presents selective information within a composite calendar.

Abstract: A large-scale data processing system, a large-scale data processing method, and a non-transitory tangible machine-readable medium are provided. The large-scale data processing system comprises an interface and a processor. The interface accesses a multi-dimensional data model, wherein the multi-dimensional data model comprises a plurality of dimensions, the dimensions form a multi-dimensional space of measures, each dimension is a single space comprising a plurality of members with a common set of attributes, and each measure is a data element organized and accessible through the multi-dimensional space of the cross-product of all dimensions. The processor builds at least one Tree Object (TO), wherein the TO is derived by converting the multi-dimensional data model into an N-level tree data structure according to a level order of N attributes, each tree node in the TO meets all conditions of attributes for all ancestor nodes, and N is a positive integer.

Abstract: A method is provided for managing the number of records displayed in a tree list 120. A limit 132 can be set on concurrently displayed nodes and records on a user device 110. A recently accessed node of a tree list 120 can be selected to be displayed on the user device 110. An oldest accessed node of the tree list 120 displayed can be collapsed when the number of concurrently displayed nodes and records exceeds the limit 132. The recently accessed node of a tree list 120 can be expanded and displayed on the user device 110.