176 results about "Tree structured data" patented technology

A method (and structure) for enacting changes to a document containing a template-based program that transforms tree-structured data from a first tree-structured data into a second tree-structured data, including providing an interface to permit selection of a document containing the template-based program, constructing a model of the template-based program in the selected document by parsing elements of the template-based program into a corresponding logical construct having a match condition and at least one generator, where the match condition determines whether an element in the first tree-structure data is to be processed by one or more of the at least one generator, and displaying a representation of the model to the user.

A text-mining system and method automatically extracts useful information from a large set of tree-structured data by generating successive sets of candidate tree-structured association patterns for comparison with the tree-structured data. The number of times is counted that each of the candidate association patterns matches with a tree in the set of tree-structured data in order to determine which of the candidate association patterns frequently matches with a tree in the data set. Each successive set of candidate association patterns is generated from the frequent association patterns determined from the previous set of candidate association patterns.

A method of performing a three-way merge includes receiving first, second, and third versions of a structured document containing first, second, and third pluralities of elements respectively; deserializing the first, second, and third versions to generate first, second, and third tree-structured data models respectively representing the first, second, and third versions; generating an identifier for each node of each data model that is unique within the data model by applying identifier determination rules to a context describing the element corresponding to the node; comparing each identifier in the first data model with each identifier in the second data model to identify each node in the first data model not having matching identifiers with any node in the second data model and to link each pair of nodes having matching identifiers; and applying comparison rules to the contexts of each linked pair of nodes to identify differences therebetween.

A computerized method for three-dimensional display of tree-structured data using an intermediary restructured data set to facilitate compatibility with graphics programs, such as the Virtual Reality Modeling Language. An exemplary embodiment transformation of genealogical data illustrates an application.

The invention relates to tree structure oriented data synchronization and discloses a timestamp-based tree structure data synchronization method. The method comprises a central server cluster and a client side, the central server cluster comprises multiple servers, and each of the central server cluster and the client side is of a star topology structure. The method specifically includes the steps: registering the client side to the servers, initiating synchronization by the client side, responding to synchronization by the servers and conforming by the client side. The method has the advantages that structural features of tree structure data are considered fully, communication data in the synchronization process are decreased, synchronization efficiency is improved, and the method has high application value.

It is an object of the present invention to provide an information processor, a schema definition method and program with which it is made possible to generate a schema definition of a relational database and a XML-data schema definition all together. The main part of the present invention is an information processor comprising: an element information storage unit which stores: an element name to identify each of elements which constitute tree-structured data, parent-element identification information for use in identifying a parent element which is a parent of the element, and key information to indicate whether or not the element is a primary key to identify the parent element when the data is managed in a relational database, associating each other; a XML-data schema generation unit which generates a XML-data schema, describing a schema definition for XML to define the data structure, based on the element name and the parent-element identification information; and a RDB schema generation unit which generates a RDB schema, describing a schema definition for a relational database to define the data structure of the data, based on the element name, the parent-element identification information, and the key information.

The invention provides a processing method and system for tree structured data (STEED) and relates to the technical field of data processing. The system supports reading of text data and analyzes the text data into row or column type binary data, wherein in the analysis process, a grammar tree is dynamically generated and definitions of semi-structured data are stored; the row or column type binary data is stored, wherein the row or column type binary data is mutually converted and the binary data is directly output as JSON data in a text format; and based on the binary data, the semi-structured data is subjected to query operation.

A hardware accelerated validation parser is provided to remove a large portion if not all of the processing and overhead burden of validation parsing from a host processor by parallel access to both a state table and a data dictionary based on a token and merging and selective redirection of the respective outputs thereof; a portion of a transition control word (TCW) formed by the merged data being used to advance through the state table and a portion of the TCW being used to control formation of a tree structured data object (TSDO) corresponding to a text document in a language such as XML(TM) which supports interoperability and platform independence. A stack is provided to accommodate nesting of elements and aggregate elements. The formation of the TSDO can be and preferably is performed asynchronously and autonomously in parallel with the validation parsing.

The invention relates to a knowledge base-based fast construction method of a common correlation information query tree. The knowledge base-based fast construction method comprises the following steps of: (1) constructing a correlation information logic tree structure of a business main body by taking the business main body as a root node according to business relations among various data in target data; (2) recording datasheets to which a father node and child nodes point, as well as correlation fields among the datasheets according to the correlation information logic tree structure; (3) constructing a knowledge base of the correlation information tree structure according to information of the correlation fields among the datasheets of the tree-like structure; (4) constructing a correlation information query function according to the knowledge base of the correlation information tree structure, and realizing the common correlation information query with a loose coupling degree in a recursive manner; and (5) reconstructing the correlation information of the business main body according to the correlation information logic tree structure. The method is suitable for all one-to-one table correlation business requirements; and by adopting the method, the construction efficiency of a complex business information extraction function can be greatly improved, and the fast adaptation to the adjustment of the business requirements can be realized.

The invention discloses a method for realizing presentation of tree-structure data in World Wide Web page as well as a system and a device therefor. The method comprises the following steps: after starting a WEB system, a server accesses a database server frequently to create and/or update a required XML data file for a tree structure, so as to load and/or refresh dynamic data in the tree structure. The invention leads a user to click the upper and lower levels of the tree structure freely for data presentation without sending a request to the server at the moment, thereby greatly increasing the response speed and the exhibition efficiency of the page and further greatly improving the user experience.

The present invention relates to an image processing method, an image processing apparatus and an image processing program for dealing with inverted characters (outlined characters) constituted by white pixels on a black ground in a tree structure same as that of normal characters constituted by black pixels on a white ground.

In the present invention, black pixel blocks and white pixel blocks are sampled recursively from a binary image, tree structure data indicating a positional relation between the sampled black pixel blocks and white pixel blocks is created, an inverted image is created by white-black-inverting the insides of black pixel blocks that can include inverted characters, of black pixel blocks included in the tree structure data, white pixel blocks and black pixel blacks are sampled from the created inverted image, and data regarding the sampled white pixel blocks and black pixel blocs is added to corresponding nodes of the tree structure data.

Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

The invention discloses a method for accessing three-structured data. The method comprises the following steps of: circularly reading the corresponding relationship between each node and the parent node thereof, and constructing node objects which comprise node identifiers and parent node identifiers according to the corresponding relationship; judging whether each node object has a parent node; if the node object has the parent node, acquiring a parent node identifier from the node object, and associating the node object and the node object of the parent node according to the parent node identifier; and accessing the associated node object. In the method and the system for accessing the tree-structured data, the node objects are constructed by circularly reading; then each node is circulated again, namely the node objects are judged one by one, the node objects and the node objects of the parent nodes are associated, and the link between each parent node and each child node is established; only two cycles are required to be performed in an accessing process, so that the method is simpler; the problem of resource depletion caused by circulating for a plurality of times can be avoided thoroughly; the resource consumption is reduced effectively; and the efficiency is improved.

The apparatus for forming a document group structure data contains a base document specifying section that specifies plural documents to be positionally fixed on the tree structure as base documents based on an input from a user, an upper tree structure forming section that forms an upper tree structure data showing a hierarchical relation among the base documents based on positional information of the base documents in the directory structure, a lower tree structure forming section that forms lower tree structure data showing tree structures of document groups having the base documents as root nodes, respectively, by following links of the hypertext structure starting from the respective base documents, and a tree structure combining section that forms a tree structure data showing the hypertext structure by combining the upper tree structure data and the respective lower tree structure data.

The invention discloses a method and a device for storing and inquiring tree structure data in a relational database. The method includes storing data and a rank sequence of each node in a tree structure in a data line in the relational database. The data lines in the relational database respectively correspond to the nodes in the tree structure, A process for determining the rank sequence of each node includes determining a path from a root node to the node in the tree structure if the node is a non-root node, and composing the rank sequence of the node according to codes of various nodes in the path of the node. The method and the device have the advantages that the rank sequences of the nodes are stored in the relational database, rank sequences of various superior nodes of an optional non-root node can be acquired by means of analyzing the rank sequence of the optional non-root node, and the various rank sequences are used as inquiry conditions, so that data lines of the various superior nodes of the optional non-root node can be directly inquired in the relational database, a recursion mode for inquiring the data is omitted, and the inquiry efficiency is improved.

The invention discloses a method and a system for processing tree structure data, which solve the problem that the speed of processing and displaying the tree structure data by means of recurrent traversal is slow. The method of the invention comprises the following steps that: information which is used for identifying data hierarchy incidence relations is recorded in node data; all node data of the same tree is read; data lists are obtained after sorting of the node data according to the data hierarchy incidence relations; all the lists are scanned in sequence and outputted, wherein, the data incidence relations are expressed by combination of numeric/alphabetic characters and non-numeric/non-alphabetic characters. The invention can quickly display the tree structure data by traversing the data lists at a time, thereby not only the processing efficiency of the system is improved and the development complexity of data display is reduced but also realization is very simple.

The invention provides a tree-structure data comparison displaying method and device and solves the problem that an existing method is low in comparison rate and indirect in comparison result displaying. The tree-structure data comparison displaying method includes: acquiring to-be-compared tree-structure data which include identifications of data nodes and levels of the data nodes; acquiring corresponding data nodes, in the current level, of the to-be-compared tree-structure data and combining the data nodes with identical identifications into a same data node, so that the identifications of the combined data nodes are identical, and the level of the combined data nodes is the level of the data nodes with the identical identifications; determining to-be-displayed data nodes according to combination results and displaying information of the to-be-displayed data nodes. By the aid of the tree-structure data comparison displaying method and device, the data nodes of the to-be-compared tree-structure data can be combined for displaying, so that displaying is more direct, and comparison of the to-be-compared tree-structure structure is simpler.

A computer system, methods, and programs for creating an index for aggregating data in at least one tree structure including at least one node each including one label indicating node type and values. The system includes a node ID assignment processing unit for assigning IDs to the nodes in a post order; first, second, and third index creation processing units. The first unit creates a first index having one or more sets of data including the node ID and values included in the node; the second unit creates a second index having one or more sets of data including node ID and ID of a descendant node having the minimum ID; and the third unit creates a third index having one or more sets of data including IDs of one or more nodes having specific values.