• Title/Summary/Keyword: SQL-database

Search Result 433, Processing Time 0.027 seconds

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.

A Relational Spatiotemporal Database Query Language and Their Operation (관계형 시공간 데이터베이스 질의언어와 연산)

  • Kim, Dong-Ho;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2467-2478
    • /
    • 1998
  • The spatiotemporal databases support historical informations as well as spatial managements for the objects in the real world, and can be efficiently used to various applications such as geographic information system, urban plan system, car navigation system. Although there are so far several pioneering works in spatioemporal data modeling, it is little to study on spatiotemporal query language. So in this paper, we at first survey a modeling technique that makes spatiotemporal objects into databases, and then show some sighificant functions supported by query language. Also we suggest a new spatiotemporal database query language, entitled as STQL, which make users to enable to manage efficient historical information as well as spatial management function on the basis of relational query language, SQL. Also the proposed STQL, shows their operationsl in spatiotemporal daabases.

  • PDF

A Seminar Assistant System using IOCP Server Model (IOCP 서버 모델을 이용한 세미나 보조시스템)

  • Ahn, Hyun-Ju;Heo, Da-Jeong;Park, Dong-Gyu;Uh, Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.821-827
    • /
    • 2009
  • Currently, with the development of web 2.0 knowledge sharing system became more and more important. In this paper, we proposed and implemented seminar assistant system using database system and knowledge sharing system on public seminar. We recorded speaker's voice and presentation files on our system and user can review past talks on our seminar review systems. Our database system is implemented using MS SQL, and Input/Output Completion Port(IOCP) socket model as our server side network module. Also we used presentation software using Direct Show with MFC and Windows Presentation Foundation(WPF). and our review system is based on WFP programmed with C# language.

A Design of Intelligent Home Network Service using Wireless Sensor Network (무선 센서 네트워크를 이용한 지능형 홈 네트워크 서비스 설계)

  • Na, Sun-Wung;Lee, Sang-Jeong;Kim, Dong-Kyun;Choi, Young-Kil
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.183-193
    • /
    • 2006
  • This paper suggests a service model which uses a wireless sensor network in home network environment. The sensor network consists of fixed sensor nodes and user identification nodes which is attached to each user. With the input information of the user preference profile and the collected data from the sensor nodes, the database is constructed as a context information and analyzed by a home server to provide a service that establishes and controls automatically home appliances according to each user's preference. The proposed service model is implemented and tested on a Linux server with MySQL database and sensor nodes on TinyOS.

  • PDF

A Study on the Design and Requirements of the Object-oriented Database Systems (객체지향 데이터베이스 시스템의 필요요건과 설계에 관한연구)

  • Yu, Yang-Geun;Ryu, Hae-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.325-337
    • /
    • 1997
  • This paper introduces the basic concepts and requirements of database system based on the object-oriented paradigm,and presents the overview of the design of an object-oriented data base system which refects those conceprs and requirements . The system imolemented on C++,consists of three structure layers.The inner layer, which is in fact a storage system,performs file I/O,while the inermediate layer is responisible for most of the functions except the ones rerated to the user interface, such as the transaction management,the schema manage-ment,and the management of buffers in main memory etc.The outer layer,designed mainly for the uwerunteface,mot only privides the functions for graphical user interface,preprocessor,and interpreter etc,but also supports extended SQL for object-oriented features.

  • PDF

A Study on Data Migration using XMDR-DAI (XMDR-DAI를 이용한 데이터 이주 기법에 관한 연구)

  • Moon, Seok-Jae;Jung, Gye-Dong;Choi, Young-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2707-2718
    • /
    • 2009
  • Enterprises saved and controled data using individual and various database which were occurred on business. The saved data that were existed in the database were approached by business processing for specified achievement of service's aims and were occurred frequently data migration. This research propose the data migration method using XMDR-DAI(eXtended Meta-Data Registry-Data and Integration) that were occurred by approaching and integration in the process of business processing based on sql query.

Using Database of Calculus Problems in Teaching of University Level Mathematics

  • Saastamoinen, Kalle;Ketola, Jaakko
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1851-1852
    • /
    • 2005
  • We have created in our university material management environment, which uses database created by using LATEX-files, and LATEX2HTML translator and PHP language. In this paper we will define how these LATEX-files are transformed into our database. In this paper, we present work which we have done for providing the material used in the teaching of calculus to students at Lappeenranta University of Technology. This procedure can be divided into three separate steps: 1) creation of the LATEX-files, 2) implementation of these LATEX-files in 3) conversion of the base LATEX-files to the HTML-files. So far, we have stored hundreds of exercises with hints and solutions on our web server in addition to some theory that we felt is necessary for the students. In this paper we will also discuss the benefits and future of our functioning Web-environment [1].

  • PDF

The Meaning, Method and Tool to Build the Ewha Music Database (EMDB)

  • Kim, Eun-Ha;Chae, Hyun Kyung
    • International journal of advanced smart convergence
    • /
    • v.9 no.3
    • /
    • pp.239-245
    • /
    • 2020
  • The Ewha Music Database (EMDB) is an online database comprised of primary source materials related to music education from East Asia during the modern era (1880 to 1945) when Korea, Japan, and China were geopolitically and culturally intertwined. We developed the incipit search in EMDB as an embedded tool. This is the first attempt in Korea to implement a unique search function of musical data using alphabets of musical notes. Unlike in traditional search system that uses general literature information search conditions, such as author, title, publisher, year, number of pages, etc., it offers a new way of searching a musical piece/work and sheet music. This study confirms that digital information technology is an important methodology for research of music culture as a field of humanities.

Test Database Management Program Development of Hanvit 350 (한국형 고속열차 시운전시험데이터 통합관리 프로그램 개발)

  • Lee, Tae-Hyung;Park, Choon-Soo;Choi, Seong-Hoon
    • Proceedings of the KSR Conference
    • /
    • 2007.11a
    • /
    • pp.1586-1589
    • /
    • 2007
  • A prototype high-speed train system, Hanvit-350, has been developed in Korea since 1996. The train has reached the maximum speed of 352.4km/h during a test run on December 2004. It is presently undergoing various tests to stabilize its performance and to secure reliability. Until now, around 420 runs have been conducted and accumulates 190,000km trial run. The test database management program is developed using existing analysis program, LabVIEW and database program, Microsoft-SQL. The test database management program is used to analysis of test results and will be used to find out the correlation characteristics between parameters.

  • PDF

A Technique for Generating Query Workloads of Various Distributions for Performance Evaluations (성능평가를 위한 다양한 분포를 갖는 질의 작업부하의 생성 기법)

  • 서상구
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.1
    • /
    • pp.27-44
    • /
    • 2002
  • Performance evaluations of database algorithms are usually conducted on a set of queries for a given test database. For more detailed evaluation results, it is often necessary to use different query workloads several times. Each query workload should reflect the querying patterns of the application domain in real world, which are non-uniform in the usage frequencies of attributes in queries of the workload for a given database. It is not trivial to generate many different query workloads manually, while considering non-uniform distributions of attributes'usage frequencies. In this paper we propose a technique to generate non-uniform distributions, which will help construct query workloads more efficiently. The proposed algorithm generates a query-attribute usage distribution based on given constraints on usage frequencies of attributes and qreries. The algorithm first allocates as many attributes to queries as Possible. Then it corrects the distribution by considering attributes and queries which are not within the given frequency constraints. We have implemented and tested the performance of the proposed algorithm, and found that the algorithm works well for various input constraints. The result of this work could be extended to help automatically generate SQL queries for various database performance benchmarking.

  • PDF