Patent Grant
8429196
This application is related to U.S. patent application Ser. No. 11/743,563, filed May 2, 2007, entitled “TECHNIQUES FOR EFFICIENT LOADING OF BINARY-ENCODED XML DATA,” by Gupta et al, the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein.
Embodiments of the invention described herein relate generally to processing XML data, and, more specifically, to techniques for efficiently performing a streaming evaluation of an XPath expression on XML data.
The approaches described in this section could be pursued, but are not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated herein, the approaches described in this section are not prior art to the claims in this application and are not admitted to be prior art by inclusion in this section.
Database systems often store XML-formatted data within their databases. This data may come from a variety of sources, though the source is often an XML document or a database object.
In XML, data items known as elements are delimited by an opening tag and a closing tag. An element may also comprise attributes, which are specified in the opening tag of the element. Text between the tags of an element may represent any sort of data value, such as a string, date, or integer.
Text within an element may alternatively represent one or more elements. Elements represented within the text of another element are known as subelements or child elements. Elements that store subelements are known as parent elements. Since subelements are themselves elements, subelements may, in turn, be parent elements of their own subelements. Parent elements and elements with attributes are considered “complex elements” whereas elements that have neither children elements nor attributes are considered “simple elements.” Attributes, like elements, are considered nodes. Attributes are also considered to be “simple” because they never have child elements or attributes.
The resulting hierarchical structure of XML-formatted data is often discussed in terms akin to those used to discuss a family tree. For example, a subelement is said to descend from its parent element or any element from which its parent descended. A parent element is said to be an ancestor element of any subelement of itself or of one of its descendant element. Collectively, an element along with its attributes and descendants, are often referred to as a tree or a subtree.
XML Schema is a definition language that provides facilities for describing structure and constraining the contents of an XML document. A draft specification, referred to hereinafter as “XML Schema Specification”, for the XML Schema definition language is described in a set of three documents published by the W3C Consortium. The first document in the set is “XML Schema Part 0: Primer Second Edition”, W3C Recommendation 28 Oct. 2004, located at “http://www.w3.org/TR/xmlschema-0/”, the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein. The second document in the set is “XML Schema Part 1: Structures Second Edition”, W3C Recommendation 28 Oct. 2004, located at “http://www.w3.org/TR/xmlschema-1/”, the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein. The third document in the set is “XML Schema Part 2: Datatypes Second Edition”, W3C Recommendation 28 Oct. 2004, located at “http://www.w3.org/TR/xmlschema-2/”, the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein.
As referred to herein, an XML schema is a defined structure for one or more XML documents. An XML schema representation is data that describes the XML structure. An XML schema representation may include an XML document with declarations and/or a tokenized XML representation which is one for which tokens have been generated. An example of an XML schema representation includes, but is not limited to, an XML document with type definitions, element declarations, or attribute declarations.
Binary-encoded XML is one format in which XML data may be stored in a database. Binary-encoded XML is taught, for example, in “TECHNIQUES FOR EFFICIENT LOADING OF BINARY XML DATA,” incorporated above and also in U.S. patent application Ser. No. 11/182,997, filed Jul. 14, 2005, entitled “ENCODING OF HIERARCHICALLY ORGANIZED DATA FOR EFFICIENT STORAGE AND PROCESSING,” by Murthy et al, the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein. Embodiments of the invention are not limited to any particular method for encoding XML data into a binary format.
Binary-encoded XML is a compact binary representation of XML that was designed to reduce the size of XML documents. One of the ways XML data may be compressed into binary-encoded XML is by representing strings (“tokens”) with fixed values.
In one implementation of binary-encoded xml, a mapping is established between character strings and replacement values, where the character strings are tag names, and the replacement values are numbers. Such mappings are referred to herein as “translation information”.
For example, consider an XML document PO1 that contains the following content:
PO1 includes the tokens PurchaseOrder and item. To store PO1 in binary-encoded XML format, the token ‘PurchaseOrder’ may be mapped to 1, and the token ‘item’ may be mapped to 2. Typically, the replacement values consume much less space than the corresponding tokens. For example, the token ‘PurchaseOrder’, which contains fourteen characters, may be assigned a binary replacement value that takes less space to store than a single text character.
Once translation information has been created, XML documents may be stored in binary-encoded XML based on the translation information. For example, PO1 may be stored as <1><2>Important Data</2></1>. In typical implementations of binary-encoded xml, even the symbols (e.g. “<”, “>”, and “/”) may be represented by binary replacement values.
When stored in binary-encoded XML, an XML document consumes much less space than is required by other formats of XML storage. However, the space savings is achieved at the cost of additional overhead required to convert textual XML to binary-encoded XML, and to convert binary-encoded XML to textual XML. For example, to be meaningful to an application that requests PO1, ‘<1><2>Important Data</2></1>’ would have to be translated back into:
In order to reconstruct the text of an XML document that has been stored in binary format, the translation information that was used to encode the XML document must be available. The translation information that is used to store XML data within a database are typically stored separate from the binary-encoded XML data itself.
How database system stores translation information may hinge on whether the translation information is for known-schema XML or for unknown-schema XML. XML data is “known-schema” XML if the database server knows the XML schema to which the XML data conforms. The database server may “know” the schema, for example, if the schema has been registered with the database server.
On the other hand, XML data is “unknown-schema” XML if the database server does not know the schema to which the XML data conforms. Thus, unknown-schema XML includes both (a) XML documents that do not conform to any schema and (b) XML documents that conform to an XML schema, but the XML schema is not known to the database server.
In some database systems, the translation information for known-schema binary-encoded XML is stored on a per-schema basis. Thus, since all documents that conform to a given schema will typically contain the same tag strings, the same translation information is used to encode all of the documents that conform to the given schema.
In some database systems, the translation information for known-schema binary-encoded XML is stored in a database as part of the definition of the schema. Schema definitions, in turn, are stored in a schema table.
In some database systems, translation information may not be required for known-schema binary-encoded XML. In such database systems, the algorithm for translating between binary-encoded XML and non-binary-encoded XML is well known, so that any component with access to an XML schema may determine a translation based solely on the XML schema.
For example, the following XML schema, hereinafter known as POSchema1 may have been used to encode PO1 above:
Because ‘PurchaseOrder’ is the first element listed in the schema, it may have been encoded as the number 1. Likewise, since ‘item’ is the second element in the schema, it may have been encoded as the number 2. Other elements may be encoded using this same algorithm. An XML decoder may decode any document that follows this schema just by examining POSchema1 and being aware of this encoding algorithm.
In some database systems, the translation information for all unknown-schema binary-encoded XML is stored in tables referred to herein as “token tables”. In one embodiment, three token tables are used to store the translation information for unknown-schema XML: a Qname token table, a namespace token table, and a path_id token table. The three token tables are collectively referred to as a “token table set”.
The Qname token table for an XML schema contains the Qname-to-replacement-value mappings used to encode the Qnames contained in unknown-schema XML. The namespace token table for an XML schema contains the namespace-to-replacement-value mappings used to encode the namespaces contained in unknown-schema XML. The path_id token table for an XML schema contains the path_id-to-replacement-value mappings used to encode the path_ids contained in unknown-schema XML.
It is important for object-relational database systems that store XML data to be able to execute queries using XML query languages. XML Query Language (XQuery) and XML Path Language (XPath) are important standards for a query language, which can be used in conjunction with SQL to express a large variety of useful queries. XPath is described in XML Path Language (XPath), version 1.0 (W3C Recommendation 16 Nov. 1999), herein incorporated by reference and available at the time of writing at http://www.w3.org/TR/xpath, as well as in XML Path Language (XPath) 2.0 (W3C Recommendation 23 Jan. 2007), herein incorporated by reference and available at the time of writing at http://www.w3.org/TR/xpath. XQuery is described in XQuery 1.0: An XML Query Language (W3C Recommendation 23 Jan. 2007), herein incorporated by reference and available at the time of writing at http://www.w3.org/TR/xquery.
Some techniques for evaluating XML queries rely on normalizing an XML query to form a set of simple XPath expressions. The XPath expressions are then evaluated against a streamed XML data source using techniques that may be collectively referred to as streaming evaluation. Streaming evaluation techniques typically rely on an XPath evaluator built in to the database system where the XML data is stored. One streaming evaluation technique is discussed in U.S. Pat. No. 7,797,310, issued Sep. 14, 2010, entitled “Technique To Estimate The Cost Of Streaming Evaluation Of XPaths,” by Idicula et al., which is hereby incorporated by reference for all purposes as if fully disclosed herein.
It is desirable to optimize streaming evaluation techniques in order provide more efficient evaluation of XPath expressions in a database system. Increased efficiency may allow for faster streaming evaluations, less demand on computer resources during streaming evaluation, or both.
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.
Generally, a server, such as a database server, is a combination of integrated software components and an allocation of computational resources, such as memory, a node, and processes on the node for executing the integrated software components, where the combination of the software and computational resources are dedicated to providing a particular type of function on behalf of clients of the server. A database server governs and facilitates access to a particular database, processing requests by clients to access the database.
A database comprises data and metadata that is stored on a persistent memory mechanism, such as a set of hard disks. Such data and metadata may be stored in a database logically, for example, according to relational and/or object-relational database constructs. Database applications interact with a database server by submitting to the database server commands that cause the database server to perform operations on data stored in a database. A database command may be in the form of a database statement. For the database server to process the database statements, the database statements must conform to a database language supported by the database server. One non-limiting example of a database language that is supported by many database servers is SQL, including proprietary forms of SQL supported by such database servers as Oracle, (e.g. Oracle Database 11g). SQL data definition language (“DDL”) instructions are issued to a database server to create or configure database objects, such as tables, views, or complex types.
Generally, data is stored in a database in one or more data containers, each container contains records, and the data within each record is organized into one or more fields. In relational database systems, the data containers are typically referred to as tables, the records are referred to as rows, and the fields are referred to as columns. In object-oriented databases, the data containers are typically referred to as object classes, the records are referred to as objects, and the fields are referred to as attributes. Other database architectures may use other terminology. Systems that implement the present invention are not limited to any particular type of data container or database architecture. However, for the purpose of explanation, the examples and the terminology used herein shall be that typically associated with relational or object-relational databases. Thus, the terms “table”, “row”, and “column” shall be used herein to refer respectively to the data container, record, and field.
Techniques are provided for extracting scalar values from binary-encoded XML data. With reference to
At step 106, a query that specifies one or more nodes in the binary-encoded XML data is received. In response to a query, at step 108, the binary-encoded XML data is requested from one or more data sources. For each node specified in the query, node information for that node is used to determine whether that node is simple or complex (at step 110).
If the node is simple, then (at step 112) the scalar value of the node is identified and returned for further processing, according to the semantics of the query. In this way, minimal processing is required to extract the scalar value of the node. Such minimal processing at least includes decoding (or converting) the scalar value of the node into a non-binary form, such as a textual form of type string.
Alternatively, if the node is complex, then (at step 114) complex node processing is performed, which requires more processing resources than simply identifying the scalar value of the node.
To be clear, element nodes are not considered to “have” a text value. Rather, the text of an element is treated as a child node of that element. Thus, a simple element may have a child node that is a text node. On the other hand, attribute nodes are considered to “have” text values. The value of a simple element node or an attribute node is referred to herein as the “scalar value” of that node.
The following is only one example in which an embodiment of the invention may be employed. However, embodiments of the invention are not limited the following example.
A user submits the following query (Query A) against binary-encoded XML data:
The semantics of Query A are that all Description elements are selected and returned, from a purchase order table, whose corresponding ItemNumber attribute is equal to 125.
With respect to the syntax, Query A includes a reference to a purchase order table (‘purchase_order’) whose alias is ‘po’. The purchase order table stores one or more XML documents as binary-encoded XML data.
Query A also includes the function ‘xmltable’ whose alias is ‘p’. Execution of that function causes a virtual table to be constructed based on the three parameters of xmltable( ). The first parameter (‘PurchaseOrder/LineItems/LineItem’) is a path that identifies an element or a subtree in an XML document. In this example, the XML document is stored in the purchase order table.
The second parameter (passing po.object_value) specifies (via an alias in this case) the table (i.e., purchase_order) that stores binary-encoded XML data, which table is the table from which virtual table ‘p’ is constructed. The second parameter also specifies a column (object_value) of the specified table, which column is of type binary large object (BLOB).
The third parameter (columns) of xmltable( ) specifies two columns of the to-be-constructed virtual table. In other situations, the “column” parameter may identify more or less columns.
In this example, the columns of virtual table ‘p’ will include (1) an ‘id’ column of type number and (2) a ‘desc’ column of type variable character. The path that identifies the node values to be stored in the ‘id’ column is anchored at the node identified in the first parameter, which node is ‘/PurchaseOrder/LineItems/LineItem’. Thus, the path of the ‘id’ nodes is ‘/LineItem/@ItemNumber’ and the path of the ‘desc’ nodes is ‘/LineItem/Description’.
During compilation of Query A, a cost estimator may determine that an XML index cannot or should not be used to process Query A. Instead, it is determined that Query A should be executed “functionally” (i.e., without an index). Thus, the one or more XML documents that are required to answer the query are read from binary storage and may be analyzed in a streaming fashion. Thus, the entirety of the one or more XML documents are not required to be buffered before Query A is executed.
In a streaming evaluation, an XPath evaluator may be required to decode (or convert) the binary-encoded XML data from an XML input stream. The XML input stream comprises one or more XML data sources against which a set of one or more XPath expressions is to be run. Decoding may be necessary for several reasons. First, the steps in each XPath expression are typically based on non-encoded element and attribute names. To evaluate XML data against an XPath expression, the XML data might also be non-encoded. Second, the XPath evaluator usually outputs an XPath result with non-encoded XML. Therefore, the XPath evaluator may decode the binary-encoded XML data before the XML data is parsed.
Typically, the XPath evaluator decodes the XML data by means of a standard XML decoder component provided by the database system. The XML decoder component may be integrated into an XML parser, especially when the XML parser is a system-provided component used for a variety of other purposes.
After decoding, the XPath evaluator parses the XML input stream. The XPath evaluator may parse the XML input stream with, for example, an XML parser provided by the database system or an XML parser that is internal to the XPath evaluator. The XPath evaluator then evaluates the parsed XML data against the set of XPath expressions. Typically, this process involves evaluating each element, attribute, or value in the parsed XML data against a compiled representation of the set of XPath expressions. For example, the XML evaluator or an XML parser may generate XML events for each and every element or attribute it finds in the parsed XML data. The XPath evaluator may then evaluate these events, one-by-one, with the compiled XPath representation. For each event, the XML evaluator uses the compiled XPath representation to determine whether the event matches a next unmatched step (i.e. constraint) in each XPath expression. When the compiled XPath representation indicates that all steps in an XPath expression have been matched, it generates an XPath result.
A state machine, such as a non-finite automaton (NFA), is an example compiled XPath representation. The states and state transitions of the state machine may reflect each constraint in one or more XPath expressions. Based on the parsed XML data, the XPath evaluator transitions the state machine between its various states. When the state machine is in an accepting state, XPath evaluator generates an XPath result.
In the present example, the following nodes in the purchase order table are identified using a compiled XPath representation (such as an NFA): ‘/PurchaseOrder/LineItems/LineItem/@ItemNumber’ and ‘/PurchaseOrder/LineItems/LineItem/Description’. Ultimately, if there are ten (10) LineItem elements that have an ItemNumber attribute equal to 125, then execution of Query A will return ten (10) ‘Description’ elements.
According to an approach for scalar value extraction, when the compiled XPath representation indicated that all steps in ‘/PurchaseOrder/LineItems/LineItem/@ItemNumber’ have been matched, a function to extract the scalar value of the ItemNumber attribute is called. This function is referred to herein as fn:string( ). The semantics of fn:string( ) are to concatenate all text descendants of a specified XML node. The execution of fn:string( ) is relatively expensive because each text descendant is evaluated using a general purpose XPath evaluation engine. The execution of fn:string( ) typically entails significant preliminary processing, such as establishing a state machine. When many scalar values are required to be extracted from an XML input stream, this type of evaluation resulted in poor performance.
According to an embodiment of the invention, node information is identified and analyzed to determine whether a particular node is simple or complex. In an embodiment, the node information that indicates whether the particular node is simple or complex may be in the encoding of “start element” tag of the particular node. If the particular node is simple, then the fn:string( ) function is not called to extract the scalar value of the particular node. Thus, it is immediately known whether the particular node is simple or complex without having to read the entire node (e.g., up until the “end element” tag). Without this information in the encoding, the construction of an “expensive” NFA to evaluation fn:string( ) cannot be avoided. Instead, the scalar value of the particular node is immediately available as part of the binary-encoded XML data.
In many cases, the node identified by an XPath is one that has a single text child. In all such cases, a simple examination of the encoded node can be used to obtain the scalar value for that node. Therefore, the entire process of preparing for traversing text descendants using a general purpose XPath evaluation engine may be avoided.
Therefore, with respect to the present example, once an ItemNumber node is identified and it is determined (i.e., using node information associated with that node) that the node is simple, the scalar value of the ItemNumber node is decoded, if not already done so.
In an embodiment, a node is not yet decoded when the simple/complex determination is made. This is possible according to one or more of the streaming evaluation techniques disclosed in U.S. patent application Ser. No. 11/950,642, filed Dec. 5, 2007, entitled “Efficient Streaming Evaluation Of XPaths On Binary-Encoded XML Schema-Based Documents” by Idicula et al., the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein.
In some cases, the schema of an XML document is unknown. In such cases, the XML data of such XML documents are typically stored as strings. Thus, after extracting the scalar value of a node identified by an XPath, the resulting string is converted to the data type identified in the query. In the present example, if the schema of purchase order documents is not known, then each extracted scalar value associated with an ItemNumber attribute is converted to a number data type.
In other cases, the schema of an XML document is known. In such cases, the XML data of such XML documents are stored according to the data types. Thus, after extracting the scalar value of node identified by an XPath, the extracted value need not be converted. In the present example, if the schema of purchase order documents is known and the schema specifies that each ItemNumber attribute is of data type number, then each extracted scalar value associated with an ItemNumber attribute is not converted to another data type.
However, a query may specify a data type of a node (identified in the query) that is different than the data type of the node as specified in the schema corresponding to that node. In such a case, the extracted value of the node may be cast (if possible) into a value of the data type specified in the query.
Computer system 200 may be coupled via bus 202 to a display 212, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 214, including alphanumeric and other keys, is coupled to bus 202 for communicating information and command selections to processor 204. Another type of user input device is cursor control 216, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 204 and for controlling cursor movement on display 212. 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 200 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 200 in response to processor 204 executing one or more sequences of one or more instructions contained in main memory 206. Such instructions may be read into main memory 206 from another machine-readable medium, such as storage device 210. Execution of the sequences of instructions contained in main memory 206 causes processor 204 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 200, various machine-readable media are involved, for example, in providing instructions to processor 204 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 210. Volatile media includes dynamic memory, such as main memory 206. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 202. 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 204 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 200 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 202. Bus 202 carries the data to main memory 206, from which processor 204 retrieves and executes the instructions. The instructions received by main memory 206 may optionally be stored on storage device 210 either before or after execution by processor 204.
Computer system 200 also includes a communication interface 218 coupled to bus 202. Communication interface 218 provides a two-way data communication coupling to a network link 220 that is connected to a local network 222. For example, communication interface 218 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 218 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 218 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 220 typically provides data communication through one or more networks to other data devices. For example, network link 220 may provide a connection through local network 222 to a host computer 224 or to data equipment operated by an Internet Service Provider (ISP) 226. ISP 226 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 228. Local network 222 and Internet 228 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 220 and through communication interface 218, which carry the digital data to and from computer system 200, are exemplary forms of carrier waves transporting the information.
Computer system 200 can send messages and receive data, including program code, through the network(s), network link 220 and communication interface 218. In the Internet example, a server 230 might transmit a requested code for an application program through Internet 228, ISP 226, local network 222 and communication interface 218.
The received code may be executed by processor 204 as it is received, and/or stored in storage device 210, or other non-volatile storage for later execution. In this manner, computer system 200 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.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5295261 | Simonetti | Mar 1994 | A |
| 5404513 | Powers et al. | Apr 1995 | A |
| 5467471 | Bader | Nov 1995 | A |
| 5680614 | Bakuya et al. | Oct 1997 | A |
| 5724577 | Exley et al. | Mar 1998 | A |
| 5734887 | Kingberg et al. | Mar 1998 | A |
| 5878415 | Olds | Mar 1999 | A |
| 5974407 | Sacks | Oct 1999 | A |
| 5987506 | Carter et al. | Nov 1999 | A |
| 6003040 | Mital et al. | Dec 1999 | A |
| 6038563 | Bapat et al. | Mar 2000 | A |
| 6055544 | DeRose et al. | Apr 2000 | A |
| 6061684 | Glasser et al. | May 2000 | A |
| 6115705 | Larson | Sep 2000 | A |
| 6128610 | Srinivasan et al. | Oct 2000 | A |
| 6141655 | Johnson et al. | Oct 2000 | A |
| 6154741 | Feldman | Nov 2000 | A |
| 6189012 | Mital et al. | Feb 2001 | B1 |
| 6199195 | Goodwin et al. | Mar 2001 | B1 |
| 6208993 | Shadmone | Mar 2001 | B1 |
| 6236988 | Aldred | May 2001 | B1 |
| 6263332 | Nasr et al. | Jul 2001 | B1 |
| 6269380 | Terry et al. | Jul 2001 | B1 |
| 6279006 | Shigemi et al. | Aug 2001 | B1 |
| 6279007 | Uppala | Aug 2001 | B1 |
| 6298349 | Toyoshima et al. | Oct 2001 | B1 |
| 6330573 | Salisbury et al. | Dec 2001 | B1 |
| 6343287 | Kumar et al. | Jan 2002 | B1 |
| 6356920 | Vandersluis | Mar 2002 | B1 |
| 6360302 | Baylor | Mar 2002 | B1 |
| 6366934 | Cheng et al. | Apr 2002 | B1 |
| 6370537 | Gilbert et al. | Apr 2002 | B1 |
| 6414610 | Smith | Jul 2002 | B1 |
| 6427123 | Sedlar | Jul 2002 | B1 |
| 6470344 | Kothuri et al. | Oct 2002 | B1 |
| 6487546 | Witkowski | Nov 2002 | B1 |
| 6496842 | Lyness | Dec 2002 | B1 |
| 6510434 | Anderson et al. | Jan 2003 | B1 |
| 6519597 | Cheng et al. | Feb 2003 | B1 |
| 6539398 | Hannan et al. | Mar 2003 | B1 |
| 6542911 | Chakraborty et al. | Apr 2003 | B2 |
| 6571231 | Sedlar | May 2003 | B2 |
| 6604100 | Fernandez et al. | Aug 2003 | B1 |
| 6609121 | Ambrosini et al. | Aug 2003 | B1 |
| 6635088 | Hind et al. | Oct 2003 | B1 |
| 6636845 | Chau et al. | Oct 2003 | B2 |
| 6643633 | Chau et al. | Nov 2003 | B2 |
| 6654761 | Tenev et al. | Nov 2003 | B2 |
| 6662342 | Marcy | Dec 2003 | B1 |
| 6684227 | Duxbury | Jan 2004 | B2 |
| 6697805 | Choquier et al. | Feb 2004 | B1 |
| 6704739 | Craft et al. | Mar 2004 | B2 |
| 6704747 | Fong | Mar 2004 | B1 |
| 6708186 | Claborn et al. | Mar 2004 | B1 |
| 6718322 | Brye | Apr 2004 | B1 |
| 6721723 | Gibson et al. | Apr 2004 | B1 |
| 6725212 | Couch et al. | Apr 2004 | B2 |
| 6754661 | Hallin et al. | Jun 2004 | B1 |
| 6772350 | Belani et al. | Aug 2004 | B1 |
| 6785673 | Fernandez et al. | Aug 2004 | B1 |
| 6801224 | Lewallen | Oct 2004 | B1 |
| 6826727 | Mohr et al. | Nov 2004 | B1 |
| 6836778 | Manikutty et al. | Dec 2004 | B2 |
| 6836857 | Ten-Hove et al. | Dec 2004 | B2 |
| 6883137 | Girardot et al. | Apr 2005 | B1 |
| 6915304 | Krupa | Jul 2005 | B2 |
| 6915307 | Mattis et al. | Jul 2005 | B1 |
| 6920457 | Pressmar | Jul 2005 | B2 |
| 6957237 | Traversat et al. | Oct 2005 | B1 |
| 6964025 | Angiulo et al. | Nov 2005 | B2 |
| 7013425 | Kataoka | Mar 2006 | B2 |
| 7031956 | Lee et al. | Apr 2006 | B1 |
| 7043488 | Bauer et al. | May 2006 | B1 |
| 7080094 | Dapp et al. | Jul 2006 | B2 |
| 7089239 | Baer et al. | Aug 2006 | B1 |
| 7089567 | Girardot et al. | Aug 2006 | B2 |
| 7113942 | Levanoni et al. | Sep 2006 | B2 |
| 7134072 | Lovett et al. | Nov 2006 | B1 |
| 7139746 | Shin et al. | Nov 2006 | B2 |
| 7143397 | Imaura | Nov 2006 | B2 |
| 7162485 | Gottlob et al. | Jan 2007 | B2 |
| 7171404 | Lindblad et al. | Jan 2007 | B2 |
| 7171407 | Barton et al. | Jan 2007 | B2 |
| 7174354 | Andreasson | Feb 2007 | B2 |
| 7216127 | Auerbach | May 2007 | B2 |
| 7406522 | Riddle | Jul 2008 | B2 |
| 7451128 | Song et al. | Nov 2008 | B2 |
| 7457910 | Chang et al. | Nov 2008 | B2 |
| 7523119 | Imamura et al. | Apr 2009 | B2 |
| 7523199 | Tsuyama et al. | Apr 2009 | B2 |
| 20010049818 | Banerjia et al. | Dec 2001 | A1 |
| 20020056025 | Qiu et al. | May 2002 | A1 |
| 20020073019 | Deaton | Jun 2002 | A1 |
| 20020078068 | Krishnaprasad et al. | Jun 2002 | A1 |
| 20020087596 | Lewontin | Jul 2002 | A1 |
| 20020116371 | Dodds et al. | Aug 2002 | A1 |
| 20020116457 | Eshleman et al. | Aug 2002 | A1 |
| 20020133484 | Chau et al. | Sep 2002 | A1 |
| 20020143512 | Shamoto et al. | Oct 2002 | A1 |
| 20020156811 | Krupa | Oct 2002 | A1 |
| 20020184188 | Mandyam et al. | Dec 2002 | A1 |
| 20020184401 | Kadel, Jr. et al. | Dec 2002 | A1 |
| 20030004937 | Salmenkaita et al. | Jan 2003 | A1 |
| 20030009361 | Hancock et al. | Jan 2003 | A1 |
| 20030033287 | Shanahan et al. | Feb 2003 | A1 |
| 20030065659 | Agarwal et al. | Apr 2003 | A1 |
| 20030069881 | Huttunen | Apr 2003 | A1 |
| 20030078906 | Ten-Hove et al. | Apr 2003 | A1 |
| 20030093672 | Cichowlas | May 2003 | A1 |
| 20030101194 | Rys et al. | May 2003 | A1 |
| 20030115421 | McHenry et al. | Jun 2003 | A1 |
| 20030140308 | Murthy et al. | Jul 2003 | A1 |
| 20030172135 | Bobick et al. | Sep 2003 | A1 |
| 20030182624 | Large | Sep 2003 | A1 |
| 20030212662 | Shin et al. | Nov 2003 | A1 |
| 20030236903 | Piotrowski | Dec 2003 | A1 |
| 20040043758 | Sorvari et al. | Mar 2004 | A1 |
| 20040044659 | Judd et al. | Mar 2004 | A1 |
| 20040064466 | Manikutty et al. | Apr 2004 | A1 |
| 20040066529 | Wu et al. | Apr 2004 | A1 |
| 20040088320 | Perry | May 2004 | A1 |
| 20040088415 | Chandrasekar et al. | May 2004 | A1 |
| 20040132465 | Mattila et al. | Jul 2004 | A1 |
| 20040148278 | Milo et al. | Jul 2004 | A1 |
| 20040176958 | Salmenkaita et al. | Sep 2004 | A1 |
| 20040220912 | Manikutty et al. | Nov 2004 | A1 |
| 20040225680 | Cameron et al. | Nov 2004 | A1 |
| 20040230667 | Wookey | Nov 2004 | A1 |
| 20040260691 | Desai et al. | Dec 2004 | A1 |
| 20040261019 | Imamura et al. | Dec 2004 | A1 |
| 20040267760 | Brundage et al. | Dec 2004 | A1 |
| 20040268244 | Levanoni et al. | Dec 2004 | A1 |
| 20050050016 | Stanoi et al. | Mar 2005 | A1 |
| 20050050058 | Jain et al. | Mar 2005 | A1 |
| 20050050092 | Jain et al. | Mar 2005 | A1 |
| 20050091588 | Ramarao et al. | Apr 2005 | A1 |
| 20050097084 | Balmin et al. | May 2005 | A1 |
| 20050102256 | Bordawekar et al. | May 2005 | A1 |
| 20050203957 | Wang et al. | Sep 2005 | A1 |
| 20050228818 | Murthy et al. | Oct 2005 | A1 |
| 20050228828 | Chandrasekar et al. | Oct 2005 | A1 |
| 20050278616 | Eller | Dec 2005 | A1 |
| 20050289125 | Liu et al. | Dec 2005 | A1 |
| 20060005122 | Lemoine | Jan 2006 | A1 |
| 20060021246 | Schulze et al. | Feb 2006 | A1 |
| 20060047646 | Maluf et al. | Mar 2006 | A1 |
| 20060047717 | Pereira | Mar 2006 | A1 |
| 20060059165 | Bosloy et al. | Mar 2006 | A1 |
| 20060129524 | Levanoni et al. | Jun 2006 | A1 |
| 20060129584 | Hoang et al. | Jun 2006 | A1 |
| 20060136761 | Frasier et al. | Jun 2006 | A1 |
| 20060200439 | Bhatia et al. | Sep 2006 | A1 |
| 20060212467 | Murthy et al. | Sep 2006 | A1 |
| 20060236224 | Kuznetsov et al. | Oct 2006 | A1 |
| 20060277289 | Bayliss et al. | Dec 2006 | A1 |
| 20070005624 | Wu et al. | Jan 2007 | A1 |
| 20070043751 | Chen et al. | Feb 2007 | A1 |
| 20070050704 | Liu | Mar 2007 | A1 |
| 20070113221 | Liu et al. | May 2007 | A1 |
| 20070150432 | Chandrasekar et al. | Jun 2007 | A1 |
| 20070198467 | Wiser et al. | Aug 2007 | A1 |
| 20080082484 | Averbuch et al. | Apr 2008 | A1 |
| 20080091623 | Idicula et al. | Apr 2008 | A1 |
| 20080098001 | Gupta et al. | Apr 2008 | A1 |
| 20080120351 | Khaladkar et al. | May 2008 | A1 |
| 20080120608 | Shetty et al. | May 2008 | A1 |
| 20090112890 | Medi et al. | Apr 2009 | A1 |
| 20090125495 | Zhang et al. | May 2009 | A1 |
| 20090125693 | Idicula et al. | May 2009 | A1 |
| 20090150412 | Idicula et al. | Jun 2009 | A1 |
| 20090216715 | Dexter | Aug 2009 | A1 |
| Number | Date | Country |
|---|---|---|
| 1 241589 | Sep 2002 | EP |
| 61-251944 | Nov 1986 | JP |
| 62-245352 | Oct 1987 | JP |
| 04-004438 | Jan 1992 | JP |
| WO 0049533 | Aug 2000 | WO |
| WO 0142881 | Jun 2001 | WO |
| WO 0159602 | Aug 2001 | WO |
| WO 0161566 | Aug 2001 | WO |
| WO 03107576 | Dec 2003 | WO |
| WO 2006026534 | Mar 2006 | WO |
| Entry |
|---|
| U.S. Appl. No. 11/317,101, filed Dec. 22, 2005, Office Action, Jul. 7, 2010. |
| U.S. Appl. No. 11/743,563, filed May 2, 2007, Office Action, Jun. 28, 2010. |
| Tomoharu, Asami, “Development of Database System by XML, Relaxer, and JDBC”, partial English translation, XML Press, Gijutsu-Hyohron Co., Jul. 10, 2001, vol. 3, 2 pages. |
| Makoto, Onizuka, “XML and Database”, partial English translation, XML Magazine, Shoeisha Co., Ltd., Jul. 1, 2000, vol. 10, No. 3, 1 page. |
| Hironobu, Koyaku, “What is brought to SQL Server 2000 by XML?”, partial English translation, Enterprise Servers, IDG Japan, Dec. 1, 2000, vol. 3, No. 12, 1 page. |
| Bayardo et al., “An Evaluation of Binary XML Encoding Optimizations for Fast Stream Based XML Processing” WWW2004 10 pages. |
| Chakraborty, Krishnendu, “The XML Garbage Collector”, The Source for Developers, Sun Developer Network Site XP-002297849, Mar. 2002. |
| Chen, Ruey-Shun et al., “Developing an XML framework for metadata system”, Trinity College Dublin, Proc. of the 1st Inter. Sympo. on Information and Communication, pp. 267-272. |
| Cheng, Josephine et al., “IBM DB2 XML Extender,” IEEE, ICDE '00 Conference, San Diego, Feb. 2000, 128 pages. “EE XML/Binary CFI File Handling Library User Manual” downloaded from the Internet. |
| “EE XML/Binary CFI File Handling Library User Manual” downloaded from the Internet <http://www.smos.esa.int/BinaryXML/SO-UM-DME-LIPP-0005-BINXML-FH-SUM-E2-RO.pdf > 49 pages. |
| Liefke et al., “Xmill: an efficient compressor for XML data”, May 2000, ACM SIGMOD Record, Proceedings of the 2000 ACM SIGMOD international conference on Management of data SIGMOD 00', vol. 29 Issue 2, Publisher: ACM Press, 12 pages. |
| Liu et al., “XML retrieval: Configurable indexing and ranking for XML information retrieval”, Jul. 2004, Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval SIGIR 04', Pulished by ACM press, 12 pages. |
| Lo et al., “XAS: A System for Accessing Componentized, Virtual XML Documents,” IEEE, 2001, pp. 493-502. |
| Manolescu, Dragos, Review of “Metadata solutions: using metamodels, repositories, XML, and enterprise portals to generate information on demand by Adrienne Tannenbaum”, Mar. 2003, ACM Press, vol. 28, Issue 2, p. 38. |
| Martin et al., “WAP Binary XML Content Format” downloaded from the Internet Aug. 6, 2007< http://www.w3.org/TR/wbxml/ > 15 pages. |
| Min et al., “XML Indexing and compression: XPRESS: a queriable compression for XML data”, Jun. 2003, Proceedings of the 2003 ACM SIGMOD international conference on Management of data SIGMOD 03', Published by ACM Press, 8 pages. |
| Myllymaki, Jussi, “Effective Wed data Extraction with Standard XML Technologies,” WWW10, May 1-5, 2001, pp. 689-696. |
| Noser, Hansrudi, et al., “Dynamic 3D Visualization of Database-Defined Tree Structures on the WWW by Using Rewriting Systems,” 2000, IEEE, XP-002262516, pp. 247-254. |
| Oracle XML DB Developer's Guide 11gR1, Oct. 2007, http://download.oracle.com/docs/cd/B28359—01/appdev.111/b28369.pdf. |
| Peng, Feng et al., “XPath queries on streaming data” (2003) ACM Press, pp. 431-442. |
| Schmidt et al., “Why and How to Benchmark XML Databases,” SIGMOND Record, vol. 3, No. 3, Sep. 2001, pp. 27-32. |
| Vion-Dury, Jean-Yves, “XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns” (2003) ACM Press, pp. 19-25. |
| Vorthmann, S. et al. “Beyond Schemas, Schema Adjuncts and the Outside World,” Markup Languages, Online!, vol. 2, No. 3, Jun. 2000, pp. 1-8. |
| Yoshikawa, Masatoshi et al., “XRel: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases”, XP-001143686, ACM Transactions on Internet Technology (2001), pp. 110-141. |
| “Zapthink” downloaded from the Internet Aug. 6, 2007< http://www.zapthink.com/report.html?id=ZAPFLASH-11162004 > 3 pages. |
| Zisman et al., “Using XML to Build Consistency Rules for Distributed Specifications,” Proceedings of the Tenth International Workshop on Software Specification and Design (IWSD'00), IEEE 2000, 8 pages. |
| Zou et al., “XML Processing: Ctree: a compact tree for indexing XML data” Nov. 2004, Proceedings of the 6th annual international workshop on Web information and data management WIDM 04', Published by ACM Press, 10 pages. |
| Zhang, et al., “TDX: A High Performance Table-driven XML Parser”, In proceedings of the 44th annual (ACM) Southeast Regional Conference, Mar. 2006, ACM, 6 pages. |
| Balmin et al., “Incremental Validation of XML Documents”, ACM Trans. Database System 24, Dec. 2004, 42 pages. |
| Bruce, C.S. 2003. “CubeWerx Position Paper for Binary Interchange of XML”. In Proceedings of W3C Workshop on Binary Interchange of XML Information Item Sets (The Santa Clara, The USA, Sep. 24-26, 2003) 10 pages. |
| Peer to Patent, Third Party submission for PGPUB 20090125495, “optimized streaming evaluation of xml queries”, Sep. 1, 2009. |
| Xiaogana Li, Agrawal, “Efficient Evaluation of XQuery over Streaming Data”, 2005, 31st VLDB Conference, pp. 265-276. |
| IBM Research, “XAOS: An Algorithm for Streaming XPath Processing with Forward and Backward Axes” 2003, pp. 1-2. |
| “Binary XML Library” downloaded from the Internet Aug. 6, 2007, <http://www.smos.esa.int/BinaryXML/ > 2 pages. |
| U.S. Appl. No. 11/743,563, filed May 2, 2007, Notice of Allowance, Apr. 19, 2011. |
| U.S. Appl. No. 11/938,020, filed Nov. 9 ,2007, Interview Summary, mailed Nov. 2, 2012. |
| Number | Date | Country | |
|---|---|---|---|
| 20090307239 A1 | Dec 2009 | US |
