• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.234-240
• /
• 2022

One of the most discussed topics is cyber security when it comes to web application and how to protect it and protect databases. One of the most widely used and widespread techniques is SQLI, and it is used by hackers and hackers. In this research, we touched on the concept of SQLI and what are its different types, and then we detected a SQLI vulnerability in a website using SQLMAP. Finally, we mentioned different ways to avoid and protect against SQLI.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.3-17
• /
• 2004

With the rapid growth of the Internet geographic information services through the WWW such as a location-based service and so on. Web GISs (Geographic Information Systems) have also come to be a cluster-based architecture like most other information systems. That is, in order to guarntee high quality of geographic information service without regard to the rapid growth of the number of users, web GISs need cluster-based architecture that will be cost-effective and have high availability and scalability. This paper proposes the design of the cluster-based web GIS with high availability and scalability. For this, each node within a cluster-based web GIS consists of main memory spatial databases which accomplish role of caching by using data declustering and the locality of spatial query. Not only simple region queries but also the proposed system processed spatial join queries effectively. Compare to the existing method. Parallel R-tree spatial join for a shared-Nothing architecture, the result of simulation experiments represents that the proposed spatial join method achieves improvement of performance respectively 23% and 30% as data quantity and nodes of cluster become large.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.209-215
• /
• 2000

In the on-demand services like AOD(Audio On Demand) over the internet, existing operating systems cannot serve repeatedly requested data efficiently. This paper proposes a web cache architecture. It predicts the songs to be requested in near future, based on the intervals between the requests in the past on the same song and keeps the songs in the web cache. For the replacement strategy of the web cache, LFRR(Least Frequently Requested Recently) is proposed. LFRR replaces the song that has less probability to be requested in near future. The average of the intervals between the requests in the past and the new request is used as the probability of the requests. It is more likely to be requested in near future as the average is less. The web cache decreases the number of disk access extremely, and support to serve more users with restricted resources. From the simulation result based on the data at the AOD site currently operating, it is shown that the high performance enhancement is achieved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1861-1885
• /
• 2020

Test Case Prioritization (TCP) involves the rearrangement of test cases on a prioritized basis for various services. This research work focuses on TCP in web services, as it has been a growing challenge for researchers. Web services continuously evolve and hence require reforming and re-execution of test cases to ensure the accurate working of web services. This study aims to investigate gaps, issues, and existing solutions related to test case prioritization. This study examines research publications within popular selected databases. We perform a meticulous screening of research publications and selected 65 papers through which to answer the proposed research questions. The results show that criteria-based test case prioritization techniques are reported mainly in 41 primary studies. Test case prioritization models, frameworks, and related algorithms are also reported in primary studies. In addition, there are eight issues related to TCP techniques. Among these eight issues, optimization and high effectiveness are most discussed within primary studies. This systematic review has identified that a significant proportion of primary studies are not involved in the use of statistical methods in measuring or comparing the effectiveness of TCP techniques. However, a large number of primary studies use 'Average Percentage of Faults Detected' (APFD) or extended APFD metrics to compute the performance of techniques for web services.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.195-204
• /
• 2004

The Semantic Web is proposed as the next generation Web technology. In the environment of the Semantic Web, resources are related with each other semantically and computers can process this information easily. The Resource Description Framework (RDF) supports this semantic relationship. RDF is the data model for describing metadata of the Web resources. To establish and develop the Semantic Web, methods for managing RDF data efficiently are the most important. So, in this research, we propose methods for storing and querying RDF data using an XML database system. Using an XML database system, XML data, main data of the Semantic Web, and RDF data, the metadata of XML data, can be managed in the same storage and by the same mechanism efficiently. In addition, we propose an efficient data retrieval method and several techniques to improve the system performance. Our query processing technique performs better than an existing system.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.77-86
• /
• 2008

The Web information sources can be regarded as the largest distributed database to the users. By virtually integrating the distributed information sources and regarding them as a single huge database, we can query the database to extract information. This capability is important to develop Web application programs. We have to infer a database schema from browsing-oriented Web documents in order to integrate databases. This paper presents a heuristic algorithm to infer the XML Schema fully automatically from semi-structured Web documents. The algorithm first extracts candidate pattern regions based on predefined structure-making tags, and determines a target pattern region using a few heuristic factors, and then derives XML Schema extraction rules from the target pattern region. The schema extraction rule is represented in XQuery, which makes development of various application systems possible using open standard XML tools. We also present the experimental results for several public web sources to show the effectiveness of the algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.317-323
• /
• 2001

DICOM(Digital Imaging and Communications in MediCine), standard of medical image operation, present the methods for communications and Storage of Medical Image. medical image acquired from patient in hospital made DICOM files. this paper purposes design and implementation methodologies of a web-based medical information system that consists of DICOM (Digital Imaging and Communications in Medicine) databases and functional components of a web server in order to support the access of medical information with Intemet web browser. we store the patient and image information to database using reading the group and element oJ DICOM file. we made file transfer module by implementing DICOM Store service, in result, we can transfer DICOM file to IF based host or computer. We compose web component of communications and Storage service, user be used DICOM Service by web Browser.

• Journal of Microbiology and Biotechnology
• /
• v.14 no.5
• /
• pp.1081-1085
• /
• 2004

Genome research has become very popular in most nations. In order to enhance the efficiency of collaboration among genome research groups, ways to store and share data, communicate with each other, be guided through right research strategies, and to easily use well-established databases. In addition, since techniques and softwares for genome research groups are well established, a similar research road map could commonly be applied. In this study, we developed a web-based work place for effective genome research, named 'BioPlace.' From the beginning of writing a proposal, research members can work on the same environment with convenient aid to share files or data. BioPlace provides various ways of collaboration methods among genome researchers. The BioPlace system supports two types of workplaces, namely 'Personal Workspace' and 'Team Workspace.' For each BioPlace user, a Persona] Workspace is provided, while a Team Workspace is provided for each group with the same purpose. In addition, BioPlace provides a 'General Research Road Map' for genome research, and several Korean user interfaces for BLAST, PDB, and Primer3. We expect that BioPlace may facilitate collaboration of genome research among the experienced scientists and help beginners in many different ways as well.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.471-479
• /
• 2010

The main contribution of this paper is to propose the integrated database schema from several research projects included in "The Next Generation New Technology for Rock-falling and Landsliding Project". Furthermore this paper describes the development of integrated standard database system for the slopes databases. We also develop and implement the global real time web service system in order to provide one-stop data service for the slopes. In this paper, the new integrated database paradigm for rock-fall and landsliding data is designed and proposed and also data management system is developed based on the global web service system.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.192-198
• /
• 2008

It is difficult to get relevant information on vast Web data. Search engines summarize and store Web information and show the ranked lists based on user queries affected by relative importance and user-adaptation. But these have limitation with showing user-intended information at the top priority. User intention is presented in general within query itself. In this paper, we propose the selective rankup methodology of user-intended search results based on weighting internal contiguity in query terms. With experimental results, we can find user-intended results with 75.8% probability using this simple method only, and efficiency of rerank proposed outperforms ordinary case by $13{\sim}20%$.