• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.715-718
• /
• 2009

Time series data is a sequence of data points, measured typically at successive, spaced at time intervals. Many devices for an efficient exploration is developed according as the items of time series data increase. Among these devices, there is a Timebox widget as a representative device of dynamic query for interactive data exploration. Timeboxes are rectangular query region of interest. The users can draw the region of interest using simple mouse manipulation and the query result sets is displayed. But there is a limitation to represent the concrete query region and Timeboxes visualize the query region inconsistent with the mental model of users. To resolve these problems, we propose a new device called DQB(Dynamic Query Band). DQB is a qeury region consisting of user defined polyline with a thickness on time series data. This device is possible to concretely specify the query region. Also, it provides a simple and convenient interface and a good conceptual model.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.455-461
• /
• 2009

프로그래밍 코드에서 쿼리문(INSERT, UPDATE,DELETE)을 작성할 때 주로 문자열을 조합해서 쿼리문을 작성하게 되는데, 이 방법은 일정한 체계가 없고, 또 테이블의 컬럼들이 많아지게 되면 코드 작성과 관리가 굉장히 불편한 직업들이 된다. Dynamic Query Class는 이러한 작업들을 효율적이고 생상성 있게 하기 위한 쿼리문 작성 클래스이다. 이 문서는 이 클래스들의 활용과 정의에 대해서 다룬다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.6
• /
• pp.103-113
• /
• 2014

This study designed and implemented a query model for consecutive analyses of dynamic multivariate graph data. First, the query model consists of two procedures; setting the discriminant function, and determining an alteration method. Second, the query model was implemented as a query system that consists of a query panel, a graph visualization panel, and a property panel. A Node-Link Diagram and the Force-Directed Graph Drawing algorithm were used for the visualization of the graph. The results of the queries are visually presented through the graph visualization panel. Finally, this study used the data of worldwide import & export data of small arms to verify our model. The significance of this research is in the fact that, through the model which is able to conduct consecutive analyses on dynamic graph data, it helps overcome the limitations of previous models which can only perform discrete analysis on dynamic data. This research is expected to contribute to future studies such as online decision making and complex network analysis, that use dynamic graph models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1286-1306
• /
• 2022

Searchable symmetric encryption (SSE) provides a safe and effective solution for retrieving encrypted data on cloud servers. However, the existing SSE schemes mainly focus on single keyword search in single client, which is inefficient for multiple keywords and cannot meet the needs for multiple clients. Considering the above drawbacks, we propose a scheme enabling dynamic multi-client and Boolean query in searchable symmetric encryption for cloud storage system (DMC-SSE). DMC-SSE realizes the fine-grained access control of multi-client in SSE by attribute-based encryption (ABE) and novel access control list (ACL), and supports Boolean query of multiple keywords. In addition, DMC-SSE realizes the full dynamic update of client and file. Compared with the existing multi-client schemes, our scheme has the following advantages: 1) Dynamic. DMC-SSE not only supports the dynamic addition or deletion of multiple clients, but also realizes the dynamic update of files. 2) Non-interactivity. After being authorized, the client can query keywords without the help of the data owner and the data owner can dynamically update client's permissions without requiring the client to stay online. At last, the security analysis and experiments results demonstrate that our scheme is safe and efficient.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1197-1206
• /
• 2016

Performing continuous skyline queries of dynamic data sets is now more challenging as the sizes of data sets increase and as they become more volatile due to the increase in dynamic updates. Although previous work proposed support for such queries, their efficiency was restricted to small data sets or uniformly distributed data sets. In a production database with many concurrent queries, the execution of continuous skyline queries impacts query performance due to update requirements to acquire exclusive locks, possibly blocking other query threads. Thus, the computational costs increase. In order to minimize computational requirements, we propose a method based on a multi-layer grid structure. First, relational data object, elements of an initial data set, are processed to obtain the corresponding multi-layer grid structure and the skyline influence regions over the data. Then, the dynamic data are processed only when they are identified within the skyline influence regions. Therefore, a large amount of computation can be pruned by adopting the proposed multi-layer grid structure. Using a variety of datasets, the performance evaluation confirms the efficiency of the proposed method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.1-8
• /
• 2010

For three and more rapidly moving vehicles, they want to search the nearest location for meeting. Each vehicle has a different velocity and a efficient method is needed for shifting a short distance. It is observed that the existing group nearest-neighbor query has been investigated for static query points; however these studies do not extend to highly dynamic vehicle environments. In this paper, we propose a novel Dynamic Nearest-Neighbor query processing for Multiple Vehicles (DNN_MV). Our method retrieves the nearest neighbor for a group of moving query points with a given vector and takes the direction of moving query points with a given vector into consideration for DNN_MV. Our method efficiently calculates a group nearest neighbor through a centroid point that represents the group of moving query points. The experimental results show that the proposed method operates efficiently in a dynamic group nearest neighbor search.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.27-44
• /
• 1999

Case-Based Reasoning(CBR) offers a new approach for developing knowledge based systems. CBR has several research issues which can be divided into two categories : (1) static issues and (2) dynamic issues. The static issues are related to case representation scheme and case data model, that is, focus on casebase which is a repository of cases. The dynamic issues, on the other hand, are related to case retrieval procedure and problem solving process, i.e. case adaptation phase. This research is forcused on retrieval procedure Traditional query processing accepts precisely specified queries and only provides exact answers, thus requiring users to fully understand the problem domain and the casebase schema, but returning limited or even null information if the exact answer is not available. To remedy such a restriction, extending the classical notion of query answering to approximate query answering(AQA) has been explored. AQA can be achieved by neighborhood query answering or associative query answering. In this paper, neighborhood query answering technique is used for AQA. To reinforce the CBR process, a new retrieval procedure(cooperative CBR) using neighborhood query answering is proposed. An neighborhood query answering relaxes a query scope to enlarge the search range, or relaxes an answer scope to include additional information. Computer Aided Process Planning(CAPP) is selected as cooperative CBR application domain for test. CAPP is an essential key for achieving CIM. It is the bridge between CAD and CAM and translates the design information into manufacturing instructions. As a result of the test, it is approved that the problem solving ability of cooperative CBR is improved by relaxation technique.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.294-297
• /
• 2005

Time series are comprehensively appeared and developed in many applications, ranging from science and technology to business and entertainrilent. Similarity search under time warping has attracted much interest between the time series in the large sequence databases. DTW (Dynamic Time Warping) is a robust distance measure and is superior to Euclidean distance for time series, allowing similarity matching although one of the sequences can elastic shift along the time axis. Nevertheless, it is more unfortunate that DTW has a quadratic time. Simultaneously the false dismissals are come forth since DTW distance does not satisfy the triangular inequality. In this paper, we propose an efficient range query algorithmbased on a new similarity search method under time warping. When our range query applies for this method, it can remove the significant non-qualify time series as early as possible before computing the accuracy DTW distance. Hence, it speeds up the calculation time and reduces the number of scanning the time series. Guaranteeing no false dismissals, the lower bounding function is advised that consistently underestimate the DTW distance and satisfy the triangular inequality. Through the experimental result, our range query algorithm outperforms the existing others.

• Asia pacific journal of information systems
• /
• v.8 no.1
• /
• pp.43-64
• /
• 1998

Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention to the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy(KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance, On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.