摘要:
A method and system are provided for determining whether a given path is an indexed path of XML documents stored in a database management system. A finite state machine is built using the path subsetting rules specified by a user. The finite state machine is traversed using the given path. If any accepting states are reached during the traversal of the finite state machine, the given path is determined to matching the path subsetting rules.
摘要:
A method and system for evolving XML-schema-based data to conform to an evolved XML schema is disclosed. Based on an existing XML schema and an instance document that is based on the existing XML schema, an XML-schema-independent form of the instance document is generated. Based on a set of specified transformations and the XML-schema-independent form of the instance document, an evolved instance document is generated. The evolved instance document conforms to an evolved XML schema that incorporates changes to the existing XML schema. Techniques described herein are flexible enough to accommodate a wide variety of evolutions to XML schemas.
摘要:
An XML document can be represented in a compact binary form that maintains all of the features of XML data in a useable form. In response to a request for a modification (e.g., insert, delete or update a node) to an XML document that is stored in the compact binary form, a certain representation of the requested modification is computed for application directly to the binary form of the document. Thus, the requested modification is applied directly to the persistently stored binary form without constructing an object tree or materializing the XML document into a corresponding textual form. Taking into account the nature of the binary form in which the document is encoded, the bytes that actually require change are identified, including identifying where in the binary representation the corresponding actual changes need to be made.
摘要:
A method and system are provided for extracting a valid, self-contained fragment for a node in a XML document stored in a database management system. An XML index is used to identify a location in which XML fragment data corresponding to the node is located. Ancestors of the node are identified and examined for any information needed for the proper interpretation of the fragment. If an ancestor node contains such needed information, this information is patched into the XML fragment to ensure that the fragment is a valid, self-contained XML fragment.
摘要:
A method and system are provided for determining whether a given path is an indexed path of XML documents stored in a database management system. A finite state machine is built using the path subsetting rules specified by a user. The finite state machine is traversed using the given path. If any accepting states are reached during the traversal of the finite state machine, the given path is determined to matching the path subsetting rules.
摘要:
A method and system for evolving XML-schema-based data to conform to an evolved XML schema is disclosed. Based on an existing XML schema and an instance document that is based on the existing XML schema, an XML-schema-independent form of the instance document is generated. Based on a set of specified transformations and the XML-schema-independent form of the instance document, an evolved instance document is generated. The evolved instance document conforms to an evolved XML schema that incorporates changes to the existing XML schema. Techniques described herein are flexible enough to accommodate a wide variety of evolutions to XML schemas.
摘要:
A method and system are provided for extracting a valid, self-contained fragment for a node in a XML document stored in a database management system. An XML index is used to identify a location in which XML fragment data corresponding to the node is located. Ancestors of the node are identified and examined for any information needed for the proper interpretation of the fragment. If an ancestor node contains such needed information, this information is patched into the XML fragment to ensure that the fragment is a valid, self-contained XML fragment.
摘要:
Techniques are provided for indexing XML documents using path subsetting. According to one embodiment, a PATH table created for storing one row for each indexed node of the XML documents using user-defined criteria. The user-defined criteria are used to determine which nodes of XML documents to included in The PATH TABLE. The PATH table row for a node includes (1) information for locating the XML document that contains the node, (2) information that identifies the path of the node, and (3) information that identifies the position of the node within the hierarchical structure of the XML document that contains the node. Use of the user defined criteria is transparent to any query improves DML indexes overhead costs.
摘要:
Various techniques are provided for facilitating the management of hierarchical data within a relational database system. One such technique involves separating the storage structures used to store data that captures the information about the hierarchy (the “hierarchy structures”), from the storage structures used to store the content of the resources that belong to the hierarchy (the “content structures”). Techniques are also provided for allowing users to customize the metadata attributes associated with resources that belong to the information hierarchy. One technique involves registering XML schemas that specify the metadata attributes desired by a user. Another technique involves storing attributes that do not correspond to any declared field in a “catch-all” column within the resource table. Techniques are provided for determining how to store resources as they are added to the database. According to one technique, the database server searches the data of the resource to find content-type information. If content-type information is found, then the database server consults a content-type to content-structure mapping to determine where to store the content of the resource.
摘要:
A method and apparatus for accessing information using indexes on versioned tables is described that exploits the power of partitioned indexing to index versioned data. In partitioned indexing, an index is divided in sub-indexes, referred to as index partitions. An index may be, for example, partitioned according to a particular version identified by a version id, that is, each index partition indexes the rows in a versioned table that belong to the version identified by a particular version id. Partitioned indexes can be more efficient to use to access versioned data. The utility of partitioned indexes extends beyond indexing versioned data.