|Publication number||US20080005278 A1|
|Application number||US 11/423,460|
|Publication date||Jan 3, 2008|
|Filing date||Jun 12, 2006|
|Priority date||Jun 12, 2006|
|Also published as||CN101090337A, CN101090337B, US7519599|
|Publication number||11423460, 423460, US 2008/0005278 A1, US 2008/005278 A1, US 20080005278 A1, US 20080005278A1, US 2008005278 A1, US 2008005278A1, US-A1-20080005278, US-A1-2008005278, US2008/0005278A1, US2008/005278A1, US20080005278 A1, US20080005278A1, US2008005278 A1, US2008005278A1|
|Inventors||Joseph P. Betz, Matthew N. Roy, Christopher R. Vincent|
|Original Assignee||Betz Joseph P, Roy Matthew N, Vincent Christopher R|
|Export Citation||BiBTeX, EndNote, RefMan|
|Referenced by (10), Classifications (13), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
1. Field of the Invention
This invention generally relates to semantic web technology, and more specifically, to methods and systems for scalable distribution of semantic web updates. Even more specifically, the invention relates to such methods and systems that arc particularly well suited for use with the Resource Description Framework (RDF) language.
2. Background Art
RDF is a language used to represent information, particularly meta data about resources available in the World Wide Web. For example, RDF may be used to represent copyright or licensing information about a document on the Web, or the author and title of a particular Web page. RDF can also be employed for representing data or meta data about items or matters that can be identified on the World Wide Web even though these items cannot be directly retrieved from the Web. Examples of these latter items may include data about a user's Web preferences, and information, such as the price and availability, of items for sale at on-line shopping facilities. Specifications for RDF are established by the World Wide Web Consortium. The RDF specification also describes how to serialize RDF data for use in web services, etc. (e.g. RDF/XML).
RDF uses identifiers, referred to as Uniform Resource Identifiers, or URIs, and is based on a specific terminology. An RDF statement includes a subject, a predicate and an object. The subject identifies the thing, such as person or Web page, that the statement is about. The predicate identifies the property or characteristic, such as title or owner, of the subject of the RDF statement, and the object identifies a value of that property or characteristic. For example, if the RDF statement is about pet owners, the subject might be “owner,” the predicate could be “name,” and the object could be “Joe.” This format, among other advantages, allows RDF to represent statements as a graph of nodes and arcs. In the graph, the subjects and objects may be represented by, for example, ovals, circles or squares, or some combination thereof while the predicates of the RDF statements may be represented by arcs or arrows connecting the subject of each statement with the object of the statement.
An important feature of RDF is that it provides a common framework for expressing information. This allows this information to be exchanged among applications without losing any meaning of the information. Because of this common framework application developers can utilize the availability of common tools and parsers to process RDF information.
While the RDF specification describes a data model, and there exists several query languages, there is no standard method for publishing updated semantic web data to distributed clients. More specifically, conventional semantic web solutions (1) provide query languages and APIs for retrieving specified data patterns from an RDF graph, and (2) provide rudimentary eventing systems allowing clients to receive notification whenever any RDF statements are added or removed to a repository/store. These conventional solutions however, do not efficiently transmit updates to distributed clients, and in particular, do not distribute updates such that clients receive only the information they require or request.
An object of this invention is to provide a standard method for publishing updated semantic web data to distributed clients.
Another object of the present invention is to leverage existing publish/subscribe technology to distribute updated semantic web data such as RDF, so that clients receive only the information they require.
A farther object of the invention is to provide an architecture for distributing and enforcing semantic web access control information.
Still another object of this invention is to use the same publish/subscribe messaging infrastructure both to distribute updated semantic web data, and also to distribute relevant changes to control information that is used to restrict access to the updated semantic web data.
These and other objectives are attained with a method and system for scalable distribution of semantic web updates. A first embodiment of the invention leverages publish/subscribe technology to distribute those updates such that clients receive only the information they require. A second embodiment of the invention uses an access control feature to limit the statements clients arc allowed to read. Optionally, in this second embodiment, the same publish/subscribe messaging infrastructure may he used both to distribute updated semantic web data, and also to distribute relevant changes to the access control information.
The invention is particularly well suited for use with the Resource Description Framework (RDF) language. In the preferred embodiment of the invention, clients communicate with an RDF store server through a combination of synchronous web service operations, and asynchronous JMS updates, and clients may register for only the updates they are interested in.
Further benefits and advantages of the invention will become apparent from a consideration of the following detailed description, given with reference to the accompanying drawings, which specify and show preferred embodiments of the invention.
Any suitable server 102 may be used in system 100, and for example, the server may be an IBM RS/6000 server. Also, the clients 104 of the system may be, for instance, personal computers, laptop computers, servers, workstations, main frame computers, or other devices capable of communicating over the network. Likewise, the devices of system 100 may be connected to the network using a wide range of suitable connectors or links, such as wire, fiber optics or wireless communication links. Distributed system 100 may include additional servers, clients and other devices not shown in
As mentioned above, in the depicted example, the devices of system 100 may be connected together via the Internet, which is a worldwide collection of networks and gateways that use the TCP/IP suite of protocols to communicate with one another. In the operation of system 100, server 102 provides data and applications to the clients. Among other functions, the server and the clients store semantic web statements such as RDF statements. For this reason, as depicted in
Any suitable mechanism may be used to store the RDF statements. For example, relational databases that may be used to store RDF statements are disclosed, in copending application no. (Attorney Docket POU920050098US1) for “Method And System For Controlling Access To Semantic Web Statements,” filed ______, and copending application no. (Attorney Docket POU920050099US1), for “Method And System For Efficiently Storing Semantic Web Statements In A Relational Database,” filed ______, the disclosures of which are hereby incorporated herein in their entireties by reference .
The present invention is directed generally to the distribution of such semantic statements. More specifically, the invention leverages existing JMS publish/subscribe technology (e.g. IBM Websphere Event Broker), represented at 106, to distribute RDF updates such that clients receive only the information they require. Updates include adding, changing or removing RDF statements.
In system 100, clients 104 listen for events using content-based message selection, a feature provided by the JMS standard. The server 102 publishes all events into the publish/subscribe cloud 106, allowing the brokers to discard events that do not match any client subscriptions. The example messages illustrated in
At step 310, the routine checks to determine if any JMS messages are pending. If no messages are pending, this step is repeated until a message is pending; and, when a message is pending, the routine moves on to step 312. At this step, the client checks to determine if the pending message indicates that an RDF statement has been removed. If this is the case, the statement is removed from the local RDF stores at step 314, and the routine returns to step 310.
If, at step 312, the pending message does not indicate that an RDF statement is being removed, then the pending message indicates that a statement is being added or modified, and from step 312, the routine proceeds to step 316. At this step, a time stamp on the message is examined. If, as represented at step 320, the timestamp shows that the update is obsolete, then the routine returns to step 310. If the message is not obsolete, then, at step 322, the local store is updated with the new statement information, and then the routine returns to step 310.
However, if at step 410, the request does result in a change, the routine moves on to step 414, and the request is processed and the data are returned. Then, at step 416, an update message is published for each statement modified, and the routine then returns to step 406.
In the operation of system 100, clients communicate with an RDF store server through a combination of synchronous web service operations and asynchronous JMS updates. This operation may be significantly complicated by statement-level access control lists, which restrict which clients are allowed to read which statements. This level of access control means that simple publish/subscribe cannot be relied on alone, because some application-level authentication and message filtering is needed. In addition, RDF statements are added, modified, and removed within the scope of transactions. This also complicates the scenario, since any particular client may only be allowed to see some of the statements involved in a transaction.
In system 500, clients 504 may connect to one of many update managers (most likely using web services over point-to-point JMS, e.g. IBM WebSphere MQ). After authenticating, the client specifies a pattern for statement updates of interest. These patterns may match the subject, predicate or object of a statement, or other metadata the server chooses to include in the updates such as the date and time the statement is created.
All statement updates are published, one at a time, by the store server, over an internal publish/subscribe broker cloud. The update managers subscribe to statement updates based on the patterns provided by their clients, and listen for all transaction completion messages. Each statement update is tagged with an ACL (Access Control List) identifier. Every time an update manger receives an update, it must ensure that the client is allowed to see the information before passing it on.
With reference to
If security policies allow some delay in enforcement after changes to the access control database, HTTP-style caching could be applied here. Update managers would be allowed to cache ACL information, depending on expiration times or get-if-modified operations supported by the ACL database and configured by the store server. It may be noted that with caching, clients connecting to different update managers may see different view of the data (corresponding to different versions of the access control data).
If, at step 706, there is a statement update pending, then the routine, at step 714, looks up the update ACL URI in access control database, and then, at step 716, determines whether the user has permission to read this update. If the user does have permission, then the routine proceeds to steps 720 and 722. At step 720, the update is sent to the user, via a point-to-point connection; and at step 722, the update transaction ID is added to a list of pending transactions. From step 722, the routine proceeds to step 710. If, at step 714, it is determined that the user does not have permission to read this update, the routine skips to step 710 and proceeds from there.
Any suitable update managers may be used in the practice of this invention. For example, suitable update managers are described in copending application no. (Attorney Docket no. POU920050059US1) for “System And Method For Tracking And Storing Semantic Web Revision History,” filed ______, and copending application no. (Attorney Docket no. POU920050060US1) for “Method And System For Selective Tracking Of Semantic Web Data Using Distributed Update Events,” filed ______, the disclosure of which is hereby incorporated herein in its entirety by reference.
With reference to
This architecture allows update mangers to filter incoming statement update messages immediately, without contacting any other node.
With particular reference to
At step 1114, the routine determines whether there is a statement update pending from the store server. If there is not, the routine proceeds to step 1116 where the routine determines whether there is an applicable transaction complete pending from the store server. If there is no such transaction complete pending, the routine returns to step 1110 and continues on from there. If there is such a pending transaction complete at step 1114, the routine moves on to step 1120, where the completed transaction is sent to the user via a point-to-point JMS connection, and this transaction is removed from the pending transaction list. After this, the routine returns to step 1110 and then proceeds from there.
If at step 1114, there is an update statement pending, the routine moves to step 1122, where a determination is made as to whether the user is entitled to this update. If the user is not entitled, the routine proceeds to step 1116; however, if the user is entitled to this update, the routine goes to step 1124. At this step, the update is sent to the user via a point-to-point connection. Then, at step 1126, the update's transaction ID is added to the pending transaction list, and from step 1126, the routine then goes to step 1116 and proceed from there.
While it is apparent that the invention herein disclosed is well calculated to fulfill the objects stated above, it will be appreciated that numerous modifications and embodiments may be devised by those skilled in the art, and it is intended that the appended claims cover all such modifications and embodiments as fall within the true spirit and scope of the present invention.
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7552151 *||Feb 6, 2006||Jun 23, 2009||International Business Machines Corporation||System, method and program product for adding, updating and removing RDF statements stored on a server|
|US8098248||Apr 2, 2007||Jan 17, 2012||International Business Machines Corporation||Method for semantic modeling of stream processing components to enable automatic application composition|
|US8117233 *||May 14, 2007||Feb 14, 2012||International Business Machines Corporation||Method and system for message-oriented semantic web service composition based on artificial intelligence planning|
|US8166465 *||Apr 2, 2007||Apr 24, 2012||International Business Machines Corporation||Method and system for composing stream processing applications according to a semantic description of a processing goal|
|US8307372||Apr 2, 2007||Nov 6, 2012||International Business Machines Corporation||Method for declarative semantic expression of user intent to enable goal-driven information processing|
|US8370812||Apr 2, 2007||Feb 5, 2013||International Business Machines Corporation||Method and system for automatically assembling processing graphs in information processing systems|
|US8566311 *||Mar 17, 2005||Oct 22, 2013||Avaya, Inc.||Method and apparatus for notifying a user of a predefined changes to dynamic attributes|
|US8863102||Apr 2, 2007||Oct 14, 2014||International Business Machines Corporation||Method and system for assembling information processing applications based on declarative semantic specifications|
|US8966377||Aug 20, 2010||Feb 24, 2015||Nokia Corporation||Method and apparatus for a virtual desktop|
|US20050234993 *||Mar 17, 2005||Oct 20, 2005||Ordille Joann J||Method and apparatus for subscribing to dynamic attributes|
|Cooperative Classification||Y10S707/99939, Y10S707/99931, Y10S707/99945, H04L67/02, H04L67/1095, G06F17/3089, H04L63/101|
|European Classification||H04L63/10A, H04L29/08N1, G06F17/30W7, H04L29/08N9R|
|Jun 22, 2006||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BETZ, JOSEPH P;ROY, MATTHEW N;VINCENT, CHRISTOPHER R;REEL/FRAME:017826/0654;SIGNING DATES FROM 20060201 TO 20060606
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BETZ, JOSEPH P;ROY, MATTHEW N;VINCENT, CHRISTOPHER R;SIGNING DATES FROM 20060201 TO 20060606;REEL/FRAME:017826/0654
|Nov 26, 2012||REMI||Maintenance fee reminder mailed|
|Apr 14, 2013||LAPS||Lapse for failure to pay maintenance fees|
|Jun 4, 2013||FP||Expired due to failure to pay maintenance fee|
Effective date: 20130414