86 results about "Path expression" patented technology

The invention provides a dynamic report generation method and a platform; a data set model defined by business characteristics is used to organize data, extract data model definition, bind data based on the data set model, configure the transformation rules of the report structure, and automatically generate a report instance through a report generator engine, so as to form a report generation method. Data items are organized through the derived relation and the extended relation among the data items; the property of the data items which need to be bound into a report template is designated through path expression when the data is bound. The changes possibly generated during the report structure generation are defined; the report generator engine adjusts the report structure based on the structural transformation rules; as long as new structural transformation rules are added, new data display ways can be added without recoding so as to improve the expansibility of the system. Therefore, the user can adopt different display ways based on the characteristics of different data to enhance the expression ability of the report.

An apparatus, system, and method are disclosed for efficient content indexing of streaming XML document content. A forest generator generates an XML pattern forest from a set of structured index path expressions, the XML pattern forest includes trees and twigs generated from structured index path expressions uniquely associated with a namespace indicator for an XML node. The XML node is identified in a stream of at least one XML document. A comparison module compares the XML node to nodes of trees and twigs of the XML pattern forest. A determination module determines a match between the XML node and an index node in one of a tree and a twig of the XML pattern forest. The index node has a path from an ancestor node to the index node that matches the axis steps of at least one of the structured index path expressions. A storage module stores an index entry for the XML node in response to the determined match, the index entry includes a XML document identifier, an XML node name, a namespace indicator for the XML node, and XML node content.

A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

A system and method for adaptively locating dynamic web page elements. The system includes an XPath refiner for refining an XPath path expression of the web page element based on an HTML knowledge database describing HTML tag relationships and attribute importance; and an enhanced XPath resolving engine, for searching an HTML DOM tree of the target web page for the web page element through the refined XPath path expression. The invention can locate required Web contents in dynamic web pages in spite of the variety of web contents by using an HTML knowledge database. Also provided is a computer readable article of manufacture embodying computer readable instructions for executing the above method.

The invention relates to a universal road and lane detection system and method. The method comprises: S300, interference elimination and image artifact and irrelevant image part removing are carried out on an input image to obtain a relevant image; S302, lane edge feature or road edge feature is extracted from the relevant image; S304, according to the lane edge feature or road edge feature, fitting is carried out to obtain a synthesized path expression model; S306, the path expression model is tracked to carry out time sequence consistency integration or position consistency integration; and S308, the path expression model corresponds to a global coordinate system. On the basis of the module design, pretreatment is carried out on the image inputted by the camera, the interested relevant image is selected; lane detection or road detection is carried out by combining input information of the laser radar; model fitting is carried out to estimate a road path and the accuracy of path estimation is improved by using the time sequence integration module; and then the image corresponds to the global coordinate system in real time by using a coordinate system correspondence module to improving path estimation accuracy. Therefore, a problem that the existing road estimation model has imperfect functions can be solved.

A method and system for accessing objects in a network database uses a location path expression in a database query to indicate how the desired data may be located. Relationships linking attributes of the database objects are defined as path links to allow the viewing of different types of relations among the object attributes using the same set of data, i.e., in a polyarchical manner. Location path expressions are formed based on the defined path links between the object attributes. Each location path expression includes a view name that specifies a relationship to be used to view the data, and path elements identifying a path to the desired data based on the path links provided by the relationship. A search engine is provided to parse the location path string and carry the search operation for the requested data.

Systems and methods for extension of a query language for defining a simple formulation of joins by capturing the semantics of an existing linkage between a plurality of tables, via employing a reference join. Such reference join enables a compiler to exploit existing relationships in a data base, and employ existing knowledge about referential constraints for an unambiguous transformation of the reference join expression into the equivalent INNER JOIN on the columns involved. Accordingly, a simpler query syntax and semantics can be provided to express multi-table join navigation over primary key / foreign key relations, for example.

A webpage data extracting method based on extensible language query belongs to the technical field of computer database; and the method comprises the following steps: determining the corresponding mode structure in the Web page when extracting the data contents; locating the data area, the data unit and the attribute text in the Web page; marking the semanteme of the attribute text; generating the data unit node path; calculating the path expression form of extracting the attribute value; generating the XML query sentence for extracting the data; and extracting the data by means of the XML query sentence. The method can generate precision XML query sentence for guaranteeing the correctness of the XML query sentence; the method has high generality and can be combined with the current method in seamless; and the method can adapt to more complex query result output.

A system and method for addressing a node in a tree-like data structure evaluates a relative path expression of a node from one or more marker nodes. In one aspect, a single path expression is determined from a nearby marker node. In another aspect, multiple path expression are determined and resolved to a single path expression. In yet another aspect, the method and system of the present disclosure assign unique identifiers to a subset of nodes in the tree data structure.

A method of processing a query about an Extensible Markup Language (XML) data. The XML query processing method includes the first step of representing the XML data in the form of an XML graph, the second step of creating and updating an Adaptive Path indEX (APEX) based on frequently used paths extracted from previously processed XML queries and the XML graph, and the third step of processing an XML query using the APEX. The XML query processing is capable of improving the performance of processing the query by extracting frequently used paths from path expressions having been used as queries for XML data and updating the APEX through the use of the frequently used paths.

A computer-implemented method and program product for validating updated business rules. A first set of documents utilized to validate a first set of business rules is provided. A second set of business rules generated from an update of the first set of business rules is received. Each business rule includes input parameters. A second set of documents is received. A template file includes the input parameters and corresponding path expressions. An augmented set of documents includes the first and second sets of documents. The second set of business rules is automatically semantically validated against the augmented set of documents. The semantic validation includes executing the second set of business rules with each document of the augmented set. The executing includes binding, via the path expressions, the input parameters to values included in a document of the augmented set.

A method and system for error detection in programs with collective synchronization and / or procedures are provided. In one aspect, the method and system may use interprocedural analysis for matching synchronizations in a program in order to detect synchronization errors, and, if no such errors exist, may determine the synchronization phases of the program. The method and system in one aspect may use a combination of path expressions and interprocedural program slicing to match the synchronization statements that may execute along each program path. If the synchronization matching succeeds, the method and system in one aspect may determine the sets of synchronization statements that synchronize together. A matching failure may indicate the presence of a synchronization error and the method and system in one aspect may construct a counter example to illustrate the error.

An improved type inference may be calculated for a path expression that may be classified into a series of input expressions followed by steps. For each such series, the inference may be calculated based on input including a type for the input expression, an axis for the step, and a node test for the step. The cardinality of the input expression type is preserved for the calculation of the step type. Also, a set of one or more matching node types may be identified within the type repository. These matching node types are node types within the axis of the step that match the node test of the step. These matching node types are identified without calculating the full content type implied by the axis. Avoiding the calculation of the full content type of the axis may reduce the processing time required to perform the inference.

The invention discloses a heterogeneous information model mapping-based distribution network information interaction method and system. The method comprises the following steps of: obtaining basic models of different versions of CIM / XML power grid models, and analyzing the basic models into ontology models; traversing all the model elements in the ontology models, and obtaining a plurality of optimum mapping relationships between the elements according to degrees of similarities between the elements in different ontology models; storing each pair of optimum mapping relationships in a format of an XPath path expression; traversing all the XPath path expressions, and translating all the XPath paths of a mapping relationship file into an XSLT script comprising a corresponding template rule; and obtaining a to-be-processed source XML document, analyzing a class, an attribute and an association relationship in the source XML document to serve as to-be-transformed nodes, traversing all the to-be-transformed nodes to be matched with the XSLT script, and completing the transformation of each node through an XSLT processor so as to form a target XML document. The invention aims at solving the semantic conflict problems caused by model heterogeneity in traditional interoperation tests and power enterprise information integration processes.

Embodiments extend the relational model and language of standard SQL, to recognize features of higher level entity-relationship models (ERMs). SQL extensions implemented in the data design language (DDL) incorporate Entities (and Views) having custom-defined / semantic structure, rather than being limited to primitive types (e.g. flat tables as in standard SQL). Entities are defined similar to structured types with an underlying persistency, but with a uniquely identifying leading key. In DDL, these entities are combined with associations in the data model. The associations of the extended SQL reflect relationships between entities in the ERM. Associations are specified by adding an element to a source entity, with an association type pointing to a target entity. This may be complemented by providing optional information (e.g., cardinality, keys, filter conditions), up to a complete JOIN condition. In the query language (QL), JOINs may be replaced by the use of simple path expressions.

A system and method is provided for query processing comprises: creating an index of a database and ordering a set of index candidates from the index into a list based on a set of heuristic rules. A query defining a query path is then reduced into a list of single path expressions. Each index candidate is matched against the list of single path expressions according to the ordering of the index candidates. The matched candidate nodes are also verified to insure that they satisfy the query path.

Disclosed are a method, information processing system, and computer readable medium for processing queries. The method includes receiving a data query for a set of hierarchical markup documents. At least one query path expression is extracted from the data query. The query path is processed against at least one shared hierarchical markup document in a plurality of shared hierarchical markup documents. The plurality of shared hierarchical documents is associated with the set of hierarchical markup documents. In response to the shared hierarchical markup document completely matching the query path expression, a query result for the data query is generated. The query result is based on the processing of the query path expression against at least one of the shared hierarchical markup document and the difference hierarchical markup document.

The invention relates to a web page element collection method. The method comprises the steps that a web page website which is input by a user and needs to be collected is acquired, and the web page is opened in a built-in browser; a web page element which is clicked by the user is acquired, and a function option group corresponding to the web page element which is clicked by the user is displayed; a function option which is selected by the user is determined; an Xpath path expression corresponding to the web page element is generated, and an execution step corresponding to the function optionis generated or the operation corresponding to the function option is executed. According to the web page element collection method and device, a terminal and a computer readable storage medium, theXpath path expression is adopted for positioning and selecting an operation mode in a user oriented mode, and the achievement threshold that nontechnical personnel quickly collect web page data is lowered.

This invention belongs to database technique field and provides a new type of XML path index -UD(kú¼l), which is an effective approximately index structure and its data joint sorting relies on its upper path with K length and down path with I length. This index uses upper local approximate degree and down local approximate degree information of XML data joints, so it can effective execute the path expression and especial the sub-path expression.

Novel methods for expressing paths contained in queries are provided. The path expressions are composed from tokens selected from the group consisting of object identifiers, attribute identifiers, a relationship operator, and path qualifiers. Path expressions can be more easily created than by creating the path expressions directly in SQL. The path expressions can easily be incorporated into queries for querying data structured according to an object model. Examples of such queries include queries for implementing rules for checking data corresponding to IT infrastructures to see if the IT infrastructure is compliant with policies created for the IT infrastructure.

The application discloses a method for retrieving node data in a graphic database, and the method comprises the following steps: defining a path description relation between nodes in the graphic database; getting a source node which needs to perform data retrieval and a target node related with the source node; determining a path expression of a path where the source node and the target node are located according to the path description relation; and sequentially performing the data retrieval on the source node, the target node and related nodes between the source node and the target node in the path expression. In the method for retrieving the node data in the graphic database, data information of the source node and the other nodes related with the source node can be directly got by determining the path expression of the path at which the node needing the retrieval in the graphic database is located and sequentially performing the data retrieval on all the nodes contained in the path expression.

The invention discloses a multi-fragment active clearing online re-planning algorithm which comprises the following steps of (1) building a multi-fragment directed connected path expression and formulating a set of on-orbit emergencies; (2) combining the set of the on-orbit emergencies and formulating an online re-planning model; and (3) solving a simulation model in the step (2) by adopting a very fast simulated annealing algorithm to obtain an optimal route. The online re-planning algorithm can be suitable for task optimization under various on-orbit emergencies based on multi-fragment active clearing of subsatellite and parent satellite; benefit maximization under the rated condition of on-orbit resources is achieved by adopting the maximum priority as a re-planning target; a simulated annealing algorithm is improved, the fast online re-planning method is designed, and the on-orbit corresponding requirements are achieved; basic re-planning is provided for the condition of not changing the task time, and an optimal solution for coping with the emergencies is searched; and supplementary re-planning is provided for the condition of capable of prolonging the task time, and a maximal benefit solution after the emergencies is searched.