• Title/Summary/Keyword: Exploit DB

Search Result 9, Processing Time 0.026 seconds

Implementation of a Prefetch method for Secondary Index Scan in MySQL InnoDB Engine (MySQL InnoDB엔진의 Secondary Index Scan을 위한 Prefetch 기능 구현)

  • Hwang, Dasom;Lee, Sang-Won
    • Journal of KIISE
    • /
    • v.44 no.2
    • /
    • pp.208-212
    • /
    • 2017
  • Flash SSDs have many advantages over the existing hard disks such as energy efficiency, shock resistance, and high I/O throughput. For these reasons, in combination with the emergence of innovative technologies such as 3D-NAND and V-NAND for cheaper cost-per-byte, flash SSDs have been rapidly replacing hard disks in many areas. However, the existing database engines, which have been developed mainly assuming hard disks as the storage, could not fully exploit the characteristics of flash SSDs (e.g. internal parallelism). In this paper, in order to utilize the internal parallelism intrinsic to modern flash SSDs for faster query processing, we implemented a prefetching method using asynchronous input/output as a new functionality for secondary index scans in MySQL InnoDB engine. Compared to the original InnoDB engine, the proposed prefetching-based scan scheme shows three-fold higher performance in the case of 16KB-page sizes, and about 4.2-fold higher performance in the case of 4KB-page sizes.

A Study on the Improvement and Utilization of Public N-Day Vulnerability Databases (N-day 취약점 데이터베이스 개선 및 활용 방안 연구)

  • JongSeon Jeong;Jungheum Park
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.4
    • /
    • pp.667-680
    • /
    • 2024
  • If the software is not updated after the vulnerability is disclosed, it can continue to be attacked. As a result, the importance of N-day detection is increasing as attacks that exploit vulnerabilities increase. However, there is a problem that it is difficult to find specific version information in the published vulnerability database, or that the wrong version or software is outputted. There is also a limitation in that the connection between the published vulnerability databases is not good. In order to overcome these limitations, this paper proposes a method of building information including comprehensive vulnerability information such as CVE, CPE, and Exploit Database into an integrated database. Furthermore, by developing a website for searching for vulnerabilities based on an integrated database built as a result of this study, it is effective in detecting and utilizing vulnerabilities in specific software versions and Windows operating systems.

Content-based Image Retrieval Using Texture Features Extracted from Local Energy and Local Correlation of Gabor Transformed Images

  • Bu, Hee-Hyung;Kim, Nam-Chul;Lee, Bae-Ho;Kim, Sung-Ho
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1372-1381
    • /
    • 2017
  • In this paper, a texture feature extraction method using local energy and local correlation of Gabor transformed images is proposed and applied to an image retrieval system. The Gabor wavelet is known to be similar to the response of the human visual system. The outputs of the Gabor transformation are robust to variants of object size and illumination. Due to such advantages, it has been actively studied in various fields such as image retrieval, classification, analysis, etc. In this paper, in order to fully exploit the superior aspects of Gabor wavelet, local energy and local correlation features are extracted from Gabor transformed images and then applied to an image retrieval system. Some experiments are conducted to compare the performance of the proposed method with those of the conventional Gabor method and the popular rotation-invariant uniform local binary pattern (RULBP) method in terms of precision vs recall. The Mahalanobis distance is used to measure the similarity between a query image and a database (DB) image. Experimental results for Corel DB and VisTex DB show that the proposed method is superior to the conventional Gabor method. The proposed method also yields precision and recall 6.58% and 3.66% higher on average in Corel DB, respectively, and 4.87% and 3.37% higher on average in VisTex DB, respectively, than the popular RULBP method.

An XPath Accelerator on Relational Databases: An Implementation and Its Tuning (관계형 데이터베이스를 이용한 XPath Accelerator: 구현과 튜닝)

  • Shin Jin-Ho;Na Gap-Joo;Lee Sang-Won
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.189-198
    • /
    • 2005
  • XML is rapidly becoming the standard for data representation and exchange, and XML documents are being adopted in various applications. Since the late 1990s, some native XML database management systems(DBMSs) have been developed. More recently, commercial relational DBMS vendors try to incorporate full functionalities of XML into their products, such as Oracle, MS SQL and IBM DB2. In this paper, we implement a well-known RDBMS-based XML data storage and indexing technique, called XPath Accelerator, and tune it in an industry-leading RDBMS. Our contributions are two-folds: 1) an in-depth implementation of the XPath Accelerator technique and 2) its tuning to exploit the advanced query processing techniques of an RDBMS.

Pose and Expression Invariant Alignment based Multi-View 3D Face Recognition

  • Ratyal, Naeem;Taj, Imtiaz;Bajwa, Usama;Sajid, Muhammad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4903-4929
    • /
    • 2018
  • In this study, a fully automatic pose and expression invariant 3D face alignment algorithm is proposed to handle frontal and profile face images which is based on a two pass course to fine alignment strategy. The first pass of the algorithm coarsely aligns the face images to an intrinsic coordinate system (ICS) through a single 3D rotation and the second pass aligns them at fine level using a minimum nose tip-scanner distance (MNSD) approach. For facial recognition, multi-view faces are synthesized to exploit real 3D information and test the efficacy of the proposed system. Due to optimal separating hyper plane (OSH), Support Vector Machine (SVM) is employed in multi-view face verification (FV) task. In addition, a multi stage unified classifier based face identification (FI) algorithm is employed which combines results from seven base classifiers, two parallel face recognition algorithms and an exponential rank combiner, all in a hierarchical manner. The performance figures of the proposed methodology are corroborated by extensive experiments performed on four benchmark datasets: GavabDB, Bosphorus, UMB-DB and FRGC v2.0. Results show mark improvement in alignment accuracy and recognition rates. Moreover, a computational complexity analysis has been carried out for the proposed algorithm which reveals its superiority in terms of computational efficiency as well.

A Storage and Retrieval System for Structured SGML Documents using Grove (Grove를 이용한 구조적 SGML문서의 저장 및 검색)

  • Kim, Hak-Gyoon;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.5
    • /
    • pp.501-509
    • /
    • 2002
  • SGML(ISO 8879) has been proliferated to support various document styles and to transfer documents into different platforms. SGML documents have logical structure information in addition to contents. As SGML documents are widely used, there is an increasing need for database storage and retrieval system using the logical structure of documents. However. traditional search engines using document indexes cannot exploit the logical structure. In this Paper, we have developed an SGML document storage system, which is DTD-independent and store the document type and the document instance separately by using Grove which is the document model for DSSSL and HyTime. We have used the Object Store, an object-oriented DBMS, to store the structure information appropriately without any loss of structural information. Also, we have supported a index structure for search efficiency like the relational DBMS, and constructed an effective user interface which combines content-based search with structure-based search.

Exploiting Correlation Characteristics to Detect Covert digital communication

  • Huang, Shuhua;Liu, Weiwei;Liu, Guangjie;Dai, Yuewei;Tian, Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3550-3566
    • /
    • 2020
  • As a widely used way to exfiltrate information, wireless covert channel (WCC) brings a serious threat to communication security, which enables the wireless communication process to bypass the authorized access control mechanism to disclose information. Unlike the covert channel on the network layer, wireless covert channels on the physical layer (WCC-P) is a new covert communication mode to implement and improve covert wireless communication. Existing WCC-P scheme modulates the secret message bits into the Gaussian noise, which is also called covert digital communication system based on the joint normal distribution (CJND). Finding the existence of this type of covert channel remains a challenging work due to its high undetectability. In this paper, we exploit the square autocorrelation coefficient (SAC) characteristic of the CJND signal to distinguish the covert communication from legitimate communication. We study the sharp increase of the SAC value when the offset is equal to the symbol length, which is caused by embedding secret information. Then, the SAC value of the measured sample is compared with the threshold value to determine whether the measured sample is CJND sample. When the signal-to-noise ratio reaches 20db, the detection accuracy can reach more than 90%.

Classification of Characters out of their Original Cultural Forms to Create Digital Contents : Focusing on Avalokitesvara (觀音菩薩) and Buddhist child (童子) (디지털콘텐츠 제작을 위한 전통문화원형의 캐릭터 분류 : 관음보살(觀音菩薩) 및 동자(童子)를 중심으로)

  • Lee, Young-Suk;Shin, Seung-Yun
    • Cartoon and Animation Studies
    • /
    • s.27
    • /
    • pp.153-176
    • /
    • 2012
  • In the midst of the fusion era in digital contents, securing a variety of traditional cultural sources is important. Out of its long history, Korea has extensive spectrum of cultural contents in combination with conventional religions. Buddhist art has been a pillar of the traditional culture for a long time in Korea, by which we could secure new sources for cultural contents and classify them. This is aimed that we could bring the future brands into reality based on the traditional culture through Buddhist cultural contents. This study hired the original cultural forms in the viewpoints of traditional culture. Study on the implication through the symbols of Avalokitesvara (觀音菩薩) and Buddhist child (童子) in Buddhist art might allow to secure a foothold to create own characters. Thus, focusing on Avalokitesvara (觀音菩薩) and Buddhist child (童子) in the Buddhist sacred images as registered in Cultural Heritage Administration for national treasures, those traditional characters were reviewed through their own system of symbol. During the course, Buddhist characters were available to be classified into DB by their roles and materials지물. This study could help to exploit the complicated Buddhist culture of its symbolic meanings and to shape them into original forms of the culture. Also, through the meanings of the Buddhist sacred images, it could provide the digital contents pool with Korean traditional characters.

Fusion of Blockchain-IoT network to improve supply chain traceability using Ethermint Smart chain: A Review

  • George, Geethu Mary;Jayashree, LS
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.11
    • /
    • pp.3694-3722
    • /
    • 2022
  • In today's globalized world, there is no transparency in exchanging data and information between producers and consumers. However, these tasks experience many challenges, such as administrative barriers, confidential data leakage, and extensive time delays. To overcome these challenges, we propose a decentralized, secured, and verified smart chain framework using Ethereum Smart Contract which employs Inter Planetary File Systems (IPFS) and MongoDB as storage systems to automate the process and exchange information into blocks using the Tendermint algorithm. The proposed work promotes complete traceability of the product, ensures data integrity and transparency in addition to providing security to their personal information using the Lelantos mode of shipping. The Tendermint algorithm helps to speed up the process of validating and authenticating the transaction quickly. More so in this time of pandemic, it is easier to meet the needs of customers through the Ethermint Smart Chain, which increases customer satisfaction, thus boosting their confidence. Moreover, Smart contracts help to exploit more international transaction services and provide an instant block time finality of around 5 sec using Ethermint. The paper concludes with a description of product storage and distribution adopting the Ethermint technique. The proposed system was executed based on the Ethereum-Tendermint Smart chain. Experiments were conducted on variable block sizes and the number of transactions. The experimental results indicate that the proposed system seems to perform better than existing blockchain-based systems. Two configuration files were used, the first one was to describe the storage part, including its topology. The second one was a modified file to include the test rounds that Caliper should execute, including the running time and the workload content. Our findings indicate this is a promising technology for food supply chain storage and distribution.