Graph Working Group Proposal
There is interest to initiate an OpenID Graph Working Group to create a specification for a triples based "Graph" protocol. The goal is to enable Internet scale "Data Federation," a network in which autonomous parties could selectively share data. The Graph defined by this working group would seek to leverage the identity infrastructure defined by other OpenID Foundation standards and working groups.
Name
Background Information
A triple store is designed to store and retrieve identities that are constructed from triplex collections of strings (sequences of letters). These triplex collections represent a subject-predicate-object relationship that more or less corresponds to the definition put forth by the W3C RDF standard. Triple stores provide more flexibility over traditional persistence technologies such as RDBMS or LDAP by enabling the creation of "predicates," (think columns in relational databases or attributes in LDAP), while still providing a data structure that supports complex ad hoc queries, inferencing and rule processing.
The need for a new graph standard is understandably controversial. While other triples based graph technologies exist, none provide the security and identity foundation sought by the Graph Working Group founders. More specifically, the RDF standard does not sufficiently address context or security. The XDI standard, under development at OASIS, is based on the XRI naming infrastructure, which is not widely adopted.
Gluu has developed a significant amount of code during the last two years, and has published its code as part of the OX open source project. Gluu intends to re-package and donate a significant portion of this code to the Graph Working Group.
Statement of Purpose
The goal of this working group is to document the standards needed to use a triples based graph network to enable entities to securely exchange data.
Scope
The scope of the standard will include the following high level components:
- Arc and node naming
- Messaging
- Create operation
- Read operation
- Update operation
- Delete operation
- Language Support
- Permissions / Authorization
- Search Filtering
Specifications
OpenID Graph 1.0
Anticipated audience
A graph based network for Data Federation could make the Internet safer for end-users while increasing their productivity. There is a spectrum of people who might be interested in such a standard from end-users to integrators and developers. Just as SQL and LDAP have become specialized technical domains, it is not expected that the end user, or even integrators will want to send low level Graph messages. However, knowledge of the Graph architecture, addressing and storage is general interest.
Language of business
English.
Method of work
The Graph Working Group will arrange the following:
- Weekly Gotomeeting implementer collaboration calls
- Monthly Working Group progress review meetings
- Posting of intermediate drafts in the OpenID Wiki
- Email mailing lists
- Working Group Jira project
- Revision control for drafts, documentation, and code
- Hudson build server for continuous integration
Schedule
- Working Draft - 12/31/12
- Implementer’s Draft Review Period - 2/28/13
- Implementer’s Draft Voting 4/30/13
- Implementer’s Draft 6/30/13
- Feedback on Implementer’s Drafts 8/31/13
- Final Review Period 10/31/13
- Final Voting 12/31/13
- OIDF Standard
Basis for completion of the Working Group activities
The OpenID Graph 1.0 final specification is completed and no future enhancements are required.
Contributors
- Mike Schwartz, Gluu
- Yuriy Movchan, Gluu
- Yuriy Zabrovarnyy, Gluu
- Scott Kern, Verizon
- Russel Weiser, Verizon
Initial Editor
Mike Schwartz
Comments (0)
You don't have permission to comment on this page.