Search

In order to gain high response speed, the paper presents a hybrid Timesten and Oracle database structure. First, the paper creates concepts of real-time database and historical database. It also points out their relationships. Second, it builds a hardware structure which involves an application server, a Timesten database server and an Oracle database server. The structure adopts uninterruptible power supply for data reliability. Last, it presents a software structure of databases. The Timesten acts as the real-time database and the Oracle acts as the historical database. There is a layer in front of the Timesten for data acquiring and an agent layer between the Timesten and the Oracle for data transmission. Experiment shows that the Timesten is about 6.69 times faster than the Oracle disk database.

Database systems are widely used in many fields. As the scale of database systems increases, more firms decide to deploy the database system in a distributed environment for the sake of data integrity fault tolerance. For guaranteeing the consistency of data, database management systems adopt isolation policies. This paper discusses probabilistic models for snapshot isolation of database management system. Snapshot isolation is an effective method to enhance the consistency of database system, although it degrades the system performance where the system has large network latency such as distributed database system. Also, under the failure-prone environment, a restart scheme is considered as one countermeasure. This paper proposes probabilistic models for the dynamics of snapshot isolation of database system and exhibits the optimization of system performance with respect to updating interval of snapshot isolation within the failure-prone environment from the analytical point of view. Numerical experiments are conducted to validate the effectiveness of analytical results by using real traffic data.

Testing database applications typically requires the generation of tests consisting of both program inputs and database states. Recently, a testing technique called Dynamic Symbolic Execution (DSE) has been proposed to reduce manual effort in test generation for software applications. However, applying DSE to generate tests for database applications faces various technical challenges. For example, the database application under test needs to physically connect to the associated database, which may not be available for various reasons. The program inputs whose values are used to form the executed queries are not treated symbolically, posing difficulties for generating valid database states or appropriate database states for achieving high coverage of query-result-manipulation code. To address these challenges, in this article, we propose an approach called SynDB that synthesizes new database interactions to replace the original ones from the database application under test. In this way, we bridge various constraints within a database application: query-construction constraints, query constraints, database schema constraints, and query-result-manipulation constraints. We then apply a state-of-the-art DSE engine called Pex for .NET from Microsoft Research to generate both program inputs and database states. The evaluation results show that tests generated by our approach can achieve higher code coverage than existing test generation approaches for database applications.

According to the ternary number data mining algorithm, this paper combines SQL program operation and Oracle 10 g database system together. And then, numerical modeling and meshing technique are adopted to abstract data parameter from the database system. In addition,a mathematical model is established to abstract information from the ternary number database and the information literacy algorithm is also designed. In order to verify the reliability of the mathematical model and algorithm, a database abstracting numerical simulation experiment is designed for the velocity and temperature parameter. Through the experiment, it is discovered that there does not exist residual shock in the ternary number method when the data is being abstracted, which has a relatively stable convergence. At the same time, this paper gains the speed data distribution vector diagram. Eventually, the reliability of the algorithm designed in this paper is verified by comparing temperature data and the experimental data.

In this paper we introduce cross tree and block mathematical principles into the design of database system, divide the time sequence and storage space of computer database system, establish the mathematical model and algorithm of computer resources database system, and design the test database system. In this paper, we use high performance interface of Display Port, by way of coupling to communicate on two port control, and use RHEL 6.2 Linux virtual machine to do simulation experiment on process of database system. Through the simulation we find the API which is called by Read, Close, Mmap, Stat, Fstat is similar. It is consistent with the actual situation, and verifies the reliability of the program. Finally, we apply the database system to the network database construction of sports literature resources in the new town of Poyang Lake area. It reaches the effect that sport resources are shared by all. It provides technical support for the application of computer database system.

Sensitive data in database should be encrypted to protect it from malicious access. Do this in application is hard and costly. Utilizing the user-defined function technology supported by database management system, data encryption could be done separately and transparently for application. The principle and system architecture of encrypting database content with user-defined function is introduced, and the method handling long object encrypting is discussed specially. Experiments show that the proposed method is easy to implement, effective in system running and application development, and applicable for both new developing and old developed application.

Recently, a distribution management system (DMS) that can conduct periodical system analysis and control by mounting various applications programs has been actively developed. In this paper, we summarize the development and demonstration of a database structure that can perform real-time system analysis and control of the Korean smart distribution management system (KSDMS). The developed database structure consists of a common information model (CIM)-based off-line database (DB), a physical DB (PDB) for DB establishment of the operating server, a real-time DB (RTDB) for real-time server operation and remote terminal unit data interconnection, and an application common model (ACM) DB for running application programs. The ACM DB for real-time system analysis and control of the application programs was developed by using a parallel table structure and a link list model, thereby providing fast input and output as well as high execution speed of application programs. Furthermore, the ACM DB was configured with hierarchical and non-hierarchical data models to reflect the system models that increase the DB size and operation speed through the reduction of the system, of which elements were unnecessary for analysis and control. The proposed database model was implemented and tested at the Gochaing and Jeju offices using a real system. Through data measurement of the remote terminal units, and through the operation and control of the application programs using the measurement, the performance, speed, and integrity of the proposed database model were validated, thereby demonstrating that this model can be applied to real systems.

Database management systems provide a mechanism that enables software application systems to manipulate data from a database. Although object-oriented technology is widely used in the development of software systems, relational database management systems remain the dominant database technology. Database modeling enables software developers to design the database during the system analysis and design phase; however, most approaches focus only on designing database schemas, without considering models for the retrieval of data. A comprehensive database model would provide a solid base on which software developers could organize data for storage and retrieval. Unified modeling language (UML) is a gene ral purpose modeling notation and this paper proposes a UML profile for modeling database retrieval to overcome the inadequacie s found in current methods. The proposed model provides views of the database outlining query operations to enable the automatic generation of more comprehensive code in the model-driven development of enterprise information systems. We include examples to demonstrate the feasibility of the proposed method and its advantages over existing database modeling methods.

The authors updated their 2009 article on the MLA International Bibliography (MLAIB) by comparing it across three vendor platforms to determine if seemingly comparable searches continued to produce varying results. As much as possible, the authors tested the same searches as were tested in the original article and added additional ones for further exploration. Findings illustrate that while there are fewer differences than was the case previously, differences still exist. The authors also investigated discovery services to identify factors affecting MLAIB searches. The authors discuss the impact of their findings on users, from undergraduates to faculty researchers.

database is a collection of data of different types, while DBMS is a set of specifications that tells how data is to be stored in a database and how data should be accessed by the components of the database. The data and the metadata when exposed to the outside world may endanger the security of the DBMS. Therefore precautions should be taken that the data should be available to the right user at any point of time. In this study the architecture of the database is understood and tried to identify the vulnerabilities and threats related to them. Also it is noticed that if the architecture of the database is secured it would provide secure data management system. Different security methods implemented for different scenarios are discussed in this paper. With the help of these tools, a proposal for the security at the application level (View level) of the database architecture is suggested.

Many legacy applications rely on a single instance relational database. In the age of big data, applications with growing popularity may continue to generate large amount of data. The data would be beyond the limit of a traditional relational database. These applications can be migrated to a distributed database system for acquiring high scalability and performance. But the migration process is complicated especially for user defined stored procedure. In order to obtain the correct behavior, a stored procedure usually has to be rewritten in the application code. This rewriting is usually a time consuming and unpleasant task. This study gives a mechanism for migrating stored procedure from single instance relational database to distributed sharded database without the need of application code rewriting. In the migration solution offered by this study, Oracle stored procedure code is parsed, analyzed, and translated so as to be stored and executed globally in a sharded database.

Wireless embedded database system is more complex and flexible than conventional computing environment. Embedded database computing platform requires more technologies such as asymmetric mobility, instability connected topology diversity, network communications, highly scalable systems, low reliability. This paper described the design and development process of embedded database, analyzed the database indexes, data storage and lexical analyzer. It supports CAPI interfaces and standard SQL subset, also supports ODBC or JDBC and bi-directional data exchange, and has a two-way flow of data between the central database and the embedded database.

The rapid development of internet technology has increased the need of data storage and processing technology application. One application is to manage academic data records at educational institutions. Along with massive growth of information, decrement in the traditional database performance is inevitable. Hence, there are many companies choose to migrate to NoSQL, a technology that is able to overcome the traditional database shortcomings. However, the existing SQL to NoSQL migration tools have not been able to represent SQL data relations in NoSQL without limiting query performance. In this paper, a relational database transformation system transforming MySQL into non-relational database MongoDB was developed, using the Multiple Nested Schema method for academic databases. The development began with a transformation scheme design. The transformation scheme was then implemented in the migration process, using PDI/Kettle. The testing was carried out on three aspects, namely query response time, data integrity, and storage requirements. The test results showed that the developed system successfully represented the relationship of SQL data in NoSQL, provided complex query performance 13.32 times faster in the migration database, basic query performance involving SQL transaction tables 28.6 times faster on migration results, and basic performance Queries without involving SQL transaction tables were 3.91 times faster in the migration source. This shows that the theory of the Multiple Nested Schema method, aiming to overcome the poor performance of queries involving many JOIN operations, is proved. In addition, the system is also proven to be able to maintain data integrity in all tested queries. The space performance test results indicated that the migrated database transformed using the Multiple Nested Schema method showed a storage requirement of 10.53 times larger than the migration source database. This is due to the large amount of data redundancy resulting from the transformation process. However, at present, storage performance is not a top priority in data processing technology, so large storage requirements are a consequence of obtaining efficient query performance, which is still considered as the first priority in data processing technology.

The ADO.NET is a brand-new data access technique of the Microsoft. It is the bridge of the .NET application and database communication, which use the XML to exchange data, and add many new program interface to access simply database. This paper introduce the structure, feature and inner object of the ADO.NET, and analysis database access technique of the ADO.NET, give the method of the ADO.NET connection various kinds of database. Finally, an example of the C# connection SQLSEVER database is enumerated, and the detailed implementation code is given.

Information about periodic processing of database operations has a pivotal importance for continuous physical database design and automated performance tuning of database systems. This work shows how to detect the oscillations of database workloads caused by the periodical invocations of user applications. In particular, we present an algorithm for discovering periodic patterns in the histories of processing of complex and elementary database operations. In our approach, information collected from the database audit trails is transformed into a sequence of syntax trees and later on it is compressed in a syntax tree table. The periodic patterns are discovered through nested iterations over a four dimensional space of syntax trees and positional parameters of the patterns. Transformations of the patterns are used to discover the overlaping periodic patterns.

The use of diverse database technology in enterprise today can not be avoided. Thus, technology is needed to generate information in real time. The purpose of this research is to discuss a database replication technology that can be applied in heterogeneous database environments. In this study we use Windows-basedMS SQL Server database to Linux-based Oracle database as the goal. The research method used is prototyping where development can be done quickly and testing of working models of the interaction process is done through repeated. From this research it is obtained that the database replication technolgy using Oracle Golden Gate can be applied in heterogeneous environments in real time as well.

Specialized processing units such as GPUs or FPGAs provide great opportunities to speed up database operations by exploiting parallelism and relieving the CPU. However, distributing a workload on suitable (co-)processors is a challenging task, because of the heterogeneous nature of a hybrid processor/co-processor system. In this paper, we present a framework that automatically learns and adapts execution models for arbitrary algorithms on any (co-)processor. Our physical optimizer uses the execution models to distribute a workload of database operators on available (co-)processing devices. We demonstrate its applicability for two common use cases in modern database systems. Additionally, we contribute an overview of GPU-co-processing approaches, an in-depth discussion of our framework's operator model, the required steps for deploying our framework in practice and the support of complex operators requiring multi-dimensional learning strategies.

A new format for the HITRAN database is proposed. By storing the line-transition data in a number of linked tables described by a relational database schema, it is possible to overcome the limitations of the existing format, which have become increasingly apparent over the last few years as new and more varied data are being used by radiative-transfer models. Although the database in the new format can be searched using the well-established Structured Query Language (SQL), a web service, HITRANonline, has been deployed to allow users to make most common queries of the database using a graphical user interface in a web page. The advantages of the relational form of the database to ensuring data integrity and consistency are explored, and the compatibility of the online interface with the emerging standards of the Virtual Atomic and Molecular Data Centre (VAMDC) project is discussed. In particular, the ability to access HITRAN data using a standard query language from other websites, command line tools and from within computer programs is described.

Research and analyze the mobile terminal remote accessing to the database interfaces and methods. On this basis, proposed a middleware forms based on Object Relational mapping. The middleware achieves mobile terminals remote accessing the database and managements of mobile terminals to connect to the database and access mechanisms. This paper adopts the methods that mobile terminals remotely access to database based on ORM and it defines ORM rules that the mobile terminal remotely accesses to the database. It designs and proposes new approaches for mobile terminals and database transmission of information and management. The method achieves visualization of the database interface.

A database framework was constructed with the purpose of creating a restoration decision management tool by compiling oil and gas pad reclamation data to identify successful restoration practices. Pre-existing data were secured from public and private databases from two Wyoming production fields in the Greater Green River Basin: Jonah Infill and Moxa Arch. The framework includes tables for measurements of reclamation practices (e.g., soil handling methods and amendments, seeding mix and timing, and weed management), geographical and climate data (e.g., precipitation, slope, aspect, elevation, and temperature) and monitoring data (e.g., vegetation composition and structure along with soil analysis and grazing). Microsoft Access and ESRI ArcGIS were employed to build the reclamation database for consistent and reliable data storage, manipulation, and retrieval. Short-term goals of the project were to quantify disturbance and reclamation efforts and to evaluate the reclamation status of individual well pads. Long-term goals of the project are to deliver: (1) an operational framework to analyze and isolate trends leading to reclamation success and failure, (2) a strong decision management tool for limiting uncertainty and estimating associated risk under variable environmental conditions, (3) to evaluate regulatory standards for reclamation, and (4) to offer a flexible and sharable database that allows for additional data input from diverse sources. Database performance was found to be dependent on data consistency and validity. Querying populated data along with uniting imported data has revealed multiple strengths and weaknesses with the database framework. Additional

Using the geophysical field data matching navigation could improve the concealment of the underwater vehicle, and it is also an important navigation technology in the future. Using the database to save the navigation data not only could overcome the drawbacks when using the files to storage the data but also integrated the different database together. The QNX Database is used to be the database management system (DBMS) of the INS/Database matching navigation system. According to the needs of the INS/Database matching navigation system and the relationship of the geophysical field data, the structure of geophysical field data database is designed and implemented. The result shows that the DBMS has well real-time performance, reliability and scalability. It meets the requirements of the DBMS.

This paper compares different levels of database normalization process in terms of anomalies removal and storage reduction. Several databases have been normalized up to Third Normal Form (1NF, 2NF and 3NF) in order to investigate the influence of the normalization on the database performance. They are implemented separately with different database systems such as MS Access, SQL Server and Oracle. The percentage of storage reduction and data anomalies are investigated for every normal form and database system. The results show that the data storage is significantly reduced over unnormalized database, approximately between 20 to 30% for 1NF flattening tables and 1NF decomposing table, and between (15% - 22%) and (9% - 22%) for 2NF and 3NF, respectively. The removal of the majority of anomalies is observed in the first normal form while fewer anomalies are removed in the next higher normal forms. For the same database implemented, the comparison between three different database systems shows approximately the same results with slight differences. These differences may be due to the nature, the size of the constraints and metadata on each database system.

Realization of big Deep Web database optimized access with low sample deviation was researched. With the sharp increasing of the storage of Deep Web database geometrically, the problem of optimized access to the database was becoming difficult. On the basis of correlation feature rule extraction, an improved optimized access method for the Deep Web database was proposed based on Graph Model Sample process and correlation rule. The access was realized by computer simulation. The access process was started with the arbitrary effective result as the access starting line. The access result was returned, and the records were obtained in the returned web page. The next query and access was implemented with the local sample database for the nest access start line. The method avoided the effects of the query interface properties. And the Graph Model Sample method could overcome the limitation of the query interface properties. Also the correlation feature extraction algorithm was researched, and it was used as the access rule in the database for the realization of optimized and efficient query. The simulation result shows that the sample deviation is stable with the value about 10% for the simulated Deep Web database. The relevant sample deviation value is trended to convergence and is near to the real value with the increasing of the access number. According to the realistic Web database, the sample bias estimation mean value is about 21% which is higher than the simulated database. Two typical Deep Web databases are taken as the researching objects, with the new method, and the access bias is lower than another Web database which without using the proposed method, result shows nice performance of the proposed optimized database access method in application.

The convenient living is created by IT industry, on the other hand industries are from human production transform robotics automation. In the future, robots not only possess manufacturing functions but also have service property. However, if the interaction that robots with service property just only be entered with a single, it has limited functionality. The purpose of this study is investigating the conception of database into robots, load data from database and save processed data into database, it will lessen wrongs and improve speed of response. In this study, will be compared two programs, one is the input and output processing by program, the order one is add database with function of save and load. Result of the comparison apply to processing mode of robot. The experimental results show that use database model can upgrade speed and accuracy that stream transmit, it will provide more convenient automated service contribution.

The data synchronous of the distributed heterogeneous database was one of the important researches for the heterogeneous databases. This paper analyzed the data synchronization optimization mechanism of the distributed heterogeneous database and puts forward to get the minimum change data set from each node database and then get the system total change data set, and then find out each node database of minimal update data set to update each node database, so as to realize the synchronization of heterogeneous database.

This paper analyzed on real-time database system, and applied the cloud manufacturing technology and distributed system technology to the database system model. Through the analysis on the real time database, we can got the distributed real-time data system types and data storage model, establish two kinds of memory T-mode and S-mode, database storage model and make the production of block. Finally establish the work flow of distributed real-time database system, get relevant application program. A large number of real-time data collection and administration can be realized, which can improve the real-time information data processing efficiency and system model performance. Through the establishment of model and analysis of its working process in the real-time distributed system real time database application path, it can provide guidance for the establishment of distributed real-time database system model.

In recent years, the development of application programs for distribution system analysis and control has been essential part for distribution management system (DMS). In this paper, we propose the common database for application programs of distribution management system. The proposed database model has several characteristics as followings. First, the proposed database model is designed for the common use of almost the whole distribution application software. The static equipment model and dynamic type tables are mixed and the parallel table structure is applied. Second, the linked list structure of database are used for the fast processing of applications. The database model includes the hierarchy and non-hierarchy distribution system structure. Third, the reduction method of distribution database is applied. For this, we present the network reduction rules. The basic concept of reduction rules are the electrical unification of successive line section which has not lateral branches and the removal of simple lateral branches which has no devices and other laterals. Proposed database model is tested for the Jeju system of Korea Electric Power Corporation (KEPCO). Through the test, we verified that the proposed database structure can be effectively used to accomplish the distribution system operation.

In order to make the real time database more suitable for the computing features in power system, this paper will study the design and architecture of distributed and parallel real-time database. A mapping table from table file to machine nodes is established, and meta-data management system is used to store and manage the mapping table to meet the characteristics of high concurrent access. The whole network computation can access the unified interface provided by the real-time database. The data is retrieved and collected through each node. Experimental results show that the systems designed can meet the computing requirements of a unified whole network.

Nowadays, a variety of database systems coexist and the application softwares access and operation for database is often custom-written, which can lead to more complicated cross-database access. Through analysis of the operational process of the database middleware, adding the generic database query middleware eQueryMW which can shield the difference of the data source to the traditional three-tier architecture as the middleware level can realize the access of relational heterogeneity database, providing a unified database query interface and cross-database integration method for the users.

In this paper we introduce a kind of management mechanism for computer immune system GECISM (GEneral Computer Immune System Model)[. With it when emergency happens it can be timely and actively response according to the current state of database. Thus it improved the executive efficiency of the computer immune system. The method is that we design the local rules in the form of active database. It neednt user intervention for the processes to be handled by the processor. The database of the client machine can automatically carry out the judgment of "self" and "non-self". So it can improve the system's processing capability.

In order to make the real time database more suitable for the computing features, this article points to the distributed and parallel real time database design and architecture. First, a mapping table from table file to machine nodes is established, and then can use meta-data management system to store and manage the mapping table to meet the characteristics of high concurrent access. The whole network computation can access the unified interface provided by the real-time database, retrive data from each node, then collect the data. Experimental results show that this study and the systems designed can meet the computing requirements of a unified whole network.

This paper mainly introduces the design idea of real-time database in embedded configuration software. According to the characteristics of real-time database, this paper using three layer storage structures which consist of shared memory, file system and general database. It improves the access efficiency of real-time database and data reliability in a timely manner.

The data management of urban and rural planning is very important and special. It is quite necessary to customize a thematic database system for urban and rural planning. According to their characteristics and classifications, the requirements of this system are firstly analyzed in this paper. With the integration of traditional relation database management system and geographical information system, an extendable data model for this thematic database is proposed. In this model, Client/Server architecture is adopted, Oracle is extended to store both attribute data and spatial data, and spatial database engine is utilized to access the spatial data in Oracle. At the client side, some functional modules such as data import and export, browse and display, query and retrieval, update and maintain, and security management are designed and developed. Finally, a case study of the thematic database system is applied. It is concluded that the customized spatial database management system for urban and rural planning is not only able to unify and store all types of data, but also able to improve the efficiency and visualization.

In order to improve the performance of the query optimization for the distribute database, an improved query optimization algorithm was proposed based on the genetic algorithm. The query execution cost model based on the genetic algorithm was proposed in this paper. The distributed database was emerged in the 70's of the last century and developed with the progress of the computer technology and network technology, the distributed database was the database system which is distributed storage dispersedly in physics and with centralized processing in mathematic logic. Because the storage points were not uniform, the structure of the distributed database is much more complicated than the centralized database. Both the genetic algorithm and the dynamic exhaustive planning algorithm were taken in the query simulation for the performance comparison. The result shows that the genetic query optimization method in this paper has better performance in the distributed database query application. The case study and the simulation result show that the algorithm can get a satisfactory optimization result in a few iterations and the query optimization algorithm based on the genetic method has nice performance of the query optimization property, and the consumption and costs of the query is reduced to the minimum. The method which this paper proposed has good application performance and is valuable to put into practice.

One of the most popular data mining approach to find frequent itemset in a given transactional dataset is Association rule mining. The important task of Association rule mining is to mine association rules using minimum support value which is specified by the user or can be generated by system itself. In order to calculate minimum support value, every time the complete database has to be scanned for each item in the transaction. This decreases the time complexity of the algorithm. Here we proposed a new algorithm which scan the database once and create a cache database for each transaction using hash map. This cache copy is then used to search for frequent item sets. Due to which the overhead of scaning complete database for each item is reduced, and efficiency is increased. Key word: Apriori, cache database, hash map, scanning time, time complexity.

Exploration is the act of investigating unknown regions. An analyst exploring a database cannot, by definition, compose the right query or use the appropriate data mining algorithm. However, current data management tools cannot operate without well defined instructions. Therefore, browsing an unknown database can be a very tedious process. Our project, Atlas, is an attempt to circumvent this problem. Atlas is an active DBMS front-end, designed for database exploration. It generates and ranks several data maps from a user query. A data map is a small set of database queries (less than a dozen), in which each query describes an interesting region of the database. The user can pick one and submit it for further exploration. In order to support interaction, the system should operate in quasi-real time, possibly at the cost of precision, and require as little input parameters as possible. We draft a framework to generate such data maps, and introduce several short-to long-terms research problems.

This paper is based on a numerical control milling cutting parameters database, DataCut, which is constructed on SQL Server. This paper focuses on a normal measure to separate and combine databases. This kind of measure can transfer databases, which are from different areas, into metabases of cutting parameters database of industry-oriented applications, and then combine them. This will take advantage of all the resource, and help to build a cutting parameters database of industry-oriented applications. Besides, in order to protect the commercial secrets of different areas expertise, this database system should also be able to be used separately. This normal measure has been applied to an experiment, which realized the combination of databases.

The adaptation of open-source database applications is common in the industry. Most open-source database applications are incomplete. During adaptation, users usually have to implement additional data maintenance. Hence, the completeness of an application is an important concern for the adaptation as a key factor to indicate how much additional effort is required before using a system. From our study of database applications with complete functionalities, we observe that data in a database has common patterns of lifecycles. Anomaly in data lifecycles provides a good indicator on the completeness of database applications. In this paper, we propose a novel approach to automatically extract the data lifecycles out of the source code of database applications through inter-procedural static program analysis. This representative information can benefit the adaptation of database applications specifically for selection, maintenance and extension. We have developed a tool to implement the proposed approach for PHP (Hypertext Preprocessor)-based database applications. Case studies have shown that the proposed approach is useful in assisting adaptation and detecting faults of open-source database applications.

The forest fire has been threatening the forest ecosystem and has brought huge economic losses to humans. Traditional fire detection systems use ion-optical smoking type and other physical or chemical means to discover a fire, which is not suitable for outdoor forest fires with long-distance and large-area characteristics. This paper presents the early fire detection algorithm based on smoke dynamic characteristics and its main part includes smoke color model, dynamic feature extraction and fire area connected component analysis. Through standard video database performance testing and compared to the algorithm and the traditional fire detection method, we can achieve early warning of a fire and can effectively reduce false and negative rate of fire monitoring system.

In this paper, we propose a scheme of database management to administer gathered data in schoolzone system. By using image sensor and GPS sensor gathered image and coordination information is transferred to the system server through the networks that it is managed by the database to analyze the situation recognition. Schoolzone system implements the analysis of specific scenario to gathered data of database so that its results and corresponding implementation is reported to monitoring server and their results have been stored.

Database system is information aggregation. So the security of database is very important. This paper describes the research process of tracking SQL server database data tampered. Now we can monitor the important data in daily work. And providing a guarantee for the safety, accuracy of database.

Based on the remaining research results of database and its development software, this article develops the database system of geotechnical engineering exploration for a city using the database management system SQL Server 2005 and vb6.0, and establishes the database tables at all levels, and then advances the more reasonable System Structure, which make the system realize data edition function, information inquiry function, database management function, graph drawing function, data output function and so on. Moreover, the system interface is friendly and the system is easy to operate so that it is convenient for users to study and use, and it achieves good results.

Aiming at the characteristics of telemetry data with different types, varied parameters and various processing algorithms, a database-based design method is proposed. This method can store the variable information in the database, and the database information could be loaded before the software runs. At the same time, the database and the software will not be changed while information varies. Besides, aiming at the characteristics of large telemetry data and high frame frequency, a data output frequency control method based on the identification bit is proposed. The test results show that this method can effectively control the output frequency of data according to user needs.

Practical implementation of Web technologies in developing computer-aided circuit design (CAD) systems based on the Web Socket protocol is treated. An approach to storing project data by setting up a database server in data management Oracle environment is suggested. Components of the environment as well as those of the developed software, their assignment along with communication protocols are described. Set up configurations of the database server are specified in detail. Algorithms of building the database structure, those of forming the inquiry tables are given. The algorithm to connect Visual Studio 2015 environment to the database and install client application to access the database functionality are demonstrated.

SQLite database engine is small, fast, reliable, and does not need a server to work. And, if needed, multiple applications may work with same SQLite database, optionally, using filesystem sharing services. However, file sharing option is not always available and reliable in certain conditions. In this paper, we propose a server for SQLite database. This server will be using HTTP as communication protocol. To enable multiuser application, this server will be multithreaded. However, access to the database file will be synchronized to help prevent database corruption. And, as data-interchange format, JSON will be used. We also run several tests to make sure that proposed server is usable. Test results show that the database file is not corrupted, while still maintain acceptable performance.

In this research, we use three Swingbench OLTP benchmark scenarios to examine that three compression algorithm in ZFS file-systems namely LZ4, LZJB and ZLE can improve OLTP database performance. Beside the database performance, we also compare how much storage can be saved, impact to maximum response time, and the increase of CPU utilization from the three compression algorithms. The acquired data were then be analyzed using Analytic Hierarchy Process to find out the highest ranking compression in terms of benefits and benefits to cost ratio. The result indicates that LZJB achieved the highest performance improvement, LZ4 achieved the highest storage saving and ZLE achieved the smallest CPU utilization overhead. The safest algorithm that did not experience any reduction in database performance or increase of maximum response time in this research is LZJB.