50results about How to "Reduce I/O operations" patented technology

Embodiments of the invention disclose a data processing method and apparatus. The method comprises the steps of obtaining multiple pieces of to-be-processed data; defining the to-be-processed data in a plurality of preset intervals; determining approximate values of the to-be-processed data in the intervals; and according to the approximate values, determining quantiles corresponding to the to-be-processed data. By utilizing the method and the apparatus, the approximate values are used for replacing the numerical values of the to-be-processed data defined in any interval, so that the quantity of data participating in a calculation process can be reduced. Therefore, the traversal frequency during quantile calculation can be reduced; the I / O operation on a database can be further reduced; and the efficiency of the quantile calculation process can be improved to a certain extent.

The invention discloses an LTE base station big data mining method and device based on memory-mapped files. The method comprises the steps of creating one memory-mapped file F1 for all base stations to store current period original counter information; storing original counter in F1 according to a predefined data structure M; creating a memory-mapped file F2 and copying original counter data in F1 into F2 when it is time for current period integrality statistics; ranking all M structures in F2, reading and comparing all M structures in F2, conducting count counting on the comparison result, and then calculating the integrality of the current index. By the adoption of the method and device, files stored on magnetic discs are processed with the memory-mapped files, I / O operation on files is reduced, original counter integrality calculation efficiency is improved, and platform memory consumption, expansion difficulty and corresponding cost are reduced.

The invention provides a method for dynamically updating the constant values of an application server. The method comprises the steps of: reading and analyzing constant files in a hard disk, and storing data in the constant files into a memory in a key-value mode, wherein the key represents a constant object, and the value represents a constant value; scanning the constant files in the hard disk, judging whether the constant files are changed or not, and if changed, reading the changed constant files; analyzing according to the key-value mode so as to obtain the changed constant objects and constant values; searching all the original constant values, which correspond to the changed constant objects, from the memory according to the changed constant objects; and clearing all the researched original constant values which correspond to the changed constant objects from the memory, and loading the changed constant values into the memory to replace the original constant values. The invention further provides a system for dynamically updating the constant values of the application server. By utilizing the method and the system for dynamically updating the constant values of the application server, the constant values of the application server can be updated in real time.

The embodiment of the present invention provides a data interaction method and device. The method includes: if a data export instruction is received, searching for the mapping relationship with the relational database management system RDBMS in the target hard disk area by retrieving multiple mapping relationships recorded in the mapping list. The first internal file corresponding to the first external table in ; export the first internal file to the distributed file system HDFS; if a data import instruction is received, then determine the target hard disk by retrieving multiple mapping relationships recorded in the mapping table Whether there is already a second internal file to be imported from HDFS in the area; if not, import the second internal file into the target hard disk area, and generate a second external table in the RDBMS; establish a second external table in the mapping list The mapping relationship between the table and the second internal file. The invention effectively reduces the input / output operation of the RDBMS on the disk where the database table is located, thereby effectively ensuring the original business resources of the RDBMS and improving the processing efficiency and resource utilization of the RDBMS.

The invention discloses a method and system for transmitting packaged files based on a cloud computing environment. The method receives a command to transfer folders; obtains the file types and file sizes of all files in the folder; divides all files into files suitable for packaging and files unsuitable for packaging according to the file types; The files suitable for packaging are put into the packaging queue, and the files whose file size is smaller than the file threshold among the files that are not suitable for packaging are put into the packaging queue; among the files that are not suitable for packaging, the files whose file size is greater than or equal to the file threshold performing transmission; compressing and packaging the files in the packaging queue, and transmitting the packaged files formed after packaging. It greatly shortens the transfer time of the entire folder, improves the file transfer efficiency, and also reduces the I / O operations during the file transfer process, which can greatly improve the data throughput rate and service efficiency of the data center, and increase the service life of the server.

The invention discloses a key value storage method based on a log-structured merged tree. The method comprises: 1, setting a cache component in a memory for each data storage component, setting a Bloom filter for each cache component, and setting a Bloom filter for each data block of each SSTable; 2, carrying out jump judgment on each key value pair of current data blocks of to-be-merged data storage components Ci stage by stage by adopting the corresponding Bloom filter, wherein if the key value pair jumps to a C<i+M>, no version of key value pair corresponding to keys exists in the C<i+M> and each stage of component in the front of the C<i+M>, a B<i+M+1> comprises a corresponding version of key value pair and then the key value pair is set into a B<i+M>, and if the key value pair is jumped to a B<i+N>, no version of key value pair corresponding to keys in the B<i+N> and each stage of component in the front of the B<i+N> and a C<i+N> comprises a corresponding version of key value pairs; and 3, processing the to-be-merged key value pairs in the Bi by adopting a similarity method.