• Title/Summary/Keyword: SQL-database

Search Result 428, Processing Time 0.026 seconds

WebDBs : A User oriented Web Search Engine (WebDBs: 사용자 중심의 웹 검색 엔진)

  • 김홍일;임해철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1331-1341
    • /
    • 1999
  • This paper propose WebDBs(Web Database system) which retrieves information registered in web using query language similar to SQL. This proposed system automatically extracts information which is needed to retrieve from HTML documents dispersed in web. Also, it has an ability to process SQL based query intended for the extracted information. Web database system takes the most of query processing time for capturing documents going through network line. And so, the information previously retrieved is reused in similar applications after stored in cache in perceiving that most of the web retrieval depends on web locality. In this case, we propose cache mechanism adapted to user applications by storing cached information associated with retrieved query. And, Web search engine is implemented based on these concepts.

  • PDF

Automatic Database Lecture Management System (데이터베이스 강의 관리 자동화 시스템)

  • Hur, Tai-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.267-274
    • /
    • 2014
  • Even though computer based college lecture management system was developed long ago and has been used ever since, developing perfect lecture management is not simple. The main objective of this system is to develop appropriate online lecture supportive management program suitable for college lectures. This system [ADLEMS] mainly focuses on the management of college database lectures, exams, and grades. This system supports management and grading of attendance, reports, quizzes, mid-term, and final exams. Exam management categorizes into multiple choice questions, essay questions, short answer questions, and SQL. Especially for SQL, division analysis was applied when developing grading system for more effective grade management. For essay questions and short answer questions, manual [hand] grading method was used. Every student can verify the grading process in person to alleviate the problems occurring during the grading process.

A Study on the Implementation of SQL Primitives for Decision Tree Classification (판단 트리 분류를 위한 SQL 기초 기능의 구현에 관한 연구)

  • An, Hyoung Geun;Koh, Jae Jin
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.12
    • /
    • pp.855-864
    • /
    • 2013
  • Decision tree classification is one of the important problems in data mining fields and data minings have been important tasks in the fields of large database technologies. Therefore the coupling efforts of data mining systems and database systems have led the developments of database primitives supporting data mining functions such as decision tree classification. These primitives consist of the special database operations which support the SQL implementation of decision tree classification algorithms. These primitives have become the consisting modules of database systems for the implementations of the specific algorithms. There are two aspects in the developments of database primitives which support the data mining functions. The first is the identification of database common primitives which support data mining functions by analysis. The other is the provision of the extended mechanism for the implementations of these primitives as an interface of database systems. In data mining, some primitives want be stored in DBMS is one of the difficult problems. In this paper, to solve of the problem, we describe the database primitives which construct and apply the optimized decision tree classifiers. Then we identify the useful operations for various classification algorithms and discuss the implementations of these primitives on the commercial DBMS. We implement these primitives on the commercial DBMS and present experimental results demonstrating the performance comparisons.

Quantitative Evaluations on the Query Modeling and System Integrating Cost of SQL/MDR

  • Jeong, Dong-Won;Kim, Young-Gab;In, Hoh-Peter
    • ETRI Journal
    • /
    • v.27 no.4
    • /
    • pp.367-376
    • /
    • 2005
  • SQL/MDR is a metadata registry query language used to consistently exchange and share the data between distributed metadata registries. It is an extension of the international SQL and is familiar to most database builders and administrators. It provides many advantages such as simplicity of query language, ease of use, an independent description for distributed querying, low cost for adding new systems, simplicity of exchanging mechanism, and so on. The goal of this paper is to evaluate and show its merits quantitatively. To achieve this goal, we define simulation models to compare with an existing approach and then describe the evaluation results. In the quantitative evaluation results, the good points of SQL/MDR can be identified and known.

  • PDF

SQL-based Semantic Query Processing in the OWL-aware Relational Model (OWL 인식 관계형 모델에서 SQL 기반의 시맨틱 질의 처리)

  • Kim, Hak-Soo;Son, Jin-Hyun
    • Journal of KIISE:Databases
    • /
    • v.35 no.1
    • /
    • pp.44-53
    • /
    • 2008
  • According to the widespread use of ontology-based applications, it is critical to efficiently store and process semantic information. Even though several related systems have been developed, they have some limitations in perspectives of the volume of target semantic data, the performance of semantic query processing, and the semantic data maintenance. In this paper we propose the OWL-aware relational model for the ontology management system and SQL-based semantic query processing mechanism. Also, to verify the query processing performance, we show that the proposed query professing mechanism is more efficient than sesame.

Storage Benchmarking System Using NoSQL Database Engines (NoSQL 데이터베이스 엔진을 이용한 스토리지 벤치마킹 시스템)

  • Choi, do-jin;Park, soo-bin;Park, song-hee;Baek, yeon-hee;Shin, bo-kyoung;Choi, jae-yong;Park, jae-yeol;Lim, jong-tae;Bok, kyoung-soo;Yoo, jae-soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2019.05a
    • /
    • pp.445-446
    • /
    • 2019
  • 빅데이터 시대의 도래로 다양한 NoSQL 데이터베이스 엔진이 활용되고 있다. NoSQL 데이터베이스 엔진 기반의 다양한 응용들이 수행될 때 스토리지의 성능을 평가하기 위한 스토리지 벤치마킹 툴이 요구된다. 본 논문에서는 NoSQL 데이터베이스를 이용한 스토리지 벤치마킹 시스템을 설계한다. 제안하는 스토리지 벤치마킹 시스템은 IO 추적기를 통해 스토리지의 성능을 측정하고, 웹 UI를 통해 사용자 정의 워크로드 생성, 벤치마킹 실행, 결과 확인을 수행할 수 있다.

  • PDF

SQL Learning Tool Using TPC-H model (TPC-H 데이터모델을 이용한 SQL 교육 도구)

  • Pack, Inhye;Kim, Jieun;Jeon, Minah;Shim, Jaehee;Kang, Hyunjeong;Park, Uchang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.1532-1533
    • /
    • 2011
  • 본 연구에서는 SQL를 배우고자 하는 개발자들에게 SQL 문법을 학습할 수 있는 교육용 Tool을 개발한다. 개발자가 예제와 설명을 통하여 SQL 문법을 배우고 ER-Diagram을 보면서 논리적인 DB의 개념을 이용하여 쉽게 학습할 수 있다. 예제는 초급과 중급으로 나누어져 있어 사용자의 수준에 맞는 학습이 선택가능하다. TPC-H 데이터는 DSS 환경에서 사용되는 표준 데이터 모델로 Database Generater를 통해 생성하며 본 연구에서 사용자가 데이터량의 조정이 가능하도록 구성하였다.

Locking in Practice : Performance of a Database System on a Multicore Machine (락의 실제 : 멀티코어 상의 데이터베이스 성능 분석)

  • Han, Hyuck
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.8
    • /
    • pp.22-29
    • /
    • 2014
  • A lock is a general and popular way of serializing accesses to shared data in multiprocessor environments. After the mutual exclusion was first introduced in 1960s, many spinlock algorithms have been proposed and deployed to real systems such as operating systems and (transactional) database systems. In this study, we measure impacts of a lock mechanism on a database system under various CPU configurations using a high-end multicore system. For the evaluation, we use the most up-to-date version of MySQL (version 5.6) with InnoDB engine, which has been substantially re-architected to improve scalability on multicore machines. We changed the original spinlock function of InnoDB to evaluate various spinlock mechanisms on multicore machines.

A Query Processing Model based on the XML View in Relational Databases (관계형 데이터베이스에서 XML 뷰 기반의 질의 처리 모델)

  • Jung, Chai-Young;Choi, Kyu-Won;Kim, Young-Ok;Kim, Young-Kyun;Kang, Hyun-Syug;Bae, Jong-Min
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.221-232
    • /
    • 2003
  • This paper addresses the query processing component of a wrapper system for a relational database model based on the XML view in integrating databases. The schema of a relational database is represented as XML Schema that is proposed by W3C. Users submit a query using the XML query language XQuery over the XML Schema. The wrapper system to be developed supports an user-defined XML view. XQuery is also used as the view definition language. In this environment, this paper suggests a new XML query processing model. We propose the composition algorithm of an XML view with an user query, the translation algorithm of XQuery into SQL, and the XML template construction algorithm for generating XML documents.

Classification of HTTP Automated Software Communication Behavior Using a NoSQL Database

  • Tran, Manh Cong;Nakamura, Yasuhiro
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.2
    • /
    • pp.94-99
    • /
    • 2016
  • Application layer attacks have for years posed an ever-serious threat to network security, since they always come after a technically legitimate connection has been established. In recent years, cyber criminals have turned to fully exploiting the web as a medium of communication to launch a variety of forbidden or illicit activities by spreading malicious automated software (auto-ware) such as adware, spyware, or bots. When this malicious auto-ware infects a network, it will act like a robot, mimic normal behavior of web access, and bypass the network firewall or intrusion detection system. Besides that, in a private and large network, with huge Hypertext Transfer Protocol (HTTP) traffic generated each day, communication behavior identification and classification of auto-ware is a challenge. In this paper, based on a previous study, analysis of auto-ware communication behavior, and with the addition of new features, a method for classification of HTTP auto-ware communication is proposed. For that, a Not Only Structured Query Language (NoSQL) database is applied to handle large volumes of unstructured HTTP requests captured every day. The method is tested with real HTTP traffic data collected through a proxy server of a private network, providing good results in the classification and detection of suspicious auto-ware web access.