Version Hash Linked Graph for Document Tracking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing collaboration technologies lack the flexibility to efficiently connect and analyze document versions across multiple devices and applications, limiting the ability to understand user interactions and provide timely notifications and version reconciliation.
Innovation Solution
The implementation of a Version Hash Linked Graph (VHLG) that uses document hashes to connect successive version information, enabling the construction of a graph that can be analyzed for collaboration insights and used for document tracking, notification, and version reconciliation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If chained hashes are used to link document versions, then document version tracking is achieved, but the ability to provide deeper context for understanding user interactions and collaboration patterns is lost
Solution Approach 1:
The patent segments the document version tracking system into multiple graph components: a first graph for tracking document versions using chained hashes, and a second graph for tracking user interactions and collaboration patterns. This segmentation allows each graph to specialize in specific information types, preserving both version tracking accuracy and collaboration context that would otherwise be lost in a single chained hash structure.
Solution Approach 2:
The patent transitions from a one-dimensional chained hash structure to a multi-dimensional graph structure. The first graph operates on document version hashes while the second graph operates on user interaction data, and the systems interoperate between these dimensions. This dimensional expansion enables simultaneous tracking of version history and collaboration context without sacrificing either aspect.
2Productivity
If document versions are tracked using hash chaining, then version lookup efficiency is improved, but the flexibility to analyze collaboration networks and user interactions across multiple devices is reduced
Solution Approach 1:
The patent creates a universal system where the first graph handles document version tracking with efficient hash-based lookup, while the second graph handles collaboration pattern analysis. Both graphs can be queried and analyzed independently or together, providing multi-functionality that supports both efficient version lookup and flexible collaboration analysis across multiple devices and applications.
Solution Approach 2:
The patent introduces an intermediary layer between the two graphs through shared data structures and query mechanisms. This intermediary enables the system to leverage the efficiency of hash chaining for version lookup while simultaneously providing access to collaboration context for network analysis, thus maintaining both productivity and adaptability.
3Device complexity
If a single graph structure is used for all document tracking, then system simplicity is maintained, but the ability to provide timely notifications and version reconciliation is limited
Solution Approach 1:
The patent segments the tracking system into two specialized graphs: the first graph for document versions and the second graph for user interactions. This segmentation enables each graph to be optimized for its specific function, with the version graph providing reliable change detection for notifications and the interaction graph providing context for version reconciliation, thereby improving reliability without excessive complexity.
Solution Approach 2:
The patent implements dynamic query capabilities that can flexibly access either or both graphs based on the specific operation being performed. The system dynamically selects which graph to query for version lookup, user interaction analysis, or collaboration pattern detection, allowing timely notifications and version reconciliation while maintaining manageable system complexity through on-demand graph access.
Data Source
AI summary
Embodiments of the invention provide the ability to track document versioning. Before executing an open operation on a first document version, a first before-hash is generated. After executing the open operation, a first after-hash is generated. Before executing a save operation, the first before-hash is acquired, and after execution (resulting in a second document version), a second after-hash of the second document version is generated. A version hash linked graph (VHLG) is generated and includes document nodes for the different document versions where each node includes a hash of that document version, a user-application node corresponding to the user or application that executed the operations, and edges connecting the nodes (e.g., that identify the operation and/or the document lineage) Based on the VHLG, a full history of a document is provided.