CN114969612A - Multi-tenant data isolation method, system and computer equipment - Google Patents
Multi-tenant data isolation method, system and computer equipment Download PDFInfo
- Publication number
- CN114969612A CN114969612A CN202210908267.5A CN202210908267A CN114969612A CN 114969612 A CN114969612 A CN 114969612A CN 202210908267 A CN202210908267 A CN 202210908267A CN 114969612 A CN114969612 A CN 114969612A
- Authority
- CN
- China
- Prior art keywords
- tenant
- layer
- sub
- level
- attribute value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9532—Query formulation
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to the technical field of data isolation, and discloses a multi-tenant data isolation method, a multi-tenant data isolation system and computer equipment. By creating a plurality of tenants, each tenant is independent from the other tenants, all tenants share one database, when the database receives the second-level domain name of the tenant from the server cluster, the tenant label can be inquired according to the second-level domain name, and the corresponding website can be searched according to the tenant label, so that the data corresponding to the tenant is displayed in the website, the installation of the database can be reduced, and the maintenance cost is reduced.
Description
Technical Field
The present application relates to the field of data isolation technologies, and in particular, to a method, a system, and a computer device for isolating multi-tenant data.
Background
The multi-tenant technology or multi-lease technology is a software architecture technology, which is a software architecture technology for realizing how to share the same system or program components under a multi-user environment and can ensure the isolation of data among users. In the current cloud computing era, the multi-tenant technology provides services which are the same as or even customizable to a plurality of clients in a single system architecture and services in a shared data center, and can still ensure data isolation of clients. In the prior art, in order to meet business requirements and business processing, a tenant management platform based on a multi-layer parent-child structure tenant is created according to a tenant data isolation technology and a sharing technology, and an independent database is mainly adopted in the existing multi-tenant data storage scheme, namely one tenant and one database, but the installation number of the databases is increased by the method, and accordingly maintenance cost and acquisition cost are increased.
Disclosure of Invention
The application provides a multi-tenant data isolation method, and aims to solve the technical problems that in the prior art, the number of installed databases is large, and the maintenance cost is high.
The application provides a multi-tenant data isolation method, which comprises the following steps:
creating a plurality of tenants, wherein each tenant is independent of each other;
the server cluster acquires a secondary domain name of the tenant and queries a tenant label of the tenant according to the secondary domain name;
and searching a website corresponding to the tenant label in a database according to the tenant label, and displaying data corresponding to the tenant in the website.
Preferably, the step of creating the tenant includes:
creating root tenants, wherein the root tenants create secondary tenants, the secondary tenants at least comprise two secondary tenants, and the secondary tenants respectively create a plurality of tertiary tenants;
and establishing tenant labels for the root tenant, the second-level tenant and the third-level tenant respectively according to the grades of the root tenant, the second-level tenant and the third-level tenant, wherein the root tenant is a parent layer, the second-level tenant is a sub-layer, the third-level tenant is a sub-layer of the second-level tenant, and the second-level tenant is a parent layer of the third-level tenant.
Preferably, when the server cluster wants to query data below a parent layer, numbering tenants corresponding to each sub-layer according to tree traversal;
comparing the numerical values corresponding to the numbers to obtain a hierarchical structure relationship;
acquiring a user label corresponding to a sub-layer tenant according to the hierarchical structure relationship;
and acquiring data corresponding to the user tag according to the user tag.
Preferably, the step of numbering tenants corresponding to each sub-layer according to tree traversal and comparing numerical values corresponding to the numbers to obtain the hierarchical structure relationship includes:
from the parent layer, traversing and visiting each sub-layer twice, and distributing a numerical value to each sub-layer according to the visiting sequence in the two visits;
respectively storing the two values of each sub-layer as a first attribute value and a second attribute value;
dividing the two sub-layers to be compared into a first sub-layer and a second sub-layer, defining a first attribute value of the first sub-layer as a first attribute value of the first sub-layer, defining a second attribute value as a second attribute value of the first sub-layer, defining a first attribute value of the second sub-layer as a first attribute value of the second sub-layer, and defining the second attribute value as a second attribute value of the second sub-layer;
judging whether the first sub-layer first attribute value is smaller than a second sub-layer first attribute value or not and whether the first sub-layer second attribute value is larger than a second sub-layer second attribute value or not;
if the first sub-layer first attribute value is smaller than the second sub-layer first attribute value and the first sub-layer second attribute value is larger than the second sub-layer second attribute value, it is determined that the second sub-layer is a sub-layer of the first sub-layer and the first sub-layer is a parent layer of the second sub-layer.
Preferably, after the step of searching a website corresponding to the tenant label in a database according to the tenant label and displaying the data corresponding to the tenant in the website, the method further includes:
the database generates a user table according to the tenant label and the corresponding tenant;
when the tenant needs to add data, the database queries a tenant label corresponding to the tenant;
and binding the tenant label with the added data to obtain the data carrying the tenant label.
The present application further provides a multi-tenant data isolation system, including:
creating a plurality of tenants, wherein each tenant is independent of each other;
the server cluster acquires a secondary domain name of the tenant and queries a tenant label of the tenant according to the secondary domain name;
and searching a website corresponding to the tenant label in a database according to the tenant label, and displaying data corresponding to the tenant in the website.
Preferably, a root tenant is created, and the root tenant creates secondary tenants, wherein the secondary tenants at least comprise two secondary tenants, and the secondary tenants respectively create a plurality of tertiary tenants;
and establishing tenant labels for the root tenant, the second-level tenant and the third-level tenant respectively according to the grades of the root tenant, the second-level tenant and the third-level tenant, wherein the root tenant is a parent layer, the second-level tenant is a sub-layer, the third-level tenant is a sub-layer of the second-level tenant, and the second-level tenant is a parent layer of the third-level tenant.
Preferably, when the server cluster wants to query data below a parent layer, numbering tenants corresponding to each sub-layer according to tree traversal;
comparing the numerical values corresponding to the numbers to obtain a hierarchical structure relationship;
acquiring a user label corresponding to a sub-layer tenant according to the hierarchical structure relationship;
and acquiring data corresponding to the user tag according to the user tag.
The present application further provides a computer device comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the above-mentioned method.
The beneficial effect of this application does: by creating a plurality of tenants, each tenant is independent from the other tenants, all tenants share one database, when the database receives the second-level domain name of the tenant from the server cluster, the tenant label can be inquired according to the second-level domain name, and the corresponding website can be searched according to the tenant label, so that the data corresponding to the tenant is displayed in the website, the installation of the database can be reduced, and the maintenance cost is reduced.
Drawings
Fig. 1 is a schematic flow chart of a method according to an embodiment of the present application.
Fig. 2 is a schematic diagram of an internal structure of a computer device according to an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
As shown in fig. 1, the present application provides a multi-tenant data isolation method, including:
s1, creating a plurality of tenants, wherein each tenant is independent;
s2, the server cluster acquires the secondary domain name of the tenant and queries the tenant label of the tenant according to the secondary domain name;
s3, according to the tenant label, searching a website corresponding to the tenant label in a database, and displaying data corresponding to the tenant in the website.
As described in the foregoing steps S1-S3, by creating a plurality of tenants, each tenant is independent and isolated from another tenant, and all tenants share one database, when the database receives the secondary domain name of the tenant from the server cluster, the tenant label can be queried according to the secondary domain name, and the corresponding website can be searched according to the tenant label, so that data corresponding to the tenant is displayed in the website, which can reduce installation of the database and reduce maintenance cost.
In one embodiment, the step S1 of creating the tenant includes:
s11, creating root tenants, wherein the root tenants create secondary tenants, the secondary tenants at least comprise two secondary tenants, and the secondary tenants respectively create a plurality of tertiary tenants;
and S12, establishing tenant labels for the root tenant, the second-level tenant and the third-level tenant respectively according to the grades of the root tenant, the second-level tenant and the third-level tenant, wherein the root tenant is a parent layer, the second-level tenant is a child layer, the third-level tenant is a child layer of the second-level tenant, and the second-level tenant is a parent layer of the third-level tenant.
As described in the foregoing steps S11-S12, when a tenant is created, the tenant may be created into three levels (or more) according to the form of a trunk, and a sub-level tenant has data of this level and data of a parent level, and root tenants do not communicate with each other, so that it is ensured that data from one tenant is not leaked to another tenant, and an effect of data isolation can be achieved. In addition, because the parent layer and the sub-layer services are crossed, service processing across tenants (sub-layer and parent layer) can be realized, so that users can move between the tenants of the parent layer and the sub-layer.
In one embodiment, when the server cluster wants to query data below the parent layer,
s41, numbering tenants corresponding to each sub-layer according to tree traversal, and comparing numerical values corresponding to the numbers to obtain a hierarchical structure relationship;
s42, obtaining a user label corresponding to the sub-layer tenant according to the hierarchical structure relationship;
and S43, acquiring data corresponding to the user label according to the user label.
As described in the foregoing steps S41-S43, the tenants have a hierarchical relationship, and if an upper tenant needs to see data of a lower tenant, a nested assembly algorithm can be used to find out a lower related tenant label, so that data corresponding to the lower related tenant label can be queried in the database through the tenant label.
In an embodiment, the step S41 of numbering tenants corresponding to each sub-layer according to tree traversal, and comparing numerical values corresponding to the numbers to obtain a hierarchical structure relationship includes:
s411, from the parent layer, traversing and visiting each sublayer twice, and distributing numerical values to each sublayer according to the visiting sequence in the two visits;
s412, storing the two numerical values of each sub-layer as a first attribute value and a second attribute value respectively;
s413, dividing the two sub-layers to be compared into a first sub-layer and a second sub-layer, and defining a first attribute value of the first sub-layer as a first attribute value of the first sub-layer, a second attribute value as a second attribute value of the first sub-layer, a first attribute value of the second sub-layer as a first attribute value of the second sub-layer, and a second attribute value as a second attribute value of the second sub-layer;
s414, judging whether the first attribute value of the first sublayer is smaller than the first attribute value of the second sublayer, and whether the second attribute value of the first sublayer is larger than the second attribute value of the second sublayer;
s415, if the first sub-layer first attribute value is smaller than the second sub-layer first attribute value, and the first sub-layer second attribute value is greater than the second sub-layer second attribute value, determining that the second sub-layer is a sub-layer of the first sub-layer, and the first sub-layer is a parent layer of the second sub-layer.
As described in the above steps S411-S415, by traversing each sub-layer and assigning a value to each sub-layer, the structural relationship between the hierarchies can be quickly obtained through the numerical values, thereby facilitating the division of the hierarchies between tenants.
In one embodiment, after step S3 of searching a database for a website corresponding to the tenant label according to the tenant label, and displaying data corresponding to the tenant in the website, the method further includes:
s31, the database generates a user table according to the tenant label and the corresponding tenant;
s32, when the tenant needs to add data, the database queries the tenant label corresponding to the tenant;
and S33, binding the tenant label with the added data to obtain the data with the tenant label.
As described in the foregoing steps S31-S33, when new data needs to be stored into the database, the data may be added into the tenant and bound with the tenant label, so that the corresponding data can be conveniently and quickly found according to the tenant label.
The present application further provides a multi-tenant data isolation system, including:
creating a plurality of tenants, wherein each tenant is independent of each other;
the server cluster acquires a secondary domain name of the tenant and queries a tenant label of the tenant according to the secondary domain name;
and searching a website corresponding to the tenant label in a database according to the tenant label, and displaying data corresponding to the tenant in the website.
In one embodiment, a root tenant is created, and the root tenant creates secondary tenants, wherein the secondary tenants at least comprise two secondary tenants, and the secondary tenants respectively create a plurality of tertiary tenants;
and establishing tenant labels for the root tenant, the second-level tenant and the third-level tenant respectively according to the grades of the root tenant, the second-level tenant and the third-level tenant, wherein the root tenant is a parent layer, the second-level tenant is a sub-layer, the third-level tenant is a sub-layer of the second-level tenant, and the second-level tenant is a parent layer of the third-level tenant.
In one embodiment, when the server cluster wants to query data below a parent layer, numbering tenants corresponding to each sub-layer according to tree traversal;
comparing the numerical values corresponding to the numbers to obtain a hierarchical structure relationship;
acquiring a user label corresponding to a sub-layer tenant according to the hierarchical structure relationship;
and acquiring data corresponding to the user tag according to the user tag.
In one embodiment, each sub-layer is visited twice in a traversal mode from the parent layer, and numerical values are distributed to each sub-layer according to the visiting order in the two visits;
respectively storing the two values of each sub-layer as a first attribute value and a second attribute value;
dividing the two sub-layers to be compared into a first sub-layer and a second sub-layer, defining a first attribute value of the first sub-layer as a first attribute value of the first sub-layer, defining a second attribute value as a second attribute value of the first sub-layer, defining a first attribute value of the second sub-layer as a first attribute value of the second sub-layer, and defining the second attribute value as a second attribute value of the second sub-layer;
judging whether the first sub-layer first attribute value is smaller than a second sub-layer first attribute value or not and whether the first sub-layer second attribute value is larger than a second sub-layer second attribute value or not;
if the first sub-layer first attribute value is smaller than the second sub-layer first attribute value and the first sub-layer second attribute value is larger than the second sub-layer second attribute value, it is determined that the second sub-layer is a sub-layer of the first sub-layer and the first sub-layer is a parent layer of the second sub-layer.
In one embodiment, the database generates a user table from the tenant label and the corresponding tenant;
when the tenant needs to add data, the database queries a tenant label corresponding to the tenant;
and binding the tenant label with the added data to obtain the data carrying the tenant label.
As shown in fig. 2, the present application also provides a computer device, which may be a server, and the internal structure of which may be as shown in fig. 2. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer designed processor is used to provide computational and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used for storing all data required by the process of the multi-tenant data isolation method. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program when executed by a processor implements a multi-tenant data isolation method.
It will be understood by those skilled in the art that the structure shown in fig. 2 is only a block diagram of a part of the structure related to the present application, and does not constitute a limitation to the computer device to which the present application is applied.
An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the computer program implements any one of the above-mentioned multi-tenant data isolation methods.
It will be understood by those skilled in the art that all or part of the processes of the methods of the above embodiments may be implemented by hardware associated with instructions of a computer program, which may be stored on a non-volatile computer-readable storage medium, and when executed, may include processes of the above embodiments of the methods. Any reference to memory, storage, database, or other medium provided herein and used in the examples may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double-rate SDRAM (SSRSDRAM), Enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.
Claims (10)
1. A multi-tenant data isolation method, comprising:
creating a plurality of tenants, wherein each tenant is independent of each other;
the server cluster acquires a secondary domain name of the tenant and queries a tenant label of the tenant according to the secondary domain name;
and searching a website corresponding to the tenant label in a database according to the tenant label, and displaying data corresponding to the tenant in the website.
2. The multi-tenant data isolation method of claim 1, wherein the step of creating a tenant comprises:
the method comprises the steps of creating root tenants, wherein the root tenants create secondary tenants, the secondary tenants at least comprise two secondary tenants, and the secondary tenants respectively create a plurality of tertiary tenants;
and establishing tenant labels for the root tenant, the second-level tenant and the third-level tenant respectively according to the grades of the root tenant, the second-level tenant and the third-level tenant, wherein the root tenant is a parent layer, the second-level tenant is a sub-layer, the third-level tenant is a sub-layer of the second-level tenant, and the second-level tenant is a parent layer of the third-level tenant.
3. The multi-tenant data isolation method according to claim 2, wherein when the server cluster wants to query data below a parent level, the tenants corresponding to each sub-level are numbered according to tree traversal;
comparing the numerical values corresponding to the numbers to obtain a hierarchical structure relationship;
acquiring a user label corresponding to a sub-layer tenant according to the hierarchical structure relationship;
and acquiring data corresponding to the user tag according to the user tag.
4. The method according to claim 3, wherein the step of numbering tenants corresponding to each sub-layer according to tree traversal and comparing numerical values corresponding to the numbering to obtain the hierarchical relationship comprises:
from the parent layer, traversing and visiting each sub-layer twice, and distributing a numerical value to each sub-layer according to the visiting sequence in the two visits;
respectively storing the two values of each sub-layer as a first attribute value and a second attribute value;
dividing the two sub-layers to be compared into a first sub-layer and a second sub-layer, defining a first attribute value of the first sub-layer as a first attribute value of the first sub-layer, defining a second attribute value as a second attribute value of the first sub-layer, defining a first attribute value of the second sub-layer as a first attribute value of the second sub-layer, and defining the second attribute value as a second attribute value of the second sub-layer;
judging whether the first sub-layer first attribute value is smaller than a second sub-layer first attribute value or not and whether the first sub-layer second attribute value is larger than a second sub-layer second attribute value or not;
if the first sub-layer first attribute value is smaller than the second sub-layer first attribute value and the first sub-layer second attribute value is larger than the second sub-layer second attribute value, it is determined that the second sub-layer is a sub-layer of the first sub-layer and the first sub-layer is a parent layer of the second sub-layer.
5. The method of claim 1, wherein after the step of searching a database for a website corresponding to the tenant label according to the tenant label and displaying the data corresponding to the tenant on the website, the method further comprises:
the database generates a user table according to the tenant label and the corresponding tenant;
when the tenant needs to add data, the database queries a tenant label corresponding to the tenant;
and binding the tenant label with the added data to obtain the data carrying the tenant label.
6. A multi-tenant data isolation system, comprising:
creating a plurality of tenants, wherein each tenant is independent of each other;
the server cluster acquires a secondary domain name of the tenant and queries a tenant label of the tenant according to the secondary domain name;
and searching a website corresponding to the tenant label in a database according to the tenant label, and displaying data corresponding to the tenant in the website.
7. The multi-tenant data isolation system of claim 6, wherein a root tenant is created, the root tenant creates secondary tenants, wherein the secondary tenants include at least two, and the secondary tenants respectively create a plurality of tertiary tenants;
and establishing tenant labels for the root tenant, the second-level tenant and the third-level tenant respectively according to the grades of the root tenant, the second-level tenant and the third-level tenant, wherein the root tenant is a parent layer, the second-level tenant is a sub-layer, the third-level tenant is a sub-layer of the second-level tenant, and the second-level tenant is a parent layer of the third-level tenant.
8. The multi-tenant data isolation system of claim 7, wherein when the server cluster wants to query data below a parent level, the tenants corresponding to each sub-level are numbered according to tree traversal;
comparing the numerical values corresponding to the numbers to obtain a hierarchical structure relationship;
acquiring a user label corresponding to a sub-layer tenant according to the hierarchical structure relationship;
and acquiring data corresponding to the user tag according to the user tag.
9. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 5 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210908267.5A CN114969612A (en) | 2022-07-29 | 2022-07-29 | Multi-tenant data isolation method, system and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210908267.5A CN114969612A (en) | 2022-07-29 | 2022-07-29 | Multi-tenant data isolation method, system and computer equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114969612A true CN114969612A (en) | 2022-08-30 |
Family
ID=82969924
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210908267.5A Pending CN114969612A (en) | 2022-07-29 | 2022-07-29 | Multi-tenant data isolation method, system and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114969612A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116010431A (en) * | 2023-03-27 | 2023-04-25 | 北京有生博大软件股份有限公司 | Data element management method and management system based on multi-tenant mode |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108038390A (en) * | 2017-12-09 | 2018-05-15 | 珠海横琴小可乐信息技术有限公司 | A kind of software, that is, service platform tenant data isolation and shared method and system |
| CN110188307A (en) * | 2019-05-31 | 2019-08-30 | 东信和平科技股份有限公司 | A kind of multi-tenant data partition method, server and system |
| CN111694682A (en) * | 2020-06-11 | 2020-09-22 | 深圳市铱云云计算有限公司 | Management method, device, equipment and storage medium for multi-level tenants |
| CN114760134A (en) * | 2022-04-18 | 2022-07-15 | 成都星云智联科技有限公司 | Multi-tenant isolation method and related device |
-
2022
- 2022-07-29 CN CN202210908267.5A patent/CN114969612A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108038390A (en) * | 2017-12-09 | 2018-05-15 | 珠海横琴小可乐信息技术有限公司 | A kind of software, that is, service platform tenant data isolation and shared method and system |
| CN110188307A (en) * | 2019-05-31 | 2019-08-30 | 东信和平科技股份有限公司 | A kind of multi-tenant data partition method, server and system |
| CN111694682A (en) * | 2020-06-11 | 2020-09-22 | 深圳市铱云云计算有限公司 | Management method, device, equipment and storage medium for multi-level tenants |
| CN114760134A (en) * | 2022-04-18 | 2022-07-15 | 成都星云智联科技有限公司 | Multi-tenant isolation method and related device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116010431A (en) * | 2023-03-27 | 2023-04-25 | 北京有生博大软件股份有限公司 | Data element management method and management system based on multi-tenant mode |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7290131B2 (en) | Guaranteeing hypertext link integrity | |
| US20070050331A1 (en) | Priority based LDAP service publication mechanism | |
| US7593951B2 (en) | Application programming interface for centralized storage of principal data | |
| CN103577483B (en) | The method and system of date storage method and system and data access | |
| CN104462429B (en) | The generation method and device of query sentence of database | |
| US20080133533A1 (en) | Migrating Credentials to Unified Identity Management Systems | |
| US20040078391A1 (en) | Extending role scope in a directory server system | |
| CN114969612A (en) | Multi-tenant data isolation method, system and computer equipment | |
| CN105843867A (en) | Metadata model-based search method and search device based on metadata model | |
| CN107491463B (en) | Optimization method and system for data query | |
| CN105808702A (en) | Page content refreshing method and system, and page content synchronous refreshing management system | |
| CN111680041A (en) | Safe and efficient access method for heterogeneous data | |
| CN105005567B (en) | Interest point query method and system | |
| JP2002149468A (en) | Method for managing access right of multi-database integrated system | |
| US8156091B2 (en) | Method to retain an inherent and indelible item value in a relational database management system | |
| US7308676B2 (en) | Generic layer for virtual object resolution | |
| CN112261090B (en) | Web data processing method and device, computer equipment and readable storage medium | |
| CN110399530A (en) | Data matching method, device and computer equipment | |
| CN116680278A (en) | Data processing method, device, electronic equipment and storage medium | |
| CN104850386A (en) | Software system internationalization resource processing method | |
| EP1569132B1 (en) | Computer system and method of performing a database access | |
| CN113742369B (en) | Data authority management method, system and storage medium | |
| CN114610973A (en) | Information search matching method and device, computer equipment and storage medium | |
| Hicks et al. | Using Meta-data to Support Customization. | |
| CN114185883A (en) | Data monitoring method, device and equipment of data warehouse and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220830 |
|
| RJ01 | Rejection of invention patent application after publication |