• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.472-482
• /
• 1997

Multi-dimensional data play a crucial role in various fields, as like computer graphics, geographical information system, and multimedia applications. Indexing method fur multi-dimensional data Is a very Important factor in overall system performance. What is proposed in this paper is a new dynamic access method for spatial objects called HL-CIF(Hierarchically Layered Caltech Intermediate Form) tree which requires small amount of storage space and facilitates efficient query processing. HL-CIF tree is a combination of hierarchical management of spatial objects and CIF tree in which spatial objects and sub-regions are associated with representative points. HL-CIF tree adopts "centroid" of spatial objects as the representative point. By reflecting objects′sizes and positions in its structure, HL-CIF tree guarantees the high spatial locality of objects grouped in a sub-region rendering query processing more efficient.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.381-384
• /
• 2013

본 논문에서는 허밍기반 음원 검색 시스템을 위한 오디오 특징 시퀀스 데이터 색인 기법을 제안한다. 우선 Query-by-Singing/Humming (QbSH) 시스템의 특징 데이터베이스를 생성하기 위하여 MP3 와 같은 다성음원에서 주요 멜로디를 추출하여 시퀀스데이터를 생성하고, 고속 검색을 지원하기 위한 시퀀스데이터를 색인화한다. 본 논문에서는 최소 Dynamic Time Warping (DTW) 거리 기법, 시퀀스 추상화 기법, 상한 값 기반 DTW 기법과 같이 세 가지의 시퀀스 데이터의 색인화 기술을 제시하고 각각에 대한 문제점을 파악하고, 성능을 평가한다. 이를 통하여 향상된 검색 시간과 검색 정확도를 얻을 수 있다.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.673-676
• /
• 2004

To manage and query moving objects efficiently in MMDBMS, a memory index structure should be used. The most popular index structure for storing trajectories of moving objects is 3DR-tree. The 3DR-tree also can be used for MMDBMS. However, the volume of data can exceed the capacity of physical memory since moving objects report their locations continuously. To accommodate new location reports, old trajectories should be migrated to disk or purged from memory. This paper focuses on migration policies of a main memory index structure. Migration policies consist of two steps: (i) node selection, (ii) node placement. The first step (node selection) selects nodes that should be migrated to disk. The criteria of selection are the performance of insertion or query. The second step (node placement) determines the order of nodes written to disk. This step can be thought as dynamic declustering policies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1619-1624
• /
• 2012

If multiple Tags in the RFID System transmit their IDs to the Reader at the same time, tag identification time is delayed due to collisions. Therefore, to reduce the reader's identification time, an efficient anti-collision technology is needed. In this paper, we propose a hybrid anti-collision method based on the QT and DFSA. Then, the performances of proposed method are compared with the existing method through extensive simulations.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.202-208
• /
• 2014

Wireless network information services allow end systems to discover heterogeneous networks and spectrum available for secondary use at or near their current location, helping them to cope with increasing traffic and finite spectrum resources. We propose a unified architecture that allows end systems to find nearby base stations that are using either licensed, shared or unlicensed spectrum across multiple network operators. Our study evaluates the performance and scalability of spatial databases storing base station coverage area geometries. The measurement results indicate that the current spatial databases perform well even when the number of coverage areas is very large. A single logical spatial database would likely be able to satisfy the query load for a large national cellular network. We also observe that coarse geographic divisions can significantly improve query performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.78-83
• /
• 2010

프로그래밍 코드 안에서 작성하는 기존의 문자열 조합 방식으로 SELECT 쿼리를 작성할 때 일정한 규칙이 없이 다양한 형태로 쿼리가 작성되고 있으며, 이로 인해 쿼리 작성과 관리에 불편함을 주고 있다. 이런 불편함을 해소하고 일관된 규칙을 적용할 수 있는 쿼리 작성 방법을 객체지향 개념을 이용해서 SELECT 쿼리 객체를 정의하고 사용하는 방식으로 제시한다. 이를 위하여 기존 Dynamic Query Class[1]에 SELECT 쿼리 객체를 정의하여 추가하여 전체 상속 관계를 완성하고, SELECT 쿼리에서 둘 이상의 테이블 조인 관계를 객체를 사용해서 구현할 수 있음을 제시한다.

• Archives of design research
• /
• v.17 no.2
• /
• pp.437-450
• /
• 2004

Advancement of the media it will be able to express the development and information of computer system causes a problem, how to get the information from plenty of digital data. It needs to the research that provides efficient interface to the user and presents the information visualization standard to the author Consequently, From this paper it investigated analysis of the dynamic diagram and the computer software it led development process of information visualization and result of development outcome. Important developing forms of Information visualization are include Element, Expression, Interface. For developing information visualization model, First, Find the element from many kind of media, include graphic. Second, Find form of the expression from past the diagram which comes to be used plentifully. Last, To get appropriate result it applies the interface, necessary from the interface component which is various uses from computer program. like this, on this paper presents about important three visualization developing forms with detail examples.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.63-74
• /
• 2021

Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.48-60
• /
• 2004

XML documents consist of elements that are basic units of information. When the structure of XML documents is changed dynamically, we need to update structure information efficiently without changing the information of the index structure for fast retrieval. In this paper, we propose a dynamic indexing model scheme that updates the index structure in real time as the structure of XML documents is changed by insertion and deletion of elements. Our dynamic indexing model consists of a structure information representation method and a dynamic index structure. The structure information representation method supports various types of structure retrievals. Our dynamic index structure processes various structural queries efficiently. We show through various experiments that our method outperforms existing ones in processing various types of queries such as content based queries, structural queries and hybrid queries.

• East Asian Economic Review
• /
• v.21 no.2
• /
• pp.147-165
• /
• 2017

This study quantifies the dynamic interrelationship between the KOSPI index return and search query data derived from the Naver DataLab. The empirical estimation using a bivariate GARCH model reveals that negative contemporaneous correlations between the stock return and the search frequency prevail during the sample period. Meanwhile, the search frequency has a negative association with the one-week- ahead stock return but not vice versa. In addition to identifying dynamic correlations, the paper also aims to serve as a test bed in which the existence of profitable trading strategies based on big data is explored. Specifically, the strategy interpreting the heightened investor attention as a negative signal for future returns appears to have been superior to the benchmark strategy in terms of the expected utility over wealth. This paper also demonstrates that the big data-based option trading strategy might be able to beat the market under certain conditions. These results highlight the possibility of big data as a potential source-which has been left largely untapped-for establishing profitable trading strategies as well as developing insights on stock market dynamics.