• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.183-196
• /
• 2011

There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from a data privacy perspective, it becomes difficult to identify all possible relationships between attributes from the different relations, considering a complex database schema. That is, seemingly harmless attributes may be linked to confidential information, leading to data leaks when building a model. Thus, we are at risk of disclosing unwanted knowledge when publishing the results of a data mining exercise. For instance, consider a financial database classification task to determine whether a loan is considered high risk. Suppose that we are aware that the database contains another confidential attribute, such as income level, that should not be divulged. One may thus choose to eliminate, or distort, the income level from the database to prevent potential privacy leakage. However, even after distortion, a learning model against the modified database may accurately determine the income level values. It follows that the database is still unsafe and may be compromised. This paper demonstrates this potential for privacy leakage in multi-relational classification and illustrates how such potential leaks may be detected. We propose a method to generate a ranked list of subschemas that maintains the predictive performance on the class attribute, while limiting the disclosure risk, and predictive accuracy, of confidential attributes. We illustrate and demonstrate the effectiveness of our method against a financial database and an insurance database.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (1)
• /
• pp.18-20
• /
• 1998

JDBC는 Java 응용 프로그램이나 apllet에서 SQL 문을 수행하기 위해서 Javasoft에서 정의한 Java API로서, DBMS에 비의존적이고 플랫폼에도 독립적인 Java 응용 프로그래밍 기법을 제공한다. 일반 DBMS 응용 프로그램과 마찬가지로 Java 응용 프로그램에서도 기존에 구축된 동기종 또는 이기종의 데이터베이스를 동시에 접근해서 처리해야 하는 경우가 발생하다. 이 경우 한 응용 내에서의 여러 DBMS 연결은 불가피하다. 이러한 다중 연결의 지원은 응용 프로그램을 추가하는 작업이나 데이터베이스 자료 변환 작업을 감소시키는 효과가 있다. 이 논문에서는 JDBC 명세서 1.2에 따라 구현된 net-protocol all-Java driver 타입의 JDBC 드라이버가, JDBC 응용 클라이언트와 DBMS드라이버를 관리함으로써 한 Java 응용 프로그램내에서 다중 연결을 지원하는 M-JDBC(Multiple Database supporting)드라이버의 구조를 제시한다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.635-638
• /
• 2006

Regression of conventional prediction techniques in data mining uses the model which is generated from the training step. This model is applied to new input data without any change. If this model is applied directly to time series, the rate of prediction accuracy will be decreased. This paper proposes an incremental regression for time series prediction like typhoon track prediction. This technique considers the characteristic of time series which may be changed over time. It is composed of two steps. The first step executes a fractional process for applying input data to the regression model. The second step updates the model by using its information as new data. Additionally, the model is maintained by only recent data in a queue. This approach has the following two advantages. It maintains the minimum information of the model by using a matrix, so space complexity is reduced. Moreover, it prevents the increment of error rate by updating the model over time. Accuracy rate of the proposed method is measured by RME(Relative Mean Error) and RMSE(Root Mean Square Error). The results of typhoon track prediction experiment are performed by the proposed technique IMLR(Incremental Multiple Linear Regression) is more efficient than those of MLR(Multiple Linear Regression) and SVR(Support Vector Regression).

• 국제초고층학회논문집
• /
• 제2권3호
• /
• pp.257-269
• /
• 2013

This study presents the development of an advanced multiple database-enabled design module for high-rise buildings (DEDM-HR), which seamlessly pools databases of multiple high frequency base balance measurements from geographically dispersed locations and merges them together to expand the number of available building configurations for the preliminary design. This feature offers a new direction for the research and professional communities that can be utilized to efficiently pool multiple databases therefore expanding the capability of an individual database and improving the reliability of design estimates. This is demonstrated, in this study, by the unprecedented fusion of two major established databases, which facilitates interoperability. The DEDM-HR employs a cyberbased on-line framework designed with user-friendly/intuitive web interfaces for the convenient estimation of wind-induced responses in the alongwind, acrosswind and torsional directions with minimal user input. In addition, the DEDM-HR embeds a novel feature that allows the use of wind characteristics defined in a code/standard to be used in conjunction with the database. This supplements the provisions of a specific code/standard as in many cases guidance on the acrosswind and torsional response estimates is lacking. Through an example, results from several international codes and standards and the DEDM-HR with the embedded features are compared. This provision enhances the scope of the DEDM-HR in providing an alternative design tool with nested general provisions of various international codes and standards.

• 정보과학회 논문지
• /
• 제43권11호
• /
• pp.1216-1222
• /
• 2016

대규모 웹 서비스의 등장으로 데이터의 규모가 점차 증가하는 추세이다. 이러한 대규모 데이터를 효율적으로 관리하기 위해 MySQL과 MariaDB와 같은 DBMS가 주로 사용되고 있으며, 이들은 데이터 관리를 위한 스토리지 엔진으로 InnoDB를 주로 사용한다. InnoDB는 ACID를 보장할 뿐만 아니라 대규모 데이터 처리에 적합하다는 장점이 있기 때문이다. InnoDB의 경우, I/O 성능 향상을 위해 버퍼 풀을 통해 데이터와 인덱스를 캐싱하며 락 경쟁(lock contention)을 줄이기 위해 다중 버퍼 풀을 지원한다. 그러나 다중 버퍼 풀 기법은 데이터 일관성 오버헤드를 증가시킨다. 본 논문에서는 다중 버퍼 풀 기법의 오버헤드를 분석한다. 실험 결과, 다중 버퍼 풀 기법을 사용함에 따라 락 경쟁이 최대 46.3%까지 완화되었지만 디스크 I/O와 fsync 명령이 증가하면서 DBMS의 처리량이 50.6%까지 떨어지는 현상을 확인하였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 춘계학술대회
• /
• pp.764-769
• /
• 2003

The paper introduces a development result for displacement measurement system of multiple moving objects based on image processing technique. The image processing method adopts inertia moment theory for obtaining the centroid of the targets and basic processing algorithms of gray, binary, closing, labeling and etc. To get precise displacement measurement in spite of multiple moving targets, a CCD camera with zoom is used and the position of camera is changed by a pan/tilt system. The fiducial marks on the fixed positions are used as the sensing points for the image processing to recognize the position errors in directions of X -Y coordinates. The precise alignment device is pan /tilt of X - Y type and the pan/tilt is controlled by DC servomotors which are driven by 80c196kc microprocessor based controller. The centers of the fiducial marks are obtained by a inertia moment method. By applying the developed precise position control system for multiple targets, the displacement of multiple moving targets are detected automatically and are stored in the database system in a real time. By using database system and internet, displacement data can be confirmed at a great distance and analyzed. The developed system shows the effectiveness such that it realizes the precision about 0.12mm in the position control of X -Y coordinates.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.721-725
• /
• 2004

Multiple-count problem is occurred when rectangle objects span across several buckets. The Cumulative Density (CD) histogram is a technique which solves multiple-count problem by keeping four sub-histograms corresponding to the four points of rectangle. Although it provides exact results with constant response time, there is still a considerable issue. Since it is based on a query window which aligns with a given grid, a number of errors may be occurred when it is applied to real applications. In this paper, we proposed selectivity estimation techniques using the generalized cumulative density histogram based on two probabilistic models: (1) probabilistic model which considers the query window area ratio, (2) probabilistic model which considers intersection area between a given grid and objects. In order to evaluate the proposed methods, we experimented with real dataset and experimental results showed that the proposed technique was superior to the existing selectivity estimation techniques. The proposed techniques can be used to accurately quantify the selectivity of the spatial range query on rectangle objects.

• 인터넷정보학회논문지
• /
• 제18권6호
• /
• pp.47-53
• /
• 2017

Recently, huge datasets have been generating rapidly in a variety of fields. Then, there is an urgent need for technologies that will allow efficient and effective processing of huge datasets. Therefore the problems of partitioning a huge dataset effectively and alleviating the processing overhead of the partitioned data efficiently have been a critical factor for scalability and performance in distributed database system. In our work we utilized multicore servers to provide scalable service to our distributed system. The partitioning of database over multicore servers have emerged from a need for new architectural design of distributed database system from scalability and performance concerns in today's data deluge. The system allows uniform access through a web service interface to concurrently distributed databases over multicore servers, using SQMD (Single Query Multiple Database) mechanism based on publish/subscribe paradigm. We will present performance results with the distributed database system built on multicore server, which is time intensive with traditional architectures. We will also discuss future works.

• 한국시뮬레이션학회논문지
• /
• 제12권2호
• /
• pp.55-62
• /
• 2003

The explosive Increase of wireless networks and the advancement of mobile devices lead to the expansion of mobile environment. In accordance with the development of mobile environment, the need to use mobile database is increased sharply, and also it accompanies the related problems. The current mobile database system is based on the centralized method from which a synchronized server manages multiple mobile database management system to synchronize. From this mobile system architecture, several kinds of problems can be detected such as the management of synchronization issues between mobile databases and the transaction management issues. Furthermore, the current mobile database management system does not consider any solution on the fault tolerance. To solve those problems, this paper proposes the mobile agent-based mobile database management system. The proposed system provide high confidence and efficiency by enhancing the network efficiency and fault tolerance through the mobile grouping.

• 산업기술연구
• /
• 제18권
• /
• pp.343-353
• /
• 1998

Effective design of a database is essential for operating application systems efficiently. This paper discusses database design for a geographic information system. This goals of database design are multiple: to satisfy the information content requirements of the specified users and applications; to provide a natural and easy-to-understand structuring of the information; and to support processing requirements and any performance objectives such as response time, processing time, and storage space. Database design is a very complex process and is decomposed in three phases: conceptual, logical, and physical design. In this paper, we first collect and analyze the requirements for a geographic information system. We also perform database design for these requirements through the three design phases systematically. Our results would contribute to the effective construction of a database for a geographic information system.