Hosted application gateway architecture with multi-level security policy and rule promulgations

• US 10,824,756 B2
• Filed: 04/01/2019
• Issued: 11/03/2020
• Est. Priority Date: 09/20/2013
• Status: Active Grant

• Current Assignee: Ip Ot Sub Ulc
• Original Assignee: Open Text Sa Ulc (Open Text Corporation)
• Inventors: Beckman, Gregory, Laird, Robert, Obbard, Geoffrey Michael
• Primary Examiner(s): Shaifer Harriman, Dant B
• Application Number:
  US16/371,852
• Publication Number:
  US 20190228177A1
• Time in Patent Office: 582 Days
• Field of Search: 707781
• CPC Class Codes: G06F 21/6227 where protection concerns the structure of data, e.g. records, types, queries
• CPC Class Codes: G06F 21/629 to features or functions of an application

Abstract

A hosted application gateway server node may be communicatively coupled to backend systems, client devices, and database shards associated with database servers. Through the gateway server node, various services may be provided to managed containers running on client devices such that enterprise applications can be centrally managed. A sharding manager may manage relationships of database items across database shards. Each shard stores a copy of a table representing a split of a relationship. A shard ID mask is included in each item'"'"'s ID. At query time, the shard ID can be extracted and used to query the correct database. This query routing mechanism allows navigation from one shard to another when multiple items are in a relationship (e.g., share the same resource such as a document). As such, embodiments can eliminate the need for APIs to join in data that span multiple shards.

Claims

1. A system, comprising:

a processor;

a non-transitory computer-readable medium; and

stored instructions translatable by the processor for;

storing a first data structure representing a first split of a relationship in a first database shard, wherein the first data structure references a second database item in a second database shard and references a first database item in the first database shard, the first database item having a first object identifier encoded with the shard identifier of the first database shard; and

storing a second data structure representing a second split of the relationship in a second database shard, wherein the second data structure references the first database item in the first database shard and references the second database item in the second database shard, the second database item having a second object identifier encoded with the shard identifier of the second database shard, the second object identifier generated by the second database shard independently of the first object identifier generated by the first database shard;

wherein the second database item in the second database shard is accessible by a sharding manager using the first data structure that references the first database item in the first database shard, the sharding manager residing in a gateway server node or is in communication with the gateway server node.

2. The system of claim 1, wherein the stored instructions are further translatable by the processor for:

generating object identifiers that are unique across a cluster of database shards, the cluster of database shards including the first database shard and the second database shard.

3. The system of claim 2, wherein the generating further comprises:

tagging each database shard of the cluster of database shards with a shard identification; and

encoding each of the object identifiers with the shard identification.

4. The system of claim 3, wherein the stored instructions are further translatable by the processor for:

routing a query for an object to a database shard of the cluster of database shards, wherein the routing comprises extracting the shard identification and routing the query using the shard identification.

5. The system of claim 1, wherein the stored instructions are further translatable by the processor for:

receiving a query for an object without any object identifier; and

routing the query to a specific database shard.

6. The system of claim 1, wherein the stored instructions are further translatable by the processor for:

storing a third data structure representing a third split of the relationship in a third database shard.

7. The system of claim 6, wherein the storing the first data structure representing the first split of the relationship in the first database shard, the storing the second data structure representing the second split of the relationship in the second database shard, and the storing the third data structure representing the third split of the relationship in the third database shard are performed in a share operation.

8. A method, comprising:

storing, by a computer having a sharding manager, a first data structure representing a first split of a relationship in a first database shard, wherein the first data structure references a second database item in a second database shard and references a first database item in the first database shard, the first database item having a first object identifier encoded with the shard identifier of the first database shard; and

storing, by the computer, a second data structure representing a second split of the relationship in a second database shard, wherein the second data structure references the first database item in the first database shard and references the second database item in the second database shard, the second database item having a second object identifier encoded with the shard identifier of the second database shard, the second object identifier generated by the second database shard independently of the first object identifier generated by the first database shard;

wherein the second database item in the second database shard is accessible by the sharding manager using the first data structure that references the first database item in the first database shard.

9. The method according to claim 8, further comprising:

generating object identifiers that are unique across a cluster of database shards, the cluster of database shards including the first database shard and the second database shard.

10. The method according to claim 9, wherein the generating further comprises:

tagging each database shard of the cluster of database shards with a shard identification; and

encoding each of the object identifiers with the shard identification.

11. The method according to claim 10, further comprising:

routing a query for an object to a database shard of the cluster of database shards, wherein the routing comprises extracting the shard identification and routing the query using the shard identification.

12. The method according to claim 8, further comprising:

receiving a query for an object without any object identifier; and

routing the query to a specific database shard.

13. The method according to claim 8, further comprising:

storing a third data structure representing a third split of the relationship in a third database shard.

14. The method according to claim 13, wherein the storing the first data structure representing the first split of the relationship in the first database shard, the storing the second data structure representing the second split of the relationship in the second database shard, and the storing the third data structure representing the third split of the relationship in the third database shard are performed in a share operation.

15. A computer program product having a non-transitory computer-readable medium storing instructions translatable by a processor for:

storing a first data structure representing a first split of a relationship in a first database shard, wherein the first data structure references a second database item in a second database shard and references a first database item in the first database shard, the first database item having a first object identifier encoded with the shard identifier of the first database shard; and

storing a second data structure representing a second split of the relationship in a second database shard, wherein the second data structure references the first database item in the first database shard and references the second database item in the second database shard, the second database item having a second object identifier encoded with the shard identifier of the second database shard, the second object identifier generated by the second database shard independently of the first object identifier generated by the first database shard;

wherein the second database item in the second database shard is accessible by a sharding manager using the first data structure that references the first database item in the first database shard, the sharding manager residing in a gateway server node or is in communication with the gateway server node.

16. The computer program product of claim 15, wherein the instructions are further translatable by the processor for:

generating object identifiers that are unique across a cluster of database shards, the cluster of database shards including the first database shard and the second database shard.

17. The computer program product of claim 16, wherein the generating further comprises:

tagging each database shard of the cluster of database shards with a shard identification; and

encoding each of the object identifiers with the shard identification.

18. The computer program product of claim 17, wherein the instructions are further translatable by the processor for:

routing a query for an object to a database shard of the cluster of database shards, wherein the routing comprises extracting the shard identification and routing the query using the shard identification.

19. The computer program product of claim 15, wherein the instructions are further translatable by the processor for:

receiving a query for an object without any object identifier; and

routing the query to a specific database shard.

20. The computer program product of claim 15, wherein the instructions are further translatable by the processor for:

storing a third data structure representing a third split of the relationship in a third database shard, wherein the storing the first data structure representing the first split of the relationship in the first database shard, the storing the second data structure representing the second split of the relationship in the second database shard, and the storing the third data structure representing the third split of the relationship in the third database shard are performed in a share operation.