Patent Application
20090125494
The present invention relates to managing information and, more specifically, efficiently managing and querying XML documents.
In recent years, database systems that allow storage and querying of eXtensible Markup Language data (“XML data”) have been developed. Though there are many evolving standards for querying XML, most of them usually include some variation of XPath. XPath is a language that describes a way to locate and process items in XML documents by using an addressing syntax based on a path through the document's logical structure or hierarchy. The portion of an XML document identified by an XPath “path expression” is the portion that resides, within the structure of the XML document, at the end of any path that matches the path expression.
A query that uses a path expression to identify one or more specific pieces of XML data is referred to herein as a path-based query. The process of determining which XML data corresponds to the path designated in a path-based query is referred to as “evaluating” the path expression.
Unfortunately, even database systems that have built-in support for storing XML data are usually not optimized for handling path-based queries, and the query performance of the databases systems leaves much to be desired. In specific cases where an XML schema definition may be available, the structure and data types used in XML instance documents may be used to optimize path-based queries. However, in cases where an XML schema definition is not available, and the documents to be searched do not conform to any schema, there are no efficient techniques for path-based querying.
Some database systems may use ad-hoc mechanisms to satisfy path-based queries that are run against documents where the schema of the documents is not known. For example, a database system may satisfy a path-based query by performing a full scan of all stored XML documents. While a full scan of all documents can be used to satisfy all path-based queries, the implementation would be very slow due to the lack of indexes.
Another way to satisfy path-based queries involves the use of text keywords. Specifically, many database systems support text indexes, and these could be used to satisfy certain path expressions. However, this technique can only satisfy a small subset of path-based queries, and in particular, cannot satisfy path-based querying.
Consequently, XML indexes that can be used to quickly evaluate a path-based query have been developed. An example of such an XML index is described in U.S. patent application Ser. No. 10/884,311, entitled “INDEX FOR ACCESSING XML DATA”, filed by Sivasankaran Chandrasekar et al., on Jul. 2, 2004, the entire contents of which is hereby incorporated by reference for all purposes as if fully set forth herein. XML indexes enable XML data to be searched without a sequential scan of all of the XML data. XML indexes are typically built using all available XML data in the database.
However, XML documents that are being stored in a database may include several paths that will never be used in a path-based query. For example, document-oriented XML data may include formatting elements that will typically not be used in path-based queries. Therefore, any XML path-based index that indexes all paths in XML documents stored in a database will needlessly include data that will not be used. As more paths are indexed, and the index grows, execution of queries that use such an index are likely to become slower.
U.S. patent application Ser. Nos. 11/059,665 and 11/401,613 describe how only those path expressions that are more likely to be the subject of a path-based query are indexed. Such indexes are referred to herein as path-subsetted indexes. A path-subsetted index thus indexes a proper (or strict) subset of the XML nodes in a document. Path-subsetted indexes are defined in at least two ways. In the case of an INCLUDE path-subsetted XML index, the subset of XML nodes to be indexed is specified using a set of one or more path expressions. All XML nodes that fall within the sub-tree rooted at any node matching one of the path expressions in the set are indexed.
An EXCLUDE path-subsetted XML index is defined in a similar fashion. An EXCLUDE path-subsetted XML index is defined by specifying a set of one or more path expressions. The index does not index any XML node that is within the sub-tree rooted at any node matching any of the path expressions in the set.
Hereinafter, path expressions that correspond to indexed nodes are referred to as “subsetted paths.”
An XML index is typically used for node identification as well as fragment extraction. Node identification is the process of identifying nodes matching a certain criteria (e.g., nodes whose corresponding path expression is equal to a subsetted path). Fragment extraction is the process of constructing document fragments. Because fragment extraction requires namespace patching, an INCLUDE path-subsetted XML index may also index all nodes in a subsetted path from the document root to any indexed XML node.
A path expression in a query may not be “satisfiable” by a path-subsetted XML index. A path expression is “satisfiable” by a path-subsetted XML index if all XML nodes that match the path expression are indexed in the path-subsetted XML index.
With a path-subsetted index, new documents that are being added to a database may be quickly and efficiently parsed such that only path expressions that match a “path subsetting” rule are added to the index. In addition, an incoming path-based query may be quickly and efficiently examined to determine whether the specified path could be satisfied by an index before attempting to evaluate the path expression using the index.
However, database systems typically normalize received path-based queries before the database server determines whether an index may be used to process the path-based queries. Under a typical normalization phase, a complex path expression is decomposed into multiple “mini” path expressions. The database system then determines whether each of the “mini” path expressions is “satisfiable” by an index. If any of the “mini” path expressions are not satisfiable by an index, then an index is not used to retrieve data that satisfies any of the “mini” path expressions.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
Techniques are provided that improve the performance of path-based queries that are not satisfiable by a path-subsetted XML index. When a query processor analyzes and path-based query and generates multiple path expressions, the query processor also maintains information about the original path expression. The query processor uses this information to determine whether the multiple path expressions are satisfiable by the path-subsetted XML index. The multiple path expressions may be modified with the information and then compared to the subsetted paths of the XML index. If each of the modified path expressions is satisfiable by the path-subsetted XML index, then the path-subsetted XML index may be used to process the path-based query.
For purposes of brevity, a path expression is referred to herein as a “path.”
Although the following description refers to a path-based query that specifies a single path, embodiments of the invention are also applicable to path-based queries that specify multiple paths.
Although not so limited, embodiments of the invention are described in the context of a path-subsetted XML index that indexes nodes that satisfy the following paths.
/PurchaseOrder/Reference
/PurchaseOrder/User
/PurchaseOrder/LineItems/LineItem/Part/@ Id
In an embodiment, a path-subsetted XML index indexes the following three sets of nodes: (1) all nodes that match any of the specified paths; (2) all descendants of any of the nodes in (1); and (3) all ancestor nodes of any nodes in (1). For example, given specified path “/PurchaseOrder/Reference”, the above path-subsetted XML index may also index all XML nodes whose paths match “/PurchaseOrder[Reference]” or “/PurchaseOrder/Reference” or are subsumed by “/PurchaseOrder/Reference//*.” Similarly, given the specified path “PurchaseOrder/User”, the above path-subsetted XML index may also index all XML nodes whose paths match “/PurchaseOrder[User]” or “/PurchaseOrder/User” or are subsumed by “/PurchaseOrder/User//*”.
To continue the example, after the above path-subsetted XML index is generated, the following path-based query is received:
Execution of this path-based query retrieves all PurchaseOrder nodes that have a Reference child whose text value is the string “REFERENCE”. In this example, the pth-based query conforms to the SQL/XML query language. The path-based query may have been submitted by a user or may have been generated from another path-based query. The other path-based query may conform to another query language, such as the XQuery query language.
In typical database systems, such as Oracle XML DB™, many queries undergo normalization processing. A purpose of normalization is to decompose “complex” paths, which cannot be evaluated by a single operator, into “simple” paths that can be individually evaluated, e.g., using an index. The results of the individual evaluations are then joined based on certain constraints, such as a comparison among order key values. An example of a simple path is one that does not include any predicates, such as “/PurchaseOrder/User”. An example of a complex path is one that includes one or more predicates, such as “/PurchaseOrder/User[@Id=123]”.
A path-based query that is not yet normalized is referred to herein as an “original query.” Each path specified in an original query is referred to herein as an “original path.” Thus, an original query may include multiple original paths.
An original query may or may not be the query that a database system receives from a client. For example, an original query may be a SQL/XML query that a database system generates from an XQuery query.
During the normalization phase, an original query, as in the example above, is transformed into an equivalent query without complex paths. The equivalent query that results from a normalization phase is referred to herein as a “normalized query.” One stage of normalization involves decomposing the original path into multiple paths. The multiple paths that are generated from the original path during a normalization phase are referred to herein as “normalized paths.” Thus, the normalized query that is generated during a normalization phase includes the normalized paths.
As an example, the example original query described above may be rewritten to the following normalized query:
Normalization of the original query transforms the XMLExists function in the original query to an EXISTS sub-query in the normalized query. The EXISTS sub-query includes three normalized paths: “/PurchaseOrder”, “/PurchaseOrder/Reference”, and “/Reference”.
After normalization, the normalized query goes through a rewrite phase where checks are performed on each normalized path in the normalized query. During a typical rewrite phase, each EXTRACT operator is analyzed and rewritten independent of other EXTRACT operators into a sub-query that accesses a XML index. However, because “/PurchaseOrder” is not satisfiable by the path-subsetted XML index (i.e., “/PurchaseOrder” is not one of the subsetted paths of the index), the corresponding EXTRACT operator is not rewritten to use the path-subsetted XML index. Based on an analysis of only the normalized query (referred to herein as “local query analysis”), the database server cannot conclude that the EXTRACT operator corresponding to “/PurchaseOrder” can use the path-subsetted XML index because not all PurchaseOrder nodes are stored in the path-subsetted XML index. Instead, only PurchaseOrder nodes that are in the path from the document root to any indexed XML node (e.g., “/PurchaseOrder/Reference” and “/PurchaseOrder[Reference]” nodes in this example) are indexed in the path-subsetted XML index.
According to an embodiment of the invention, a path-based query, from which the normalized query is derived, is analyzed to determine whether a path-subsetted XML index can be used to execute a normalized path. This type of analysis is referred to herein as “global query analysis.” With global query analysis, a database system can know that, in the normalized query above, a PurchaseOrder element in the output of the EXTRACT operator that corresponds to normalized path “/PurchaseOrder” can affect the overall query result if the PurchaseOrder element has a child element named “Reference”. All such PurchaseOrder nodes must be indexed by the path-subsetted XML index. For example, if the path-subsetted XML index includes a path table, then the path table must include an entry for a “/PurchaseOrder[Reference]” path. Therefore, with global query analysis, there is sufficient information to rewrite the EXTRACT operators in the normalized query to use the path-subsetted XML index.
In an embodiment, information from the normalization phase is maintained in order to determine whether normalized paths may be rewritten to use a path-subsetted XML index. For example, when the original path is decomposed into multiple normalized paths, the normalized paths are associated with the original path. A path tree may be generated where the root node in the path tree corresponds to the original path. The root node has multiple child nodes that each correspond to a different normalized path.
As another example, information from the normalization phase may include data that indicates that the EXTRACT operators in the normalized query originate from the same (e.g., XMLExists) operator in the original query.
With this information, the database system is able to use the path-subsetted XML index to process the EXTRACT operators (i.e., that correspond to the normalized paths) in the normalized query. Determining that operators may be processed using an index almost always leads to better execution plans relative to execution plans that do not include an index.
In an embodiment, one or more of the normalized paths (or copies of the normalized paths) are annotated with information from the original path. Given the example above, the original path is “/PurchaseOrder[Reference=‘REFERENCE’ ]” and the normalized paths are “/PurchaseOrder”, “/PurchaseOrder/Reference”, and “/Reference”. At least two of these normalized paths are annotated to generate the following annotated paths: “/PurchaseOrder[Reference]” corresponding to normalized path “/PurchaseOrder” and “/PurchaseOrder/Reference” corresponding to normalized path “/Reference”. The normalized path “/PurchaseOrder/Reference” is not required to be annotated.
Each annotated path (including any non-annotated paths) is compared against one or more subsetted paths associated with an XML index. If any of the annotated paths (or non-annotated paths) does not match any of the subsetted paths associated with an XML index, then that XML index cannot be used to process the normalized query.
At step 102, a database system receives a query that specifies a particular path. At step 104, the database system normalizes the query, which includes generating a plurality of normalized paths that are each derived from the particular path.
At step 106, the database system generates, from one or more of the normalized paths, one or more temporary paths based on the particular path. At step 108, the database system determines whether each of the temporary paths is subsumed by a path of a node that is indexed by a path-subsetted XML index. A first path is “subsumed” by a second path if the node represented by the second path includes the node represented by the first path. For example, given the above path-subsetted XML index, “/PurchaseOrder” is not subsumed by “/PurchaseOrder/Reference”; however, “/PurchaseOrder/Reference/@ id” is subsumed by “PurchaseOrder/Reference”. Also, “/PurchaseOrder[Reference]” is subsumed by “/PurchaseOrder/Reference”
If each of the temporary paths is subsumed by a path of a node that is indexed by a path-subsetted XML index, then, at step 110, the database system uses the path-subsetted XML index for each of the normalized paths.
For each subsetted path 202 and annotated path 204, a tree of nodes is generated. Tree 206A is generated from subsetted path 202A, tree 206B is generated from subsetted path 202B, and so forth. Similarly, tree 208A is generated from annotated path 204A, tree 208B is generated from annotated path 204B, and so forth.
Alternatively, a single tree may be generated from subsetted paths 202A-C. In that case, the common root node of that single tree would correspond to the PurchaseOrder element and the immediate children nodes of the root node would correspond to the Reference, User, and LineItems elements. The nodes corresponding to the LineItem, Parts, and @ Id elements would still be descendants of the node corresponding to the LineItems element.
Each tree 208 is compared, node by node, to each tree 206 until a match is achieved. If one of trees 208A-C does not match any of trees 206A-C, then the XML index corresponding to subsetted paths 202A-C cannot be used to process the normalized query corresponding to annotated paths 204A-C. In the example depicted in
Computer system 300 may be coupled via bus 302 to a display 312, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 314, including alphanumeric and other keys, is coupled to bus 302 for communicating information and command selections to processor 304. Another type of user input device is cursor control 316, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 304 and for controlling cursor movement on display 312. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
The invention is related to the use of computer system 300 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 300 in response to processor 304 executing one or more sequences of one or more instructions contained in main memory 306. Such instructions may be read into main memory 306 from another machine-readable medium, such as storage device 310. Execution of the sequences of instructions contained in main memory 306 causes processor 304 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The term “machine-readable medium” as used herein refers to any medium that participates in providing data that causes a machine to operation in a specific fashion. In an embodiment implemented using computer system 300, various machine-readable media are involved, for example, in providing instructions to processor 304 for execution. Such a medium may take many forms, including but not limited to storage media and transmission media. Storage media includes both non-volatile media and volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 310. Volatile media includes dynamic memory, such as main memory 306. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 302. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications. All such media must be tangible to enable the instructions carried by the media to be detected by a physical mechanism that reads the instructions into a machine.
Common forms of machine-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Various forms of machine-readable media may be involved in carrying one or more sequences of one or more instructions to processor 304 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 300 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 302. Bus 302 carries the data to main memory 306, from which processor 304 retrieves and executes the instructions. The instructions received by main memory 306 may optionally be stored on storage device 310 either before or after execution by processor 304.
Computer system 300 also includes a communication interface 318 coupled to bus 302. Communication interface 318 provides a two-way data communication coupling to a network link 320 that is connected to a local network 322. For example, communication interface 318 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 318 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 318 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 320 typically provides data communication through one or more networks to other data devices. For example, network link 320 may provide a connection through local network 322 to a host computer 324 or to data equipment operated by an Internet Service Provider (ISP) 326. ISP 326 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 328. Local network 322 and Internet 328 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 320 and through communication interface 318, which carry the digital data to and from computer system 300, are exemplary forms of carrier waves transporting the information.
Computer system 300 can send messages and receive data, including program code, through the network(s), network link 320 and communication interface 318. In the Internet example, a server 330 might transmit a requested code for an application program through Internet 328, ISP 326, local network 322 and communication interface 318.
The received code may be executed by processor 304 as it is received, and/or stored in storage device 310, or other non-volatile storage for later execution. In this manner, computer system 300 may obtain application code in the form of a carrier wave.
In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
This application is related to U.S. patent application Ser. No. 11/059,665, entitled “EFFICIENT QUERIBILITY AND MANAGEABILITY OF AN XML INDEX WITH PATH SUBSETTING”, filed by Ashish Thusoo et al. on Feb. 15, 2005, the entire contents of which is hereby incorporated by reference for all purposes as if fully set forth herein. This application is related to U.S. patent application Ser. No. 11/401,613, entitled “A MECHANISM FOR IMPROVING PERFORMANCE ON XML OVER XML DATA USING PATH SUBSETTING”, filed by Asha Tarachandani, et al. on Apr. 10, 2006, the entire contents of which is hereby incorporated by reference for all purposes as if fully set forth herein.
