Server and database access method

Abstract

The invention provides a server and a database access method. The server comprises a receiving module, an access rule routing module, a semantic translation module and a connection protocol fitting module. The receiving module is used for receiving a first access statement; the access rule routing module is used for acquiring a first operating command and data-table identification information both carried in the first access statement, and judging whether or not data in a data table corresponding to the identification information is extracted into a non-relational database when the first operating command is an operation capable of being performed by the non-relational database; the semantic translation module is used for determining the non-relational database as a target non-relational database and translating the first operating command into a second operating command capable of being analyzed by the target non-relational database when the data in the data table corresponding to the identification information is extracted into the non-relational database is judged; the connection protocol fitting module is used for sending the second operating command and the data-table identification information to the target non-relational database. According to the server and the database access method, requirements on high-concurrency database read-write and the like are met by the non-relational database.

Description

Technical field [0001] The invention relates to database technology, in particular to a server and a database access method. Background technique [0002] With the rise of web 2.0 websites on the Internet, the data query requirements for super-large-scale and highly concurrent social network services (Social Networking Services, SNS) type web 2.0 purely dynamic websites have also increased accordingly. [0003] A relational database is a database based on a relational model. It uses Structured Query Language (SQL) to perform retrieval and operation of data in the relational database. Tables in relational databases store some formatted data structures. The composition of each tuple field is the same. Even if not every tuple requires all fields, the database will assign all fields to each tuple. This structure can facilitate operations such as connection between tables, but it limits the performance of relational databases. The relational database used in the prior art can no longe...

AI Technical Summary

Problems solved by technology

[0004] Operations on the database include query operations and non-query operations. Since non-relational databases are mainly suitable for query operations, non-relational databases cannot completely replace the functions of relational databases. However, access to relational databases requires the use of structure Access to non-relational databases requires the use of non-relational query languages. Therefore, it is necessary to consider how to meet high concurrent read and write, efficient storage and access to massive data, and high scalability while maintaining existing relational databases. and high availability requirements

Images