• Title/Summary/Keyword: Database Sharing

Search Result 329, Processing Time 0.032 seconds

Polygon Approximation Based Cognitive Information Delivery in Geo-location Database Oriented Spectrum Sharing

  • Wei, Zhiqing;Wu, Huici;Feng, Zhiyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2926-2945
    • /
    • 2017
  • In geo-location database oriented spectrum sharing system, the entire geographic area is divided into meshes to classify, store and delivery the cognitive information. In this paper, we propose a flexible polygon mesh division scheme to reduce the number of meshes. Hence the cognitive information can be reduced correspondingly. Besides, polygon mesh can approximate the real environment and reduce the error of cognitive information because the edges of polygon are selected along the boundaries of the networks. We have designed the polygon approximation algorithm and have analyzed the relation between the error and the number of polygon's edges. Finally, the simulation results are provided to verify the algorithm and analysis. The polygon mesh division scheme in this paper provides an efficient approach for cognitive information organization in database oriented spectrum sharing system.

A Study on Synchronization Effect of A Multi-dimensional Event Database for Big Data Information Sharing (빅 데이터 분석정보 공유를 위한 다차원 이벤트 데이터베이스의 동기화 효과 연구)

  • Lee, Choon Y.
    • Journal of Digital Convergence
    • /
    • v.15 no.10
    • /
    • pp.243-251
    • /
    • 2017
  • As external data have become important corporate information resources, there are growing needs to combine them with internal data. This paper proposes an ontology-based scheme to combine external data with multi-dimensional databases, which shall be called multi-dimensional event ontology. In the ontology, external data are represented as events. Event characteristics such as actors, places, times, targets are linked to dimensions of a multi-dimensional database. By mapping event characteristics to database dimensions, external event data are shared via multi-dimensional hierarchies. This paper proposes rules to synchronize information sharing in multi-dimensional event ontology such as upward event information sharing, downward event information sharing and complex event information sharing. These rules are implemented using Protege. This study has a value in suggesting Big Data information sharing processes using an event database framework.

Requirements for Composite Material Property Sharing System to Korean Products (국산 복합재료의 물성치 공유체계 수립을 위한 요구조건)

  • Suh, Jang Won;Rhee, Seung Yun;Lee, Young Dae
    • Journal of Aerospace System Engineering
    • /
    • v.7 no.1
    • /
    • pp.32-38
    • /
    • 2013
  • This paper presents a survey results on the material properties sharing system database on composite in USA. The requirements on management and database for Korean composite product that meet KAS (Korean Airworthiness Standard) are suggested. The certification policy on composite material qualification of also introduced. The benefits to material supplier, aircraft manufacturer and certification authority, which get through the database have been considered. The database managing process, composite material manufacturing process, properties and design allowable meeting KAS have been suggested.

A Recovery Scheme of Single Node Failure using Version Caching in Database Sharing Systems (데이타베이스 공유 시스템에서 버전 캐싱을 이용한 단일 노드 고장 회복 기법)

  • 조행래;정용석;이상호
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.409-421
    • /
    • 2004
  • A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

Development of Knowledge Sharing Platform for Molding & Forming Technology (금형·성형 기술을 위한 생산기반 지식공유형 플랫폼 개발)

  • Bae, S.M.;Lee, H.W.;Heo, Y.M.;Shin, G.H.;Lee, J.W.;Yoon, G.S.
    • Transactions of Materials Processing
    • /
    • v.20 no.8
    • /
    • pp.534-539
    • /
    • 2011
  • The production technology is the basic of manufacturing for various materials and components. This technology can influence the quality and productivity of leading export products such as automobile, ship, and electronic device. Besides, the production technology is very useful to apply to other manufacturing fields and has a great ripple effect. However, it is very difficult to make the production technology into standardization and knowledge-based database because the production technology is dependent in hands-on experience. In this study, the knowledge-sharing platform for the molding & forming technology which is a branch of the production technology is introduced. This platform is web-based system and has the knowledge authoring tool technologies storage, semantic database, and web portal service. Therefore, the molding & forming technology can be shared and spread easily by the knowledge-sharing platform.

A Cache Consistency Control for B-Tree Indices in a Database Sharing System (데이타베이스 공유 시스템에서 B-트리 인덱스를 위한 캐쉬 일관성 제어)

  • On, Gyeong-O;Jo, Haeng-Rae
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.593-604
    • /
    • 2001
  • A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

  • PDF

Cache Coherency Schemes for Database Sharing Systems with Primary Copy Authority (주사본 권한을 지원하는 공유 데이터베이스 시스템을 위한 캐쉬 일관성 기법)

  • Kim, Shin-Hee;Cho, Haeng-Rae;Kim, Byeong-Uk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.6
    • /
    • pp.1390-1403
    • /
    • 1998
  • Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory, a separate copy of operating system, and a DB'\fS. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. However, since multiple nodes may be simultaneously cached a page, cache consistency must be cnsured so that every node can always access the'latest version of pages. In this paper, we propose efficient cache consistency schemes in DSS, where the database is logically partitioned using primary copy authority to reduce locking overhead, The proposed schemes can improve performance by reducing the disk access overhead and the message overhead due to maintaining cache consistency, Furthermore, they can show good performance when database workloads are varied dynamically.

  • PDF

Building Web Database for WHO Healthy City Wonju (원주시 건강도시 웹 데이터베이스 구축)

  • Nam, Eun-Woo;Shin, Taek-Soo;Song, Yea-Li-A;Park, Ki-Soo;Song, Tae-Min;Kim, Min-Kyung;Park, Jae-Sung
    • Korean Journal of Health Education and Promotion
    • /
    • v.24 no.3
    • /
    • pp.119-128
    • /
    • 2007
  • The purpose of this study is to develop Web database for healthy city that contains healthy city indicators for making city health plans, setting project priorities, monitoring projects, and evaluating healthy city projects, effectively. Using Delphi survey method for identifying indicator domains and indicators, we extracted nine domains with thirty-four healthy city indicators. Based on the appraisals of DB users about the contents of DB, a web database for healthy city Wonju was constructed. We developed a web database system for the purposes of sharing high quality health related data for managing and evaluating healthy city projects. The web database currently provides variety data in the web address, http://healthycity.wonju.go.kr/index.html. The web DB comprised with major healthy city indicators that are the most important indicators, healthy city indicator data that have a variety data set for encompassing all domain areas such as city infrastructure, health medicine, economies, and all other related areas and qualitative data that contains policy reports, research results, healthy city information and all other tips. A database of healthy city is very essential and important because it makes healthy city projects alive by managing and sharing healthy city related data effectively. But we need to fill out some blank cells in DB because there are currently unavailable data for some indicators. In conclusion, we expect the web DB contributes information sharing of healthy city project teams and improving healthy city project quality at Wonju city in Korea.

A Cache Coherency Control for B-Tree Indices in a Database Sharing System (데이터베이스 공유 시스템에서 B-트리 인덱스를 위한 캐쉬 일관성 제어)

  • 온경오;조행래
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.36-38
    • /
    • 2000
  • 데이터베이스 공유 시스템(Database Sharing System: DSS)은 고성능 트랜잭션 처리를 위해 다수 개의 컴퓨터를 연동하는 방식으로, 각 노드들은 디스크 계층에서 데이터베이스를 공유한다. DSS에서 각 노드는 빈번한 디스크 액세스를 피하기 위해 최근에 액세스한 데이터 페이지와 인덱스 페이지들을 자신의 지역 메모리 버퍼에 캐싱한다. 이때 노드가 항상 최신의 페이지를 사용할 수 있기 위해서는 지역 버퍼에 캐싱된 페이지들의 일관성을 지원하여야 한다. 본 논문에서는 데이터 페이지에 비해 빈번히 엑세스되는 인덱스 페이지의 정확성을 보장할 수 있는 캐쉬 일관성 제어 기법을 제안한다.

  • PDF