241 results about "XPath" patented technology

A method of developing a computer application by coding a markup document in an XML markup language, coding a business logic component using any programming language, compiling the business logic component into a specific executable code, converting the XML document into a specific markup language document and deploying the converted markup document and the executable code to a client machine running a specific operating system via a network connection. The XML markup document can be converted in any markup language including XUL, SVG, Xforms, XML related languages, HTML, HTML related languages, text, and combinations thereof. The business logic component can be written using any programming language including Java, JavaScript, J#, C#, C, C++, Visual Basic, ActionScript, XSL, XQuery, and XPath, among others. The computer application can run in any operating system including next generation Windows Longhorn, Windows 2000, Linux, Unix, Apple or Palm operating systems, among others.

The design, internal data representation and query model of the invention, a hierarchical distributed caching system for semi-structured documents based on LDAP technology is presented that brings both, the semi-structured data model and the LDAP data model together into a system that provides the ideal characteristics for the efficient processing of XPath queries over XML documents. Transformation algorithms and experimental results have also been shown that prove the feasibility of the invention as a distributed caching system especially tailored for semi-structured data.

A method for validating input received from an XML based form using reusable XPath validation expressions. The method can include a step of identifying a reusable XPath validation expression including at least one substitution marker. The substitution marker can be mapped to one or more values specific to an XML instance. At least one field to be validated with the reusable XPath validation expression can be designated utilizing the development tool. The development tool can automatically replace the substitution marker with the appropriate value specific to an XML instance.

Information hierarchies are efficiently stored and accessed in a relational or object-relational database system. A path signature, similar to a pathname, is stored in a database system in association with data for the node identified by the pathname. For example, a path signature identifying an element is stored in a row that holds data for the element. To retrieve data for a hierarchical query that identifies the data requested using, for example, an XPATH string, a string pattern is generated that is matched by path signatures identified by the XPATH string. Pattern matching is then used to select rows associated with matching path signatures, and data from the selected rows is used to compute the XPATH query. Furthermore, hash values representing path signatures are generated in a way that preserves the ordering of data in an information hierarchy. The hash values can be indexed to provide quick access.

A system and method for processing documents, such as XML documents, wherein the method includes the steps of: receiving a query comprising search criteria; receiving at least a portion of a document; modifying the search criteria such that constraints specifying a backward relation may be reformulated into constraints specifying a forward relation; processing the document using the modified criteria; and locating one or more nodes that satisfy the search criteria; and, emitting the selected nodes as output.

According to an aspect of the present invention, a parser provides the portion identifiers (e.g., Xpath(s) in case of XML data files) of at It some of the data elements to the applications. As a result, the applications may be relieved from the task of computing the XPath(s) for various data elements. The implementation of applications may be simplified as a result. In one embodiment, prior API (application programming interface) is extended to provide the XPath(s). In an alternative embodiment, custom API is provided to encode the applications to obtain the XPath(s).

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.

An XML matching engine and method are provided, where policy rules expressed using XPath/XQuery policies are matched to streaming XML documents. Two distinct data structures are used: a combined modified DFA data structure for storing simple XPath queries (no wildcards or descendents) and a modified AFilter structure for storing complex queries (with wildcards or/and descendents). As the matching engine receives XML tags from XML parser, matching is performed in both structures in parallel.

Information hierarchies are efficiently stored and accessed in a relational or object-relational database system. A path signature, similar to a pathname, is stored in a database system in association with data for the node identified by the pathname. For example, a path signature identifying an element is stored in a row that holds data for the element. To retrieve data for a hierarchical query that identifies the data requested using, for example, an XPATH string, a string pattern is generated that is matched by path signatures identified by the XPATH string. Pattern matching is then used to select rows associated with matching path signatures, and data from the selected rows is used to compute the XPATH query. Furthermore, hash values representing path signatures are generated in a way that preserves the ordering of data in an information hierarchy. The hash values can be indexed to provide quick access.

The invention discloses a method and a device for generating or displaying a webpage label and an information sharing system based on the webpage label. The method for generating webpage label information comprises the following steps: responding to a user to select a target webpage element on a current webpage loaded on a client Web browser as a labelled object and extracting an XPath path of the labelled object in a document object model (DOM) tree of the current webpage; based on the labelled object and contents of context webpage elements next to the front and back parts of the labelled object in the current webpage, generating a feature code CF of the labelled object; and based on the XPath path and the feature code CF of the labelled object and a label input by the user, generating the webpage label information, wherein the webpage label information is stored in a label database of a remote label server and the feature code CF of the labelled object consists of a content-based feature (CBF) of the labelled object and the CBFs of the context webpage elements of the labelled object.

Systems, methods, computer program product embodiments are provided for executing a function in a path-based query when extracting data from a markup language document for return as a relational table, the markup language document organized hierarchically into nodes. An embodiment includes receiving a path-based query including a complex row pattern and column definition, forming multiple sets of nodes based on a simplified row pattern and column definition, determining ancestor-descendent pairings for the nodes in the column definition set, and utilizing the ancestor-descendent pairings with the simplified row pattern to return a relational table satisfying the complex path-based query. An embodiment further includes extensible markup language (XML) as the markup language, and an XPath query expression as the complex path-based query.

A system and method for transcoding digital content (e.g. web content) by correctly employing one annotation for multiple digital contents. This can efficiently reduce the workloads required for the addition of annotation data during the transcoding process. A transcoding system comprises an annotation database system for storing annotation data to be used for the transcoding of contents, and a transcoder for transcoding the contents based on annotation data stored in the annotation database system. Upon receiving an inquiry from the transcoder, a correlation between elements in the contents and descriptions of the annotation data is checked to select one annotation that can be employed for transcoding the content. The correlation is specifically determined based on XPath information.

An inverse query engine that uses an instruction tree to represents the queries to be applied against input, instead of applying each query individually. Each node in the instruction tree represents executable code. Each branch of the instruction tree when executed from the root node to a terminating branch node represents the instructions to be executed to process that query against the input. The instruction tree is forward-only in that once a node in a tree is processed against an input, that executable code associated with that node is not ever processed again for that node. Accordingly, processing resources and time is conserved.

A method of defining access control. The method allows the expression of access control rules using ontology based semantics and references an ontology subset using XPath as the ontological expression. The access control rules or access criteria are defined by an access control statement and may be expressed using classification criteria and ontology classes. The access control statement comprises a structural description that is used to define an asset and a logical expression that may be used to express the classification criteria. The access control statement defines access policy for various assets.