Provided are techniques for pipeline optimization based on polymorphic schema knowledge. A hierarchical document to be processed by a pipeline of transformations is received. It is determined whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the input schema is a polymorphic schema. In response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, data items corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event. The collected items are passed to the next downstream transformation as the single compressed event.
|
1. A computer-implemented method, comprising:
receiving, with a processor of a computer, a hierarchical document to be processed by a pipeline of transformations;
determining whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the associated input schema is a polymorphic schema that includes a wildcard schema node;
in response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, collecting data items corresponding to each schema node that the next downstream transformation is not accessing into a single compressed event, wherein the collected data items of the single compressed event correspond to content of the wildcard schema node;
passing the collected data items to the next downstream transformation as the single compressed event, wherein the downstream transformation does not access the content of the single compressed event; and
transforming polymorphic schemas that use inheritance relationships between a parent schema node and corresponding child schema nodes to polymorphic schemas without inheritance relationships using wildcard schema nodes by:
adding a wildcard schema node that provides a match for additional sub-elements and attributes of child schema nodes to the parent schema node; and
removing the inheritance relationship.
5. A computer program product comprising a computer readable device including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:
receive a hierarchical document to be processed by a pipeline of transformations;
determine whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the associated input schema is a polymorphic schema that includes a wildcard schema node;
in response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, collect data items corresponding to each schema node that the next downstream transformation is not accessing into a single compressed event, wherein the collected data items of the single compressed event correspond to content of the wildcard schema node;
pass the collected data items to the next downstream transformation as the single compressed event, wherein the downstream transformation does not access the content of the single compressed event; and
transform polymorphic schemas that use inheritance relationships between a parent schema node and corresponding child schema nodes to polymorphic schemas without inheritance relationships using wildcard schema nodes by:
adding a wildcard schema node that provides a match for additional sub-elements and attributes of child schema nodes to the parent schema node; and
removing the inheritance relationship.
9. A system, comprising:
a processor; and
storage coupled to the processor, wherein the storage stores a computer program, and wherein the processor is configured to execute the computer program to perform operations, wherein the operations comprise:
receiving a hierarchical document to be processed by a pipeline of transformations;
determining whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the associated input schema is a polymorphic schema that includes a wildcard schema node;
in response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, collecting data items corresponding to each schema node that the next downstream transformation is not accessing into a single compressed event, wherein the collected data items of the single compressed event correspond to content of the wildcard schema node;
passing the collected data items to the next downstream transformation as the single compressed event, wherein the downstream transformation does not access the content of the single compressed event; and
transforming polymorphic schemas that use inheritance relationships between a parent schema node and corresponding child schema nodes to polymorphic schemas without inheritance relationships using wildcard schema nodes by:
adding a wildcard schema node that provides a match for additional sub-elements and attributes of child schema nodes to the parent schema node; and
removing the inheritance relationship.
2. The method of
3. The method of
4. The method of
determining that the single compressed event includes collected data items corresponds to a non-wildcard schema node in the next downstream transformation;
turning the collected data items in the single compressed event into multiple, individual events; and
passing the multiple, individual events to the next downstream transformation.
6. The computer program product of
7. The computer program product of
8. The computer program product of
determine that the single compressed event includes collected data items corresponds to a non-wildcard schema node in the next downstream transformation;
turn the collected data items in the single compressed event into multiple, individual events; and
pass the multiple, individual events to the next downstream transformation.
10. The system of
11. The system of
12. The system of
determining that the single compressed event includes collected data items corresponds to a non-wildcard schema node in the next downstream transformation;
turning the collected data items in the single compressed event into multiple, individual events; and
passing the multiple, individual events to the next downstream transformation.
|
|||||||||||||||||||||||||||
1. Field
Embodiments of the invention relate to pipeline optimization based on polymorphic schema knowledge.
2. Description of the Related Art
An Extensible Markup Language (XML) Pipeline is formed when XML processes, sometimes called XML transformations or processing components, are connected together. For instance, given two transformations T1 and T2, the two transformations may be connected together so that an input XML document is transformed by T1 and then the output of T1 is fed as input document to T2 (See wikipedia.org on the World Wide Web). Each of the XML transformations works on some portion of an XML document.
XML processing is conveniently expressed by use of XML Pipelines, where each transformation is simple and focuses on a small part of the overall document being transformed. However, the over-all transformation carried out by the whole pipeline may be quite complex.
When processing XML data in pipelines like this, if the transformations are individually simple, then naïve implementations may spend far more time carrying around (e.g., transferring between transformations), parsing, and serializing the parts of the XML documents that they are not transforming, than on performing the transformations on the parts of the XML documents they care about.
Polymorphic schemas may be described as schemas with wildcard schema nodes. Polymorphic schema interfaces are used in programming languages (Luca Cardelli, Peter Wegner, On Understanding Types, Data Abstraction, and Polymorphism, from Computing Surveys, (December, 1985)). The IBM® WebSphere® DataStage® engine uses polymorphic transformation operators on relational data, where wildcard schema nodes are used to match up a list of columns that are just being passed to the output (IBM, WebSphere, and DataStage are trademarks of International Business Machines Corporation in the United States, other countries, or both).
Extensible Stylesheet Transformations (XSLT) version 2.0 allows schemas to be associated with a stylesheet (w3.org/TR/xslt20 on the World Wide Web).
However, there is still a need in the art for pipeline optimization based on polymorphic schema knowledge.
Provided are a method, computer program product, and system for pipeline optimization based on polymorphic schema knowledge. A hierarchical document to be processed by a pipeline of transformations is received. It is determined whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the input schema is a polymorphic schema. In response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, data items corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event. The collected items are passed to the next downstream transformation as the single compressed event.
Referring now to the drawings in which like reference numbers represent corresponding parts throughout:
In the following description, reference is made to the accompanying drawings which form a part hereof and which illustrate several embodiments of the invention. It is understood that other embodiments may be utilized and structural and operational changes may be made without departing from the scope of the invention.
The computing device 100 also includes one or more input and output schemas 150 and one or more hierarchical documents 160 (e.g., XML documents). Polymorphic schemas 152 may be described as a subset of the input and output schemas 150. Polymorphic schemas 150 may be described as schemas (i.e., input or output) with wildcard schema nodes. An input schema 150 is a schema that is provided as input to a transformation 120a . . . 120n, and an output schema 150 is a schema that is provided as output from a transformation 120a . . . 120n. A schema may be described as a tree of schema nodes. A concrete schema describes a hierarchical document in which each schema node has an associated type. A polymorphic schema is a generalization of a set of other more concrete schemas. Each schema node in the polymorphic schema is associated with a type that is the generalization of the matching schema nodes types in the concrete schemas. Wildcard schema nodes are a further generalization (i.e., a generalization of all types). Wildcards do not describe any constraints on the content, just the existence of such content. Therefore, a transformation 120a . . . 120n that has an input schema with a wildcard schema node transfers the content associated with the wildcard schema node as is without any additional processing.
The pipeline processor 110 is coupled to the individual transformations 120a . . . 120n and is capable of providing data to each individual transformation 120a . . . 120n and transferring data between the individual transformations 120a . . . 120n. Data is described by schemas, polymorphic or not. Data refers to the actual instance data (e.g., Amir Bar-Or is data for the schema FullName:String).
Embodiments improve the execution performance of transformations (e.g., XML transformations) expressed as a pipeline. Embodiments specify transformations using polymorphic schemas so that the transformations are expressed in a way that makes it clear which parts of a hierarchical document (e.g., an XML document) each of the transformations processes and which parts each of the transformations carries along (e.g., because different transformations will be using different parts of the hierarchical document). Embodiments provide optimizations so that the parts of the hierarchical document 160 that are not being transformed are handled with less overhead.
A hierarchical document 160 may be described as including hierarchical data. Hierarchical data may be described as including nested structures, which in turn may include nested repeating vector nodes. A vector node may represent a vector of a complex structure that can, in turn, contain multiple scalars (represented by scalar nodes and vectors (represented by vector nodes). In certain embodiments, hierarchical data may be represented as a hierarchical tree data structure having sub-trees.
With embodiments, each transformation 120a . . . 120n in the XML pipeline provides an input schema and an output schema that describe the structure of input data and output data, respectively, for that transformation 120a . . . 120n. A schema may be described as a tree of schema nodes that describe different types of data items. In certain embodiments, the data items are infoset items.
In certain embodiments, infoset items are XML Information Set (infoset) items. XML infoset may be described as a World Wide Web Consortium (W3C) specification describing an abstract data model of an XML document in terms of a set of information items. The definitions in the XML Information Set specification are meant to be used in other specifications that need to refer to the information in a well-formed XML document.
An XML Information Set may contain up to eleven different types of information items:
1. The Document Information Item
2. Element Information Items
3. Attribute Information Items
4. Processing Instruction Information Items
5. Unexpanded Entity Reference Information Items
6. Character Information Items
7. Comment Information Items
8. The Document Type Declaration Information Item
9. Unparsed Entity Information Items
10. Notation Information Items
11. Namespace Information Items
Simple API for XML (SAX) and Streaming API for XML (StAX) are event based APIs for processing streams of XML documents. SAX is a push-API in which different methods of the XML process are called for every type of event, while StAX is a pull-API in which the XML process iterates through the events in the stream. The events correspond to begin and end events of the information items in the XML Information Set.
A wildcard schema node may be described as a node that does not define any specific type, and, therefore, any data in the hierarchical document 160 may match this wildcard schema node. A schema is called a polymorphic schema if the schema contains at least a single wildcard schema node. With polymorphic schemas, the pipeline processor 110 transforms various hierarchical documents where the information has different schemas that describe the document structures. That is, the same processing transformation 120a . . . 120n is able to process documents with different structures if the documents adhere to the polymorphic schema (e.g., with a polymorphic schema a int, b wildcard, all documents that have an A integer and any other structure can be transformed by a particular transformation 120a . . . 120n).
Also, the input schema 200 includes a wildcard schema node 220 (“<any maxOccur=“unbounded” id=“otherStuff”/>”). With this wildcard schema node, the transformation 120a . . . 120n may take any input element whose type has a child element named “Address”, normalize and validate the address, and pass on the rest of the elements as the schema node 220.
Similarly, input schema 350 has an element name of “Factory” with schema node 360 (“<element name=“Address” type=”string”/>”) corresponding to schema node 210 (“<element name=“Address” type=“string”/>”). From the input schema 300, the transformation 120a . . . 120n treats the remaining schema nodes 370 (“element name=“Company”type=“string”/>”) and 380 (“<element name=“NumEmployees” type=“string”/>”) as corresponding to the wildcard schema node 220 (“<any maxOccur=“unbounded”id=“otherStuff”/>”). The transformation 120a . . . 120n normalizes and validates the address string.
A transformation 120a . . . 120n passes the information that matches the “any” wildcard schema node as output to allow further processing of the content (e.g., by a downstream transformation 120a . . . 120n). For instance, the output of a transformation 120a . . . 120n in the example described with reference to
Note that transformation input and output schemas may be either induced by compiling the language (e.g., XSLT or XQuery) of a transformation 120a . . . 120n to create the input and output schemas or may be declared by a pipeline composer (e.g., a developer).
In certain embodiments, a stream representation of a hierarchical document (e.g., an XML document) turns each data item (e.g., each infoset item) into a stream of data items or an event. Such a stream of data items or event may be represented in many ways (e.g., as a SAX event or Binary XML). Embodiments are not specific to any of these representations and are applicable to any representation.
Embodiments increase the performance of a pipeline 112 by changing the event granularity (i.e., by collecting many data items into a single compressed event). This is possible when the transformation 120a . . . 120n does not require these data items in order to perform the actual transformation. For instance, the transformation 120a . . . 120n in the example with reference to
Control begins at block 400 with receipt of an input schema for an upstream transformation that is active (i.e., currently performing processing in the pipeline 112) and information about data items that may be collected for the next downstream transformation 120a . . . 120n. A hierarchical document 160 that is to be processed by the transformations 120a . . . 120n in the pipeline 112 is also received. In block 402, it is determined whether a next downstream transformation 120a . . . 120n accesses content of each schema node in an associated input schema (i.e., has a wildcard schema node in the input schema of the next downstream transformation 120a . . . 120n). If not, processing continues to block 404, otherwise, processing continues to block 406.
In block 404, data items (e.g., infoset items) corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event and passed to the next downstream transformation 120a . . . 120n as the single compressed event (rather than as multiple, individual events). The term compressed is used to indicate that the collected data items are transferred as a single object in a single action. This is more efficient than transferring the data items one by one. A single compressed event may also be referred to as a single aggregated event. There are multiple techniques that may be used to implement the collection of the events. In particular, there are techniques to make the transfer of a collection of events faster than transferring the events in the collection one by one. In some cases, it may be more efficient to transfer the identity of the data item rather than the data item itself in places in which the data item is not accessed.
In certain embodiments, the events are turned into a single opaque object that is passed along with the parent item. In certain alternative embodiments, the collected items are replaced with a unique key (e.g., a location identifier), and the next downstream transformation 120a . . . 120n that needs the items replaces the unique key with the corresponding collection of items (down the stream when needed).
In block 406, it is determined whether an compressed event that includes collected items corresponds to a non-wildcard schema node. If so, processing continues to block 408, otherwise, processing continues to block 410. In block 408, the collected items in the compressed event are turned into multiple, individual events and are passed as multiple, individual events to the next downstream transformation 120a . . . 120n. The compressed event may be described as being unfolded, unwrapped or uncompressed. That is, it is possible that an upstream transformation 120a . . . 120n aggregated data items into a single compressed event that should not have been aggregated.
In block 410, other processing is performed.
Thus, if a next downstream transformation 120a . . . 120n has a wildcard schema node, the data items that correspond to this wildcard schema node are collected. If at least one data item of a single compressed event corresponds to a non-wildcard schema node, the collected data items are turned into individual events (e.g., with one individual event corresponding to one data item).
In this manner, the collected data items are passed as a single compressed event between the producer (i.e., one transformation 120a . . . 120n) and a consumer (i.e., a next downstream transformation 120a . . . 120n) instead of passing multiple events , where the multiple events match the “any” element schema node.
Embodiments optimize pipeline processing by aggregating events. Depending on the type of processing, this optimization may save many consumer/produce operations of the transformations 120a . . . 120n, improving the throughput of the pipeline 112. In some cases, detailed information is needed for processing after many stages of processing (i.e., after being passed through many transformations 120a . . . 120n). Thus, an aggregate object that is created once early in the pipeline 112 and expanded as needed may save many copy operations that would otherwise be required to pass multiple (unaggregated) events.
Moreover, the collected items may be compressed into a more efficient memory structure, thus reducing memory consumption and possibly I/O.
In addition, standard XML transformations may be used without any required change to the XML transformations. Standard stream protocols, such as SAX and StaX, may be used without an enhancement to the protocols. For example, to implement the aggregation optimization for a SAX implementation, a mediator pattern may be used to stand between the SAX transformations and aggregate the events, without changing the transformations or the SAX interface.
In addition, the optimization of aggregating events may be applied to extension (also referred to as inheritance). Embodiments transform polymorphic schemas that use inheritance relationships between a parent schema node and corresponding child schema nodes to polymorphic schemas without inheritance relationships using wildcard schema nodes by: adding a wildcard schema node that provides a match for additional sub-elements and attributes of child schema nodes to the parent schema node and removing the inheritance relationship.
For example, if the schemas that describe the transformations 120a . . . 120n contain base elements, these base elements may be systematically extended by an “any” element wildcard schema node that provides a match for additional sub-elements and attributes of child elements.
Thus, embodiments use the wildcards in polymorphic schemas to determine which portions of a hierarchical document is affected by a particular transformation 120a . . . 120n.
The described operations may be implemented as a method, computer program product or apparatus using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof.
Each of the embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. The embodiments may be implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.
Furthermore, the embodiments may take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium may be any apparatus that may contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
The described operations may be implemented as code maintained in a computer-usable or computer readable medium, where a processor may read and execute the code from the computer readable medium. The medium may be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a rigid magnetic disk, an optical disk, magnetic storage medium (e.g., hard disk drives, floppy disks, tape, etc.), volatile and non-volatile memory devices (e.g., a random access memory (RAM), DRAMs, SRAMs, a read-only memory (ROM), PROMs, EEPROMs, Flash Memory, firmware, programmable logic, etc.). Current examples of optical disks include compact disk-read only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD.
The code implementing the described operations may further be implemented in hardware logic (e.g., an integrated circuit chip, Programmable Gate Array (PGA), Application Specific Integrated Circuit (ASIC), etc.). Still further, the code implementing the described operations may comprise a receiver or transmitter device or other physical carrier capable of processing or implementing the code as “transmission signals”, where transmission signals may propagate through space or through a transmission media, such as an optical fiber, copper wire, etc. The transmission signals in which the code or logic is encoded may further comprise a wireless signal, satellite transmission, radio waves, infrared signals, Bluetooth, etc. The transmission signals in which the code or logic is encoded is capable of being transmitted by a transmitting station and received by a receiving station, where the code or logic encoded in the transmission signal may be decoded and stored in hardware or a computer readable medium at the receiving and transmitting stations or devices.
A computer program product may comprise computer useable or computer readable media, hardware logic, and/or transmission signals in which code may be implemented. Of course, those skilled in the art will recognize that many modifications may be made to this configuration without departing from the scope of the embodiments, and that the computer program product may comprise any suitable information bearing medium known in the art.
The term logic may include, by way of example, software, hardware, firmware, and/or combinations of software and hardware.
Certain implementations may be directed to a method for deploying computing infrastructure by a person or automated processing integrating computer-readable code into a computing system, wherein the code in combination with the computing system is enabled to perform the operations of the described implementations.
The logic of
The illustrated logic of
Input/Output (I/O) devices 612, 614 (including but not limited to keyboards, displays, pointing devices, etc.) may be coupled to the system either directly or through intervening I/O controllers 610.
Network adapters 608 may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters 608.
The system architecture 600 may be coupled to storage 616 (e.g., a non-volatile storage area, such as magnetic disk drives, optical disk drives, a tape drive, etc.). The storage 616 may comprise an internal storage device or an attached or network accessible storage. Computer programs 606 in storage 616 may be loaded into the memory elements 604 and executed by a processor 602 in a manner known in the art.
The system architecture 600 may include fewer components than illustrated, additional components not illustrated herein, or some combination of the components illustrated and additional components. The system architecture 600 may comprise any computing device known in the art, such as a mainframe, server, personal computer, workstation, laptop, handheld computer, telephony device, network appliance, virtualization device, storage controller, etc.
The foregoing description of embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the embodiments to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the embodiments be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the embodiments. Since many embodiments may be made without departing from the spirit and scope of the embodiments, the embodiments reside in the claims hereinafter appended or any subsequently-filed claims, and their equivalents.
Bar-Or, Amir, Beckerle, Michael James
| Patent | Priority | Assignee | Title |
| 10489358, | Feb 15 2017 | CA, Inc. | Schemas to declare graph data models |
| 8543362, | Jul 15 2010 | Honeywell International Inc. | System and method for configuring a simulation model utilizing a tool for automatic input/output assignment |
| Patent | Priority | Assignee | Title |
| 4145733, | Mar 29 1974 | DATAFLOW COMPUTER CORPORATION, 85 EAST INDIA ROW, SUITE 5F, BOSTON, MASSACHUSETTS 02110, A CORP OF DE | Data processing apparatus for highly parallel execution of stored programs |
| 5021947, | Mar 31 1986 | Hughes Aircraft Company | Data-flow multiprocessor architecture with three dimensional multistage interconnection network for efficient signal and data processing |
| 5465372, | Jan 06 1992 | Bar Ilan University | Dataflow computer for following data dependent path processes |
| 5555201, | Apr 19 1990 | LSI Logic Corporation | Method and system for creating and validating low level description of electronic design from higher level, behavior-oriented description, including interactive system for hierarchical display of control and dataflow information |
| 5603018, | Jul 15 1991 | Mitsubishi Denki Kabushiki Kaisha; Sharp Kabushiki Kaisha; Matsushita Electric Industrial Co., Ltd.; Sanyo Electric Co., Ltd. | Program developing system allowing a specification definition to be represented by a plurality of different graphical, non-procedural representation formats |
| 5724570, | Jun 07 1995 | HEWLETT-PACKARD DEVELOPMENT COMPANY, L P | Method and apparatus for a complete SQL subquery elimination process |
| 5801958, | Jun 14 1993 | LSI Logic Corporation | Method and system for creating and validating low level description of electronic design from higher level, behavior-oriented description, including interactive system for hierarchical display of control and dataflow information |
| 5806062, | Oct 17 1995 | Sound View Innovations, LLC | Data analysis system using virtual databases |
| 5822593, | Dec 06 1996 | Xerox Corporation | High-level loop fusion |
| 6192504, | May 14 1997 | International Business Machines Corporation | Methods and systems for functionally describing a digital hardware design and for converting a functional specification of same into a netlist |
| 6311265, | Mar 25 1996 | International Business Machines Corporation | Apparatuses and methods for programming parallel computers |
| 6601058, | Oct 05 1998 | BARCLAYS BANK PLC, AS ADMINISTATIVE AGENT | Data exploration system and method |
| 6654952, | Feb 03 2000 | Oracle America, Inc | Region based optimizations using data dependence graphs |
| 6772398, | Jun 15 2001 | Cadence Design Systems, INC | Reducing datapath widths responsively to upper bound on information content |
| 6801938, | Jun 18 1999 | International Business Machines Corporation | Segmentation and processing of continuous data streams using transactional semantics |
| 6832357, | Jun 15 2001 | Cadence Design Systems, INC | Reducing datapath widths by rebalancing data flow topology |
| 6880125, | Feb 21 2002 | Oracle International Corporation | System and method for XML parsing |
| 6918111, | Oct 03 2000 | Oracle America, Inc | System and method for scheduling instructions to maximize outstanding prefetches and loads |
| 6954749, | Oct 07 2002 | OBJECTSTORE, INC | Methods and apparatus for identifying related nodes in a directed graph having named arcs |
| 7080088, | Jan 30 2002 | Oracle International Corporation | Automatic reconciliation of bindable objects |
| 7089567, | Apr 09 2001 | LinkedIn Corporation | Efficient RPC mechanism using XML |
| 7254590, | Dec 03 2003 | Informatica LLC | Set-oriented real-time data processing based on transaction boundaries |
| 7299458, | Oct 31 2002 | FG SRC LLC | System and method for converting control flow graph representations to control-dataflow graph representations |
| 7392514, | Jun 26 2003 | Microsoft Technology Licensing, LLC | Data flow chasing |
| 7454413, | Aug 19 2005 | Microsoft Technology Licensing, LLC | Query expressions and interactions with metadata |
| 7467371, | Apr 28 2000 | Microsoft Technology Licensing, LLC | Binding for business workflow processes |
| 7496585, | Apr 23 2004 | International Business Machines Corporation | Methods and apparatus for discovering data providers satisfying provider queries |
| 7836066, | Jul 12 2007 | Oracle International Corporation | Using SQL extensibility for processing dynamically typed XML data in XQuery queries |
| 20020080181, | |||
| 20030014379, | |||
| 20030023628, | |||
| 20030159111, | |||
| 20030191765, | |||
| 20030200538, | |||
| 20040117772, | |||
| 20040123072, | |||
| 20040205058, | |||
| 20040207665, | |||
| 20040225999, | |||
| 20050071359, | |||
| 20050097561, | |||
| 20050251527, | |||
| 20050257194, | |||
| 20050257195, | |||
| 20060005173, | |||
| 20060020951, | |||
| 20060048113, | |||
| 20060150164, | |||
| 20060277392, | |||
| 20070136262, | |||
| 20070220486, | |||
| 20080052687, | |||
| 20080082984, | |||
| 20080133209, | |||
| 20080134158, | |||
| 20090063515, | |||
| 20090063583, | |||
| 20090064157, |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Jun 24 2008 | BAR-OR, AMIR | International Business Machines Corporation | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 021784 | /0599 | |
| Jun 24 2008 | BECKERLE, MICHAEL JAMES | International Business Machines Corporation | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 021784 | /0599 | |
| Jun 26 2008 | International Business Machines Corporation | (assignment on the face of the patent) | / |
| Date | Maintenance Fee Events |
| Nov 27 2015 | REM: Maintenance Fee Reminder Mailed. |
| Apr 17 2016 | EXP: Patent Expired for Failure to Pay Maintenance Fees. |
| Date | Maintenance Schedule |
| Apr 17 2015 | 4 years fee payment window open |
| Oct 17 2015 | 6 months grace period start (w surcharge) |
| Apr 17 2016 | patent expiry (for year 4) |
| Apr 17 2018 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Apr 17 2019 | 8 years fee payment window open |
| Oct 17 2019 | 6 months grace period start (w surcharge) |
| Apr 17 2020 | patent expiry (for year 8) |
| Apr 17 2022 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Apr 17 2023 | 12 years fee payment window open |
| Oct 17 2023 | 6 months grace period start (w surcharge) |
| Apr 17 2024 | patent expiry (for year 12) |
| Apr 17 2026 | 2 years to revive unintentionally abandoned end. (for year 12) |