• Title/Summary/Keyword: 시간지원 데이터베이스

Search Result 225, Processing Time 0.034 seconds

Application of Spatial Information Technology to Shopping Support System (공간정보기술을 활용한 상품구매 지원 시스템)

  • Lee, Dong-Cheon;Yun, Seong-Goo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.28 no.2
    • /
    • pp.189-196
    • /
    • 2010
  • Spatial information and smart phone technology have made innovative improvement of daily life. Spatial and geographic information are in practice for various applications. Especially, spatial information along with information and telecommunication technology could create new contents for providing services for convenient daily life. Spatial information technology, recently, is not only for acquiring location and attribute data but also providing tools to extract information and knowledge systematically for decision making. Various indoor applications have emerged in accordance with demands on daily GIS(Geographic information system). This paper aims for applying spatial information technology to support decision-making in shopping. The main contents include product database, optimal path search, shopping time expectation, automatic housekeeping book generation and analysis. Especially for foods, function to analyze information of the nutrition facts could help to improve dietary pattern and well-being. In addition, this system is expected to provide information for preventing overconsumption and impulse purchase could help economical and effective purchase pattern by analyzing propensity to consume.

Implementing a Web-based Seed Phenotype Trait Visualization Support System (웹 기반 종자 표현체 특성 가시화 지원시스템 구현)

  • Yang, OhSeok;Choi, SangMin;Seo, DongWoo;Choi, SeungHo;Kim, YoungUk;Lee, ChangWoo;Lee, EunGyeong;Baek, JeongHo;Kim, KyungHwan;Lee, HongRo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.5
    • /
    • pp.83-90
    • /
    • 2020
  • In this paper, a web-based seed phenotype visualization support system is proposed to extract and visualize data such as the surface color, length, area, perimeter and compactness of seed, which is phenotype information from the image of soybean/rice seeds. This system systematically stores data extracted from seeds in databases, and provides a web-based user interface that facilitates the analysis of data by researchers using data tables and charts. Conventional seed characteristic studies have been manually measured by humans, but the system developed in this paper allows researchers to simply upload seed images for analysis and obtain seed's numerical data after image processing. It is expected that the proposed system will be able to obtain time efficiency and remove spatial restriction, if it is used in seed characterization research, and it will be easy to analyze through systematic management of research results and visualization of the phenotype characteristics.

A Construction of Korean Tea-Historical Literature DB and Implementation of Web Service (한국 차-연대기 문헌 DB 구축 및 웹서비스 구현)

  • Min Gyu Lee;Jung Hyun Yang;Se Hoon Jung;Chun Bo Sim
    • Smart Media Journal
    • /
    • v.12 no.9
    • /
    • pp.103-115
    • /
    • 2023
  • A Korean Tea-Historical Literature DB was constructed, collating information related to tea from eight historical texts, including the Annals of the Joseon Dynasty. Data were gathered from existing historical literature DB and web services. After processing, verification, and tag input, 53,679 historical literature data entries related to tea were created. This DB construction centralizes previously dispersed reading services into a single web service. Features such as literature title, time, and tag-based search functionality; assignment of attribute tags to data; search linkage through original source links; and a bookmark function were incorporated to enhance user convenience. The outcomes of this research support studies in the related fields, and it is believed that by accumulating and improving accessibility to tea-related literature, contributions can be made to the preservation and education of Korean traditional tea as a food resource and cultural heritage.

Development of a Facility Management System for Underground Conduits Using Web Technologies (웹 기술을 이용한 지하 공동구의 시설물 관리 시스템 개발)

  • Ku, Kyong-I;Kim, Ji-Yoon;Ahn, Hyo-Jin;Kim, Joo-Sung;Kang, Jae-Mo;Kim, Youug-Jin;Kim, Yoo-Sung
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.2 s.14
    • /
    • pp.29-38
    • /
    • 2005
  • Even though underground conduits have became important city-infra structures which should be exhaustively and efficiently managed, there is few systems which supports the well-defined facility management standards. Due to the lack of the supporting systems, experts must visit underground conduits scattered several cities over the country to see and check the status of the underground conduits including built-in facilities. This type of management gives us a little bit delayed status information at the end of so much time and money costs. In this paper, to solve this problem and manage the conduit synthetically, we developed a web-based facility management system for underground conduits by using information technologies. The developed management system has a simplified map drawing interface to depict the overall architectures and locations of underground conduits and their built-in facilities into sketch maps. And, the system uses the 3D panorama image technology with zooming functions in addition to still images and video images to give the feeling of a spot inspection. Moreover, since the system accumulates the data of repair/reinforcement, occasional inspections and safety diagnosis, conduit managers can synthetically and effectively manage the facilities within underground conduits and themselves.

  • PDF

Bitmap Indexes and Query Processing Strategies for Relational XML Twig Queries (관계형 XML 가지 패턴 질의를 위한 비트맵 인덱스와 질의 처리 기법)

  • Lee, Kyong-Ha;Moon, Bong-Ki;Lee, Kyu-Chul
    • Journal of KIISE:Databases
    • /
    • v.37 no.3
    • /
    • pp.146-164
    • /
    • 2010
  • Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.

Trajectory Indexing for Efficient Processing of Range Queries (영역 질의의 효과적인 처리를 위한 궤적 인덱싱)

  • Cha, Chang-Il;Kim, Sang-Wook;Won, Jung-Im
    • The KIPS Transactions:PartD
    • /
    • v.16D no.4
    • /
    • pp.487-496
    • /
    • 2009
  • This paper addresses an indexing scheme capable of efficiently processing range queries in a large-scale trajectory database. After discussing the drawbacks of previous indexing schemes, we propose a new scheme that divides the temporal dimension into multiple time intervals and then, by this interval, builds an index for the line segments. Additionally, a supplementary index is built for the line segments within each time interval. This scheme can make a dramatic improvement in the performance of insert and search operations using a main memory index, particularly for the time interval consisting of the segments taken by those objects which are currently moving or have just completed their movements, as contrast to the previous schemes that store the index totally on the disk. Each time interval index is built as follows: First, the extent of the spatial dimension is divided onto multiple spatial cells to which the line segments are assigned evenly. We use a 2D-tree to maintain information on those cells. Then, for each cell, an additional 3D $R^*$-tree is created on the spatio-temporal space (x, y, t). Such a multi-level indexing strategy can cure the shortcomings of the legacy schemes. Performance results obtained from intensive experiments show that our scheme enhances the performance of retrieve operations by 3$\sim$10 times, with much less storage space.

이동형 의료영상 장치를 위한 JPEG2000 영상 뷰어 개발

  • 김새롬;김희중;정해조;강원석;이재훈;이상호;신성범;유선국
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2003.09a
    • /
    • pp.81-81
    • /
    • 2003
  • 목적 : 현재, 많은 병원이 방사선과 의료영상정보를 기존의 필름형태로 판독하고, 진료하는 방식에서 PACS 를 도입하여 디지털 형태로 영상을 전송, 저장, 검색, 판독하는 환경으로 변화하고 있다. 한편, PACS 가 가지는 가장 큰 제한점은 휴대성의 결핍이다. 본 연구는 이동형 장치가 가지는 호스트의 이동성 및 휴대성의 장점들을 살리면서, 무선 채널 용량의 한계, 무선 링크 사용이라는 제약점들을 감안하여 의료영상을 JPEG2000 영상압축 방식으로 부호화한 후 무선 환경을 고려한 전송 패킷의 크기를 결정하고자 하였으며, 무선 통신 중 발생되는 패킷 손실에 대응하기 위한 자동 오류 수정 기능도 함께 구현하고자하였다. 방법 : Window 2000 운영체계에서 의료영상을 로드하고, 데이터베이스화하며, 저장하고, 다른 네트워크와 접속, 제어가 가능한 PC급 서버를 구축하였다. 영상데이터는 무선망을 통해 전송하기 때문에 가장 높은 압축비율을 지원하면서 에너지 밀도가 높은 JPEG2000 알고리즘을 사용하여 영상을 압축하였다. 또한, 무선망 사용으로 인한 패킷 손실에 대비하여, 영상을 JPEG2000 방식으로 부호화한 후 각 블록단위로 전송하였다. 결과 : PDA에서 JPEG2000 영상을 복호화 하는데 걸리는 시간은 256$\times$256 크기의 MR 뇌영상의 경우 바로 확인할 수 있었지만, 800$\times$790 크기의 CR 흉부 영상의 경우 약 5 초 정도의 시간이 걸렸다. CDMA 1X(Code Division Multiple Access 1st Generation) 모듈을 사용하여 영상을 전송하는 경우, 256 byte/see 정도에서는 안정된 전송 결과를 보여주었고, 1 Kbyte/see 정도의 전송의 경우 중간 중간에 패킷이 손실되는 결과를 관찰할 수 있었다. 반면 무선 랜의 경우 이보다 더 큰 패킷을 전송하더라도 문제점은 발견되지 않았다. 결론 : 현재의 PACS는 유선과 무선사이의 인터페이스의 부재로 인해 유무선 연동이 되지 못하고 있다. 따라서 이동형 JPEG2000 영상 뷰어는 PACS가 가지는 문제점인 휴대성을 보완하기 위하여 개발되었다. 또한 무선망이 가지는 데이터 손실에 대하여서도 허용할 수 있는 범위에서 재전송을 가능하게 함으로서 약한 연결성을 보완하였다. 본 JPEG2000 영상 뷰어 시스템은 기존 유선상의 PACS와 이동형 장치간에 유기적인 인터페이스 역할을 하리라 기대된다.

  • PDF

A Concurrency Control Scheme for Client Transaction in Dual-Channel Broadcast Disk Environments (이중 채널 기반 방송 디스크 환경에서 읽기 전용 트랜잭션을 위한 동시성 제어 기법)

  • Lee, Sangho;Kim, Jinhong;Lee, Sooin
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.97-100
    • /
    • 2013
  • 최근 4세대(4G) 통신망으로의 전환의 가속화와 스마트 모바일 기기의 확산으로 인하여 무선 통신망에서 데이터 트래픽이 급증하고 있다. 이러한 급증하는 데이터 트래픽을 분산시키기 위하여 2개의 주파수 밴드를 사용하는 멀티 캐리어 기술이 선보이고 있다. 방송 디스크는 서버가 데이터베이스에 저장된 모든 데이터를 연속적으로 다수의 모바일 클라이언트에게 방송하고, 클라이언트는 방송 채널을 감시하여 원하는 데이터가 방송될 경우 방송 채널로부터 데이터를 수신하는 통신 구조이다. 이런 관점에서 방송 채널은 클라이언트가 데이터를 액세스할 수 있는 디스크의 역할을 담당한다. 본 논문에서는 무선 통신망이 멀티 캐리어를 지원할 경우, 클라이언트에서 실행되는 읽기 전용 트랜잭션의 정확성을 보장하기 위한 동시성 제어 기법(Dual-Channel based Concurrency Control: DCC)을 제안한다. 기존에 동시성 제어 기법들은 단일 방송채널에서 트랜잭션의 철회률을 줄이기 위하여 추가적인 제어 정보들을 방송하거나 방송 데이터의 타임스탬프 필드를 이용하고 있다. 클라이언트에서 실행되는 트랜잭션은 단일 방송 사이클이 아니라 여러 방송 사이클에 걸쳐서 실행된다. 이러한 방송 디스크 환경의 특징은 클라이언트 트랜잭션이 디스크에서 방송 인덱스를 판독하여 방송 프로그램 상에서 트랜잭션에 필요한 데이터가 방송 될 때까지 기다리게 된다. 이와는 달리 DCC는 주력 망과 보조 망에서 방송되는 방송 프로그램의 순서를 서로 다르게 하여 데이터 판독에 필요한 대기 시간을 줄일 수 있다. 보조망의 방송 프로그램의 순서는 주력망의 방송 프로그램 순서의 역순서로 방송함으로써 보조 망 또는 주력 망에서 실행되고 있는 트랜잭션이 다른 방송 채널의 방송 인덱스를 판독하지 않아도 방송 프로그램 순서를 예측할 수가 있다. 그 결과, DCC는 방송 디스크의 데이터 판독에 요구되는 대기시간을 줄여 읽기 전용 트랜잭션의 철회률을 줄일 수 있다는 장점을 갖는다.

  • PDF

Entropy-based Dynamic Histogram for Spatio-temporal Databases (시공간 데이타베이스의 엔트로피 기반 동적 히스토그램)

  • 박현규;손진현;김명호
    • Journal of KIISE:Databases
    • /
    • v.30 no.2
    • /
    • pp.176-183
    • /
    • 2003
  • Various techniques including histograms, sampling and parametric techniques have been proposed to estimate query result sizes for the query optimization. Histogram-based techniques are the most widely used form for the selectivity estimation in relational database systems. However, in the spatio-temporal databases for the moving objects, the continual changes of the data distribution suffer the direct utilization of the state of the art histogram techniques. Specifically for the future queries, we need another methodology that considers the updated information and keeps the accuracy of the result. In this paper we propose a novel approach based upon the duality and the marginal distribution to construct a histogram with very little time since the spatio-temporal histogram requires the data distribution defined by query predicates. We use data synopsis method in the dual space to construct spatio-temporal histograms. Our method is robust to changing data distributions during a certain period of time while the objects keep the linear movements. An additional feature of our approach supports the dynamic update incrementally and maintains the accuracy of the estimated result.

Mobile Transaction Processing in Hybrid Broadcasting Environment (복합 브로드캐스팅 환경에서 이동 트랜잭션 처리)

  • 김성석;양순옥
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.422-431
    • /
    • 2004
  • In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.