503results about "Semi-structured data querying" patented technology

A method and system for displaying information related to a plurality of resources in a network environment. The system uses web technology to receive and store information related to back-end resources and to provide a framework by which client computer systems can manage the plurality of back-end resources in a uniform manner. In accordance with one embodiment, a method is employed in a computer system for selecting the visual arrangement of workspaces and modules in a network management console GUI. The console includes a first zone and a second zone. The method involves receiving a list of workspace names and, in response, displaying an explorer tool including the list of workspace names in the first zone. Upon indication from a user that a first workspace name from the list of workspace names has been selected, a first workspace associated with the first workspace name is displayed in the second zone.

Disclosed herein are systems and methods for syndication and management of structured and unstructured data to assist institutional healthcare delivery, healthcare providers' practices, healthcare providers' group practices, collaborative academic research and decision making in healthcare, including through the utilization of medical devices and healthcare pools.

Metadata management convergence platforms, systems, and methods to organize a community of users' data records. More specifically, methods managing metadata records related to content housed in unique, disparate or federated holdings in centralized or distributed environments. Also systems and methods for creating and managing metadata records using domain specific language, vocabulary and metadata schema accepted by a community of users of unique, disparate or federated databases in centralized or distributed environments. Such environments can include content repositories including but not limited to: vehicle fleet information systems; government document holdings; insurance and underwriting information holdings; academic library collections; and entertainment archives.

A document component management system for automatically generating customized documents for a number of individuals or entities based upon rules. Each customized document is customized for one of the individuals or entities based upon the applicable set of business rules. Users interface with the document component management system through a presentation layer. A data layer contains repositories for document components and published documents in one or more formats. An application layer interfaces the presentation layer with the data layer to create and maintain document components. User requests entered at the presentation layer are fulfilled by the application layer, which automatically retrieves document components, assembles documents in response to user requests and publishes assembled documents to the individuals. A copy of published documents are stored in the data layer.

A system retrieves structured documents based on first desired concept item having first concept items classified hierarchically and subordinated to first desired concept item, second desired concept item having second concept items classified hierarchically and subordinated to second desired concept item, generates a table displaying retrieval results, and associates groups of desired component, one of first items classified as first concept items immediately lower than first desired concept item, and desired second concept item with column index cells of table respectively. When a display area where one of the column index cells is displayed is designated, the system acquire the groups associated with the designated area, and retrieves, based on the acquired group, structured documents each including the desired component including a value in which one of the first concept items subordinated to the one of the first item and one of the second concept items are included.

A computer system and method generate a semantic representation of one or more XML language inquiries across relational and non-relational data sources. A semantic intermediate language representation explicitly describes the meaning of the one or more XML language inquiries. The semantic intermediate language may be a graph structure with nodes which describe the operations of the original query. Operators assigned to the nodes in the semantic graph allow an unambiguous definition of the original XML query. The semantic intermediate language may be used to perform XML queries over single or multiple data sources. A method includes receiving at least one inquiry, defining at least one node object for every operation within the received inquiry, translating each node object using operators, and generating a semantic representation from the operators.

Disclosed is a method of transferring data from a hierarchical file (having a hierarchical structure, e.g., a markup language file) to a relational database structure (made up of columns and rows. Before processing the actual data, the invention first partitions the hierarchical structure into sections, where each section is dedicated to at least one node of the hierarchical structure. The partitioning process is based on the document type definition file, which is separate from, and different than the hierarchical file. After completing the partitioning, the invention then parses the actual data contained in the hierarchical data file to produce a stream of data pairs and end of section indicators. During the data parsing process, the invention loads the data pairs into corresponding “sections” (created prior to the parsing process) as the data pairs are output from the parsing process. The invention also transfers the node data from these sections to the columns and rows of the relational database structure.

A query runtime architecture and an exemplary application programming interface suitable for the architecture are presented. The architecture inputs one or more XML queries and views and enables the queries to be translated wherein the queries and views may be run over multiple data sources of different data models. The architecture incorporates front-end compilers which convert input queries and views into an intermediate language representation which represents the meaning of the respective query or view. The architecture may then allow the back-end compiling of the intermediate language representation to target languages compatible with the data sources desired to be queried. The architecture also allows the execution of those target compilations to extract the data requested of the queries. The invention also discloses an example application programming interface for the query runtime system.

Type annotation record information storage for annotated automaton encoding for high-performance XML schema validation is optimized in a space efficient aspect. Subsequent to type annotation record information organization, type annotation records are used for type annotation of validated XML documents, either by implementing annotation records and type annotation part of an algorithm only, or by skipping one or more validation steps in a full validation implementation. Given a schema context, a type annotation may be performed for a validated XML fragment as opposed to an entire document. In addition, default features such as attribute and type are supported.

Provided is a stream data processing system and method for avoiding duplication of data process. The system including: an evaluation result storing unit for updating and storing a query condition evaluation result; a window evaluating unit for performing window evaluation; a data separating unit for separating data into new data and duplication input data; a reuse result extracting unit for receiving duplication input data from the data separating unit and extracting a query condition evaluation result; a query condition evaluating unit for receiving new data from the data separating unit, performing query condition evaluation and creating a query condition evaluation result; and a result organizing unit for receiving the query condition evaluation result, merging, outputting and transmitting the query condition evaluation result to the evaluation result storing unit.

A method and system for clustering of XML documents is disclosed. The method operates under specified memory-use constraints. The system implements the method and scans an XML document, assigns edge-weights according to the application workload, and maps clusters of XML nodes to disk pages, all in a single parser-controlled pass over the XML data. Application workload information is used to generate XML clustering solutions that lead to substantial reduction in page faults for the workload under consideration. Several approaches for representing workload information are disclosed. For example, the workload may list the XPath operators invoked during the application along with their invocation frequencies. The application workload can be further refined by incorporating additional features such as query importance or query compilation costs. XML access patterns could be also modeled using stochastic approaches.

A technique is provided for loading input data in one or more hierarchical format input files into a data store. Parallel processing of one or more input files is performed to output data. The data is serially loaded into the data store while enforcing the order of the data in the one or more input files. Each input file may be a physical file or a logical file.

Disclosed are system and methods for processing and storing data files, using a data edge file format. The data edge file separates information about what symbols are in a data file and information about the corresponding location of those symbols in the data file. An index for the data files can be generated according to the data edge file format. Using the data edge index, a materialized view of a result set can be generated in response to a search query for the source data objects stored in object storage.

A communications platform (Centerpost) is disclosed containing a message processing platform along with an XML message format (SmartMessage) which provides for the reception, organization, summarization, filing, storage, synthesis, routing, formatting, and intelligent processing of XML-based electronic messages and SMTP electronic mail from corporations and other senders to fully integrate individuals' existing e-mail boxes, cellular telephones, paging equipment, facsimile machines, wireless and wired telephones, and other devices. The Centerpost platform utilizes a nickname-based routing to enable device specific sending without knowledge of the specific device address. The Centerpost platform provides sender-defined information folios, which enable synthesized filing, viewing and storage of all received SmartMessages, and the platform allows semi-private access control for the user, which allows access by others. The platform also utilizes a web-based user interface, which greatly simplifies the user's viewing, control and configuration of the individual user's particular platform. The Centerpost SmartDelivery platform also allows for corporations to utilize the Centerpost functions for its customers without requiring those customers to have a Centerpost account. The platform also provides for Amateur Informants, which facilitate the use of the Centerpost system for individuals and small businesses. The platform also provides for 2-way XML messages, a Centerpost subscriber web page, an endpoint wallet, which allows subscribers to easily transfer their endpoint information, a message based endpoint configuration, which automatically sets up a new messaging device as an endpoint.

One embodiment of the present invention is a method for lexical analysis of a character stream including: (a) generating one or more parallel property bit streams in response to the character stream; (b) generating one or more lexical item streams in response to the one or more parallel property bit streams; and (c) generating one or more token streams in response to the one or more lexical item streams.

The invention discloses methods and apparatus that facilitate efficient querying of tables referencing semistructured data such as digraphs and other domains with complex grouping structure. The invention methods enable meaningful indexing of the tables as well as rewriting of queries with respect to the structures. Dynamic schema extraction using proper coloring algorithms is disclosed that structures the semistructured data in such a way that complex set operations and grouping are replaced with traditional relational joins. This enables a relational database system to harness its entire query optimizing capability when querying tables referencing semistructured data.

Improved computer technology is disclosed for enabling high performance stream processing on data such as complex, hierarchical data. In an example embodiment, a dynamic field schema specifies a dynamic field format for expressing the incoming data. An incoming data stream is then translated according to the dynamic field schema into an outgoing data stream in the dynamic field format. Stream processing, including field-specific stream processing, can then be performed on the outgoing data stream.

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 system and method are provided for XML query cursor implementation through the steps of query translation and processing, query result navigation, and positioned update. An XML query cursor implemented in Interface Definition Language (IDL) as well as an extension to XQuery, an XML query language, is described. These steps are addressed by one of three approaches: multi-cursor, outer union, or hybrid. In each approach, XML data is assumed to be stored in a relational database with a mapping that maps each element to a row in a relational database table. In each approach, a system and method provide for cursor movements and positioned updates in increments of a node, sub-tree, or entire document. Given a user's navigation patterns, a system and method is provided to select either a multi-cursor, outer union, or hybrid approach as an optimal implementation for an XML query cursor.

A method and system for classifying semi-structured documents by distinguishing sub-tree structural information as a distinct representative characteristic of a fragment of the document structure identified by a sub-tree node therein. The structural information comprises both an inner structure and an outer structure which individually can be exploited as representative data in a probabilistic classifier for classifying the sub-tree itself or the entire document. Additional representative feature data can also be independently used for classification and comprises the data content of the fragment structurally represented by the sub-tree and additionally with node attributes. The classification values independently generated from each of the different sets of features can then be combined in an assembly classifier to generate an automated classification system.

Embodiments relate to systems and methods for generating an optimized output range for a data distribution in a hierarchical database. A data store can store data in a hierarchical format, for instance, in a tree. Higher-level data, such as yearly profit, may be desired to be spread from parent nodes to lower nodes, such as nodes representing quarters. A spreading tool can insert child nodes representing quarters, months, or other at insertion point(s) represented or encoded by a set of placeholder nodes, dividing quantities appropriately. In aspects, the spreading tool can access multiple sets of spreading rules which govern the distribution of data from higher level nodes to lower level nodes. In aspects, the spreading tool can conduct multiple passes of data distribution using different sets of spreading rules, capturing the outputs expressed in the child nodes and selecting rule sets which produce a desired deviation, range, or other characteristics.

A system for providing a name space to a computer program, including a document representing a file system for services available on a computer system. The document defines a name space for the services, and is organized as a tree structure having multiple nodes, such as XML nodes. The nodes include at least one directory node representing a system directory, and at least one file node. A system area within the document defines type attributes corresponding the file nodes and the directory nodes, and which distinguish between the file nodes and the directory nodes. The system area further includes access control attributes for the file nodes in the document, and a physical file attribute corresponding to each the file nodes. The physical file attributes define locations of physical files corresponding to the file type nodes, while the access control attributes specify actions permitted using the physical files.

There is provided a data management method for managing data stored in a parallel database system in which a plurality of data servers manage data. The parallel database system manages: correspondence information between a characteristic of the data and each of the plurality of data servers that manages the data; and a data area corresponding to the characteristic of the data. The data management method comprising the steps of: extracting the characteristic of the data from data to be stored in the data area; storing the data in the data area based on the extracted characteristic of the data; specifying a corresponding data area based on the characteristic of the data stored in the data area by referring to the correspondence information; and accessing, by each of the plurality of data servers, the specified data area.

Disclosed is an XML database duplicating apparatus and method capable of providing an effective application service without interruption at a low cost in the diverse Internet environments by copying an XML document of a database system mounting an XML processing technique to another remote server. When the XML document stored in a database of the original server is copied to databases of copied servers, the structure and attribute information included in the XML document are maintained as they are, and thus the respective copied servers can support the searches based on the contents and the attribute provided by an XML query language and disperse users' queries concentrated to the original server to the respective copied servers, so that the service request for application programs can be processed.

Embodiments relate to systems and methods for conditioning the distribution of data in a hierarchical database. A data store can store data in a hierarchical format. Higher-level data, such as yearly profit, may be desired to be spread from parent nodes to lower nodes, such as quarters. Parent nodes can be associated with a set of programmatic placeholder nodes. A spreading tool can insert child nodes representing quarters, months, or other at insertion point(s) represented or encoded by a set of placeholder nodes, dividing quantities appropriately. In aspects, data can be spread from multiple parents at once. In aspects, the spreading tool can access or host sequence logic to ensure that data is spread in an order that takes dependencies, formatting, output connections, or other factors into account.

Embodiments of the present invention include storing a plurality of subtrees in a database, the plurality of subtrees representing one or more structured documents. At least one subtree has a birth timestamp indicating a time at which the at least one subtree was created. If a subtree has been obsoleted, the subtree has a death timestamp indicating a time at which the subtree was obsoleted. Embodiments further include receiving a database query comprising a query string and a query timestamp, the query timestamp indicating a historical time for which the query is to apply, and determining an intermediate result list of subtrees. The intermediate result list is filtered to generate a final result list responsive to the database query, the filtering comprising removing subtrees that do not have a birth timestamp, have a birth timestamp later than the query timestamp, or have a death timestamp earlier than the query timestamp.

A computer-implemented system and method for creating, managing, and reusing schema type definitions in SOA services, grouped in the form of libraries are disclosed. The method in an example embodiment includes: grouping a plurality of Extensible Mark-up Language (XML) schema (XSD) types, each XSD type defined in an individual XSD file; using a processor to bundle the plurality of individual XSD types into a type library, the type library including a type information file to register the individual XSD types in the type library, the type library further including a type dependencies file to register dependencies between the individual XSD types in the same or different type library; importing types from a different type library, when defining derived types or aggregated types; generating Java artifacts from the XSD types; and associating the Java artifacts with corresponding XSD types in the type information file of the type library.