Research On Data Storage And Search Algorithm Of Sensor Network Base Station

With the popularity of sensor application, it is a trend that every sensor link to another one to make a sensor network. Because the type of sensor is different, the type of sensor network and the application of sensor network are also different. But no matter what type of sensor network is, data storage is very important. Data storage is divided into local storage and central storage, but the data will eventually flow to the base station. The storage of data in sensor network is a very important aspect, as the scale of data in sensor network is very large, so the quick search of data is also the basic requirement in sensor network.Nowadays, the storage of data uses the relational database as its storage warehouse. Relational database is a database based on the relational model, using set algebra and other mathematical concepts and methods to deal with data in the database. Various entities and links between entities are represented by a rational model. In relational database, the storage of data will generate a certain index, which makes the search more quickly. The index of relational database is divided into two kinds: one is aggregate index, the other is non-aggregation index. This paper uses MySQL database as an example to analyze the principle and features of relational database.This paper analyzes the commonly used database in today’s relational database, analyzes the reason of slow storage, low efficient search of this traditional database. Because of the defect of traditional database, this paper puts forward multi-buffer parallel storage technology to realize quick and reliable data storage, and puts forward two- level hash location algorithm to realize quick search of sensor node data. The results show that the algorithm in this paper greatly improved the efficiency of data storage and search compared with the traditional relational database.