Search

Metadata is data that describes other data. SQL Server exposes a vast array of metadata including structural metadata, which describes every object, and descriptive metadata, which described the data itself. Metadata is exposed through a series of catalog views; information schema views; dynamic management views; and functions, system functions, and stored procedures.

There are four core DML statements in SQL, namely INSERT, UPDATE, DELETE, and SELECT. These statements apply to base tables and views (views will be discussed in the next chapter). The chapter proceeds under the following subheadings

This chapter focuses on inserting data into the DataSet and the database. Insert data into the DataSet or exactly insert data into the data tables in the DataSet is totally different with inserting data into the database or inserting data into the data tables in the database. The chapter discusses inserting data into the database using the Visual Studio.NET design tools and wizards. It also discusses inserting data into the Faculty table in the Oracle database. The chapter describes how to insert data into the database using the stored procedures with run‐time object method. It provides a very detailed introduction about the Oracle packages and the Oracle stored procedures and illustrated how to use these methods to perform the data query for the Student Form and STUDENT table in sample database. Language‐Integrated Query can be considered as a pattern or model that is supported by a collection of so‐called Standard Query Operator methods.

Store procedure is a group of query stored in database catalogue which allows it to be recalled. Insert, update and delete data could performed using store procedure. Stored procedure is an alternative to optimize query performance and also to reduce security gap at interface level of a system. This research provides an overview implementation of stored procedure insert, update and deleting in two DBMS, MariaDB and PostgreSQL. Software developers prefer MariaDB and PostgreSQL because it is open-source, which means free. This research is an experimental research and descriptive analysis. This research data uses student data with amount of data 25000, 15000 and 5000 data. Research result show PostgreSQL require less processing time than MariaDB. Results of this research can used as a reference to design application programs which sometimes choose a DBMS is not a concern of developer.

In recent years, Internet exposure of applications continuously engenders new forms threats that can endanger the security of the entire system and raises many performance issues related to code security. The safety of information systems becomes essential. This is why the performance linked to security codes is of importance essential in the security systems of all companies. Indeed, as contribution, to carry out measurements, it appropriates tools that are the JMH tool (Java Microbenchmark Harness) and the PHP Benchmark script tool which include unsecure java and PHP codes and secured against SQL (Structured Query Language) injection, XSS (Cross Site Scripting) i.e., using prepared requests, stored procedures, validation of input from white lists, reinforcement of minimum privilege, when sending requests from the last ones to MySQL databases and Postgresql. We recover the times of response to his requests. From java codes and PHP (Hypertext Preprocessor) secure, we also retrieve the response time for requests to databases MySQL and PostgresqL data. We then obtain the curves and interpretations comparing performance related to security and non-security of codes. The goal is to analyze and evaluate the performance comparing secure Java and PHP code against unsecure java and PHP code using MySQL and Postgresql databases. In Section 1, we presented the performance of the code Java and PHP. The configuration of the experiments and the experimental results are discussed in Sections 2 and 3, respectively. Use of suitable tool which is the JMH tool and the PHP Benchmark script tool, we have developed in Java 1.8 and PHP 7.4 secure and non-secure codes that send the queries to the MySQL or Postgresql database to carry out the measurements which led to the conclusion that the insecure PHP and Java codes are faster in terms of response time compared to the PHP and Java secure codes as the number of tables linked to the query increases because the blocking times of SQL injection and XSS preventions linked to its secure codes are increasing.

This research was conducted to measure the data storage time carried out by the DBMS on data that has been prepared with an increasing number of data, the data provided is consistent student data which will be stored with Stored Procedure and Function. This study uses the action research method which has 4 stages, starting with planning, action, observation and reflection. From the results of the experiments that have been carried out, it appears that Stored Procedure is able to outperform Function in data storage time. The data provided are 2 different types of data, each of which consists of 500, 2500, 4500 and 6500 data stages. This study also compares data storage that is differentiated by the computer between the data provider computer and the data storage computer or server, the result of which is the Stored Procedure. able to outperform Function in data storage speed.

The SQL query language is the 'lingua franca' of transactional databases, and is essential for scalable data analytics. Learning SQL requires practical exercises with databases, including those parts of SQL with side-effects such as DDL statements, triggers, and stored procedures. Teaching this effectively to a non-technical audience is a challenge, especially in times of COVID-19 without face-to-face classes. The Grok Learning platform allows to design self-paced online tutorials with auto-graded exercises - but it was originally built for teaching programming languages. In this demo, we show how we extended the Grok platform to teach SQL for Data Scientists with comprehensive online learning. Grok supports a rich user interface with interactive examples where students can explore and experiment with each example query. This is ideal for learning declarative querying. Each query is executed in its own sandbox on a freshly initialised database instance which allows to teach all parts of SQL including DDL statements, stored procedures, triggers and UDFs. At the same time, the platform scales to thousands of concurrent users, while maintaining interactive response times.

BACKGROUND Many hospitals have replaced their legacy anesthesia information management system with an enterprise-wide electronic health record system. Integrating the anesthesia data within the context of the global hospital information infrastructure has created substantive challenges for many organizations. A process to build a perioperative data warehouse from Epic was recently published from the University of California Los Angeles (UCLA), but the generalizability of that process is unknown. We describe the implementation of their process at the University of Miami (UM). METHODS The UCLA process was tested at UM, and performance was evaluated following the configuration of a reporting server and transfer of the required Clarity tables to that server. Modifications required for the code to execute correctly in the UM environment were identified and implemented, including the addition of locally specified elements in the database. RESULTS The UCLA code to build the base tables in the perioperative data warehouse executed correctly after minor modifications to match the local server and database architecture at UM. The 26 stored procedures in the UCLA process all ran correctly using the default settings provided and populated the base tables. After modification of the item lists to reflect the UM implementation of Epic (eg, medications, laboratory tests, physiologic monitors, and anesthesia machine parameters), the UCLA code ran correctly and populated the base tables. The data from those tables were used successfully to populate the existing perioperative data warehouse at UM, which housed data from the legacy anesthesia information management system of the institution. The time to pull data from Epic and populate the perioperative data warehouse was 197 ± 47 minutes (standard deviation [SD]) on weekdays and 260 ± 56 minutes (SD) on weekend days, measured over 100 consecutive days. The longer times on weekends reflect the simultaneous execution of database maintenance tasks on the reporting server. The UCLA extract process has been in production at UM for the past 18 months and has been invaluable for quality assurance, business process, and research activities. CONCLUSIONS The data schema developed at UCLA proved to be a practical and scalable method to extract information from the Epic electronic health system database into the perioperative data warehouse in use at UM. Implementing the process developed at UCLA to build a comprehensive perioperative data warehouse from Epic is an extensible process that other hospitals seeking more efficient access to their electronic health record data should consider.

Тема выпускной квалификационной работы: «Исследование возможностей по взаимодействию с моделью нейронной сети, размещенной в базе Ð´Ð°Ð½Ð½Ñ‹Ñ Â».Данная работа посвящена способам совместного использования Ð¸ÑÐºÑƒÑÑÑ‚Ð²ÐµÐ½Ð½Ñ‹Ñ Ð½ÐµÐ¹Ñ€Ð¾Ð½Ð½Ñ‹Ñ ÑÐµÑ‚ÐµÐ¹ и баз Ð´Ð°Ð½Ð½Ñ‹Ñ . Автором был произведен обзор ÑÑƒÑ‰ÐµÑÑ‚Ð²ÑƒÑŽÑ‰Ð¸Ñ Ñ€ÐµÑˆÐµÐ½Ð¸Ð¹ и Ð¿Ð¾Ð´Ñ Ð¾Ð´Ð¾Ð² в сфере взаимодействия с нейронными сетями, на основе которого представлена Ñ Ð°Ñ€Ð°ÐºÑ‚ÐµÑ€Ð¸ÑÑ‚Ð¸ÐºÐ° Ñ€Ð°ÑÑÐ¼Ð¾Ñ‚Ñ€ÐµÐ½Ð½Ñ‹Ñ ÑÑ€ÐµÐ´ÑÑ‚Ð². Целью работы является получение реализации системы Ñ Ñ€Ð°Ð½ÐµÐ½Ð¸Ñ искусственной нейронной сети в базе Ð´Ð°Ð½Ð½Ñ‹Ñ Ð½Ð° сервере. В предложенной автором системе модель нейронной сети и данные для обучения полностью Ñ Ñ€Ð°Ð½ÑÑ‚ÑÑ в базе Ð´Ð°Ð½Ð½Ñ‹Ñ PostgreSQL. На основе возможностей СУБД был реализован способ взаимодействия пользователя с моделью с помощью Ñ Ñ€Ð°Ð½Ð¸Ð¼Ñ‹Ñ Ð¿Ñ€Ð¾Ñ†ÐµÐ´ÑƒÑ€ на языке pl/python. Данная методика позволяет клиенту использовать только оболочку или API для взаимодействия с базой Ð´Ð°Ð½Ð½Ñ‹Ñ Ð¸ не размещать на локальном устройстве средства для работы с нейронными сетями.Полученная реализация была протестирована на основе классификации изображений в сверточной нейронной сети и классификации Ñ‚ÐµÐºÑÑ‚ÑƒÑ€Ð½Ñ‹Ñ Ð¿Ñ€Ð¸Ð·Ð½Ð°ÐºÐ¾Ð² Харалика в нейронной сети прямого распространения. Тестирования и сравнение с аналогичной реализацией локального взаимодействия с нейронной сетью удовлетворили сформированным требованиям по размещению и производительности нейронной сети и занимаемой ей памятью., The subject of the graduate qualification work is «Research of the opportunities for interaction with the model of the neural network placed in database».This work is devoted to ways of sharing artificial neural networks and databases. The author made a review of existing solutions and approaches in the field of interaction with neural networks, based on which the characteristics of the considered tools are presented. The goal of the work is to obtain an implementation of an artificial neural network storage system in a database on server. In the system suggested by author, the neural network model and training data are completely stored in the PostgreSQL database. Based on capabilities of the DBMS, a way for user interaction with the model using stored procedures in pl/python language was implemented. This technique allows the client to use only an IDE or API to interact with the database and not install tools for working with neural network on the local device.The final implementation was tested based on image classification in a convolutional neural network and classification of Haralick Texture features in feed-forward neural network. Testing and comparison with a similar implementation of local interaction with a neural network satisfied the formed requirements for the placement and performance of the neural network and the memory it occupies.

This chapter contains sections titled: Perform Data Manipulations to SQL Server Database Using JPA Wizards Perform Data Manipulations to Oracle Database Using JPA Wizards Perform Data Manipulations to SQL Server Database Using Java Runtime Object Perform Data Manipulations to Oracle Database Using Java Runtime Object Perform Data Manipulations Using Updatable ResultSet Perform Data Manipulations Using Callable Statements Chapter Summary Homework

One of the principal needs for online transaction processing (OLTP) systems is to get as much speed as possible out of the system. With this in mind, in SQL Server 2014, Microsoft introduced a new set of functionality focused around making OLTP systems as fast as possible. These are the memory-optimized technologies of in-memory tables and natively compiled stored procedures. This set of enterprise-only features is meant for high-end, transaction-intensive, OLTP-focused systems. The memory-optimized technologies are another tool in the toolbox of query tuning, but they are a highly specialized tool, applicable only to certain applications. Be cautious in adopting this new technology. That said, on the right system with the right kind of memory, I am talking about blazing-fast speed.

In this chapter, we are going to look into ways to leverage the built-in programmable features of SQL Server that allow for maximum performance and efficiency.

The work shows the RFID cards as e-document rather than a paper passport with embedded chip as the e-passport. This type of Technological advancement creates benefits like the information can be stored electronically. The aim behind this is to reduce or stop the uses of illegal document. This will assure the security and prevent illegal entry in particular country by fake documents it will also maintain the privacy of the owner. Here, this research work has proposed an e-file verification device by means of RFID. Henceforth, this research work attempts to develop a new generation for file verification by decreasing the human effort. The most important idea of this examine is to make it feasible to get admission to the info of proprietor of the file the usage of RFID generation. For this the man or woman is issued RFID card. This card incorporates circuit which is used to store procedure information via way of modulating and demodulating the radio frequency sign transmitted. Therefore, the facts saved in this card are referred to the file element of the man or woman. With the help of the hardware of the proposed research work RFID Based E-Document verification provides a tag to the holder which produces waves of electromagnetic signal and then access the data. The purpose is to make the verification of document easy, secured and with less human intervention. In the proposed work, the comparative analysis is done using RFID technology in which 100 documents are verified in 500 seconds as compared to manual work done in 3000 seconds proves the system to be 6 times more efficient as compared to conventional method.

In relational databases stored procedures and user defined functions (UDFs) have been used to express application business logic by using control flow logic and DMLs. Recently their use is increasing with the rising popularity of real-time analytics applications since the applications often contain complex business logic. Thus hybrid transactional and analytical processing systems like SAP HANA have started to put more efforts to optimize the execution of UDFs. There has been much work in the fields of program optimization and query optimization, respectively. However, most of the studies have been done separately in isolated worlds, and cross-optimizations breaking the boundary between declaratives and imperatives were not studied enough. Therefore, unified optimization techniques considering both program and query optimization techniques are essential for achieving optimal query performance. The first part of this talk presents a literature overview of a successful approach to improve the performance of UDF execution. This approach transforms entire UDFs into equivalent relational algebra expressions, then applies existing relational query optimization techniques. It is interesting that the imperative constructs such as branches and loops can be converted into relational algebra expressions. This approach is attractive since we can simply take advantage of existing sophisticated query optimization techniques after the transformation. However, one of the most challenging issues faced by this approach is that transformation rules are currently limited and there are non-transformable imperative expressions. The second part presents our past and ongoing work using another approach, which unifies both program and query optimization techniques in a framework. The framework consists of plan enumeration and cost estimation for the UDFs. We first demonstrate this approach with iterative query processing in a UDF. With the notion of query motion, by which an SQL query is moved in and out of a loop, we enumerate execution plans for the UDF. We choose the best plan by using a cost model which measures the procedure cost based on the cost estimation of the query optimizer and imperative constructs. We next discuss unified optimization using the concept of relational operator motion, where we pull up or push down relational operators among statements in the UDF to obtain a globally optimized plan of the UDF.

Nowadays, one of the most challenging situations for software developers is the presence of a mismatch between relational database systems and programming codes. In the literature, this problem is defined as "impedance mismatch". This study is to develop a framework built on innovations based on the existing Object Relational Mapping technique to solve these problems. In the study, users can perform operations for three different database systems such as MsSQL, MySql and Oracle. In addition, these operations can be done within the framework of C# and Java programming languages. In this framework, while the developers can define database tables in the interface automatically, they can create relations between tables by defining a foreign key. When the system performs these operations, it creates tables, views, and stored procedures automatically. In addition, entity classes in C# and Java for tables and views, and operation classes for stored procedures are created automatically. The summary of the transactions can be taken as pdf file by the framework. In addition, the project can automatically create Windows Communication Foundation classes to facilitate the handling of database elements created and the interfacing operations, as well. This framework, which supports distributed systems, can be downloaded at this link.

Stored procedures in database management systems are often used to implement complex business logic. Correctness of these procedures is critical for flawless working of the system. However, testing them remains difficult due to many possible database states and constraints on data. This leads to mostly manual testing. Newer tools offer automated execution for unit testing of stored procedures but the test cases are still written manually. We propose an approach of using dynamic symbolic execution for generating automated test cases and corresponding database states for stored procedures. We model the constraints on data imposed by the schema and the SQL statements, treating values in database tables as symbolic. We use SMT solver to find values that will drive the stored procedure on a particular execution path. We instrument the internal execution plans generated by PostgreSQL to extract constraints. We use Z3 to generate test cases consisting of table data and procedure inputs. Our evaluation using stored procedures from a large business application and various GitHub repositories quantifies the evidence of effectiveness of our technique by generating test cases that lead to schema constraint violations and user-defined exceptions.

With the development of information technology, the amount of power grid topology data has gradually increased. Therefore, accurate querying of this data has become particularly important. Several researchers have chosen different indexing methods in the filtering stage to obtain more optimized query results because currently there is no uniform and efficient indexing mechanism that achieves good query results. In the traditional algorithm, the hash table for index storage is prone to “collision” problems, which decrease the index construction efficiency. Aiming at the problem of quick index entry, based on the construction of frequent subgraph indexes, a method of serialized storage optimization based on multiple hash tables is proposed. This method mainly uses the exploration sequence to make the keywords evenly distributed; it avoids conflicts of the stored procedure and performs a quick search of the index. The proposed algorithm mainly adopts the “filter-verify” mechanism; in the filtering stage, the index is first established offline, and then the frequent subgraphs are found using the “contains logic” rule to obtain the candidate set. Experimental results show that this method can reduce the time and scale of candidate set generation and improve query efficiency. Keywords: Power grid, Graph database, Graph computing, Multi-Hash table, Frequent subgraphs

We present a standard-based methodology to data-mine and eventually compute the results from 360° feedback surveys. We pay special attention to its suitability in the educational and pedagogical sphere, where very little research efforts have been accomplished. A 360° feedback study (also known as multi-rater feedback) provides a holistic view of an appraisee's performance based on the information and opinions gathered from raters about the person being evaluated. An evaluator or appraiser can be any peer, coworker, subordinate, supervisor, customer, classmate, and so on and even the appraisee himself/herself. This type of surveys is usually carried out in big companies/institutions and by specialized human resources departments. The computer tools normally used for the processing of the data generated by these studies are based on simple spreadsheets and ad hoc scripts backed by untapped databases. In this context, we advocate the use of a refined, standardized, and straightforward computing environment based on stored procedures. The Persistent Stored Module and the stored procedures there defined are part of the Structured Query Language ISO norm, and they can be leveraged to perform complex calculations without the need of developing external software or requiring extra network transactions. This approach can also be transferred to general 360° appraising studies and, with special emphasis, to those performed in academic levels. As a testbed, the presented techniques have been put into practice in a multi-rater evaluation experience executed with over 240 high-school students. The technical and pedagogical lessons learned in this initial test can be eventually exported to the three main academic levels in a network of educational centers with more than 44k scholars enrolled. The inclusion of such assessment actions in educational environments enables the fostering of the novel pattern of cooperative learning, as it is also highlighted.

Recently, the use of web-based applications has increased significantly, especially online services, most of which are used for digital transaction activities that use the internet. However, the increasing use of online services often ignores the privacy and security aspects of an application, web developers making it an attractive target for security concerns. In this article, the proposed countermeasures include two mechanisms, namely: the use of stored procedure parameters, and the use of stored procedure encryption in SQL server. The goal is to prevent the dangers of internet crime attacks using structured query language injection attacks (SQLIA). In addition, an analytical evaluation of prevention and protection should also be carried out. The solution offered is prevention and protection using stored procedures because it can prevent SQLI attacks effectively and efficiently.

The previous chapter covered the details of EF Core and its capabilities. This chapter is focused on applying what you learned about EF Core to build the AutoLot data access layer. You begin the chapter by scaffolding the entities and derived DbContext from the previous chapter’s database. Then the project is changed from database first to code first, and the entities are updated to their final version and applied to the database using EF Core migrations. The final change to the database is to re-create the GetPetName stored procedure and create a new database view (complete with a matching view model), all using migrations.

For management of massive data and centralized network, the data security research team has become a central issue. Role-based access control (RBAC) is a common practice to control access to sensitive data. This article uses Flex and C# to develop an RBAC model, which can make data management more flexible. Concentrating on data security, this article presents the layer structure and model design for standardized management of security access. This article also implements detailed approaches for data security by verifying parameters and codes, access control, preventing illegal users and using oracle parameters and stored procedures for database security technology. In addition, an empirical study was conducted to assess effectiveness and usefulness .

This chapter covers in-memory databases along with some other new technologies and paradigms that radically depart from the traditional disk-based rowstore architecture and query-processing algorithms that most relational databases have been using for a few decades now. Current relational databases were architected back in the late 1970s, when hardware was totally different from what it is today and databases were too large to fit in memory and assumed to be kept on disk. In addition to faster processors and declining memory cost, memory capacity in current hardware has increased in a way that most transactional database can now entirely fit into it.

International audience; A DB querying system is said to be flexible if it adapts to the end user expectations and expertise. This paper introduces a novel strategy to fuzzy querying that reduces the gap between complex search conditions end users have in mind and formal queries understood by the underlying DB system. In the Flexible Querying By Example paradigm, the proposed strategy, called DCQ standing for Disjunctive Concept Querying, extends a flexible querying system with subjective disjunctive concepts: it proposes two stored procedures that can be embedded in any relational database management system to build a formal query from a few user-given examples that represent the diversity of what the user is looking for. The first procedure infers the membership function of the implicit imprecise concept underlying the provided examples, with the specificity of allowing for complex disjunctive concepts: it is able to both capture properties shared by most of the selected representative tuples as well as specific properties possessed by only one specific representative tuple. The second procedure allows to exploit the resulting fuzzy concept in a query.; Dans le contexte de l'interrogation flexible de bases de données, cet article présente une nouvelle stratégie de requête par l'exemple floue, appelée DCQ (Disjunctive Concept Querying), qui permet de traiter des concepts disjonctifs subjectifs : il propose deux procédures stockées qui peuvent être implémentées dans tout système de gestion de base de données relationnelles pour construire des requêtes formelles à partir de quelques exemples illustrant la diversité de ce que l'utilisateur recherche. La première procédure infère la fonction d'appartenance du concept imprécis sous-jacent aux exemples représentatifs fournis, avec la particularité de permettre d'exprimer des concepts complexes disjonctifs : elle est capable de capturer à la fois les propriétés partagées par la plupart des exemples représentatifs fournis et les propriétés spécifiques présentes dans des exemples plus isolés. La seconde procédure permet de construire la requête correspondant à ce concept flou.

Properly configuring SQL Server is of paramount importance for the performance of your databases and applications. Even when the product has been updated throughout the years to ensure it has the best possible configuration by default, there are still multiple cases, especially for high- performance workloads, in which additional configurations and optimizations may be required.

Cilj ovog završnog rada je usporedba MVC i troslojne arhitekture za izradu web aplikacije. Napravljene su dvije web aplikacije za potrebe rent-a-car tvrtke za koju je napravljena odgovarajuća baza podataka. Jedna Web aplikacija se temelji na MVC arhitekturi, a druga na troslojnoj arhitekturi. U ovom radu su prikazani rezultati usporedbe izvršavanja navedene dvije web aplikacije. Korisnici se moraju prijaviti u aplikaciju, te nakon prijave korisnik bira automobil koji će rezervirati. U samu aplikaciju se može prijaviti i administrator koji može upravljati vozilima tako da može dodati novo vozilo, urediti i vidjeti detalje. U .NET Windows Formi aplikaciji, korisnik se prijavljuje i dodaje novo vozilo. Svi podaci se spremaju u MS SQL bazi podataka, a web aplikacija napisana je programskim jezikom C#., The goal of this final paper is to compare MVC and three-tier architecture for web application development. For the needs of a car rental company, two web applications were created, along with the appropriate database. One Web application is based on the MVC architecture and the other on a three-tier architecture. This paper presents the results of a comparison of the execution of these two web applications. Users must log in to the application, and after logging in, the user selects the car to be booked. And an administrator who can manage vehicles to add a new vehicle, edit and see details can also log into the app itself. In the .NET Windows Form application, where the user logs in and adds a new vehicle. All data is stored on the MS SQL database, and the web application is programmed using the C # programming language.

In the development of (software) systems, new user wishes must usually be implemented very quickly. This poses a real challenge for system development. This challenge led from waterfall to incremental, agile, and even continuous development. In this paper we treat the research question how to come from elementary user wishes and simple domain models all the way to concrete SQL-specifications in a quick, straightforward, and traceable way.

This chapter covers storage from the SQL Server point of view and, although other factors such as availability and recoverability play a very important role in selecting and configuring storage, we focus mostly on performance. Disk is traditionally the slowest component in a database system, so tuning storage for performance is essential and usually comes in two high level areas: directly tuning the storage and tuning the components to make efficient use of the storage. The first area refers to tuning and configuring the storage hardware itself, while the second one relates to tuning the other components of the system to make optimal use of the storage and includes items such as proper SQL Server configuration and creating the right indexes.

Structured Query Language (SQL) injection is one of the critical threats to database security. The effects of SQL injection attacks cause the data contained in the database to be at risk of being exploited by irresponsible parties, compromising data integrity, disrupting server operations and in return affecting the organization's image. Although SQL injection is an attack performed at the application level, SQL injection prevention requires security controls at all levels, namely application level, database level and network level. The absence of SQL injection prevention measures at the application level makes the database vulnerable to attack. Reviews indicate that the current approaches still not sufficient in addressing these three issues, which are i) improper use of dynamic SQL, ii) lack of input validation process and iii) inconsistent error handling. Currently, program and database code security is based solely on basic security measures that are focused at the network level such as network firewalls, database access control and web server request filtering. Unfortunately, these measures are still inadequate and not sufficient to safe guard the program code and databases from the attack. To overcome this shortcoming as addressed by these three issues, a new comprehensive method is proposed using an improved parameterized stored procedure to enhance database security. Experimental results prove that the proposed method is able to prevent SQL injection from occurring and able to shorten the processing time when compared with existing methods, hence able to improve database security.

Databases play an important role in Information and Communication Technologies and data has no significance unless it is converted into meaningful information. Relational or SQL disk databases where data is structured in tables have served many applications over the years. The increasing need for faster data access in real-time systems has changed the traditional Disk-based database into an In-memory database where data is manipulated and stored directly in the main memory thereby reducing disk input/output operations. With the emergence of IoT and Big Data, NoSQL databases now represent an alternative to traditional relational databases in terms of simpler design and faster operations on large data volumes. This work compares three types of databases namely Relational On-disk, Relational In-memory and NoSQL On-disk/In-memory in terms of Insert, Select, Update and Delete operations together with Indexes, Stored procedures and Triggers in an IoT environment. A plant environment has been monitored in real-time using sensor data such as Temperature/Humidy, Moisture and Water level. Data was stored in different databases and the time taken to execute various operations were recorded. Experiments using the water level parameter demonstrate there is no specific database that provides the best performance for all data operations.

In the era of big data, people's visual needs for data expression are increasing. In order to achieve better big data display effects, this article introduced the use of text clustering algorithms to achieve data crawling and Echarts technology to realize big data visualization. This system used mvvm's architecture and vue framework development platform, ThinkPHP was used as the background framework, and ES6 related technologies and specifications were used for application development. This system used Echarts, IView, GIS technology and JavaScript development methods to demonstrate economic big data module functions on the web side; Applied CSS3, HTML5, GIS technology to implement project achievement module and university alliance module; Applied Echarts, HTML5, JS function library technology to achieve national information module. This system used stored procedure, database index optimization technology to achieve rapid screening of massive data, and dynamically update and displayed related data through two-way data binding. This system combined real-time location technology with GIS technology to measure the distance between the user and the destination, and automatically plan the tour route to provide related services. This system can provide feasibility suggestions for strategic researchers or experts in related areas of the “Belt and Road”, and provide theoretical basis and technical support.