• Journal of Information Technology Applications and Management
• /
• v.10 no.1
• /
• pp.127-146
• /
• 2003

With the spread of Internet, e-business using Internet technology is being actively developed and operated. Currently, on behalf of the international e-business framework, International standard such as ebXML and Web Service is being advanced. We are able to publish and search business information through ebXML and Web Service and then actual trading between partners is accomplished. By the way, it is Registry that play an important part in e-business. Registry is an e-business infrastructure for enabling building, deploying, and the discovery of business Information. We can do e-business through Registries dynamically and share the resources. Representatives of Registry are ebXML and UDDI used as an international standard. We will meet with some problems when using Registries. ebXML Is focused on B2B collaborations and Web Service Is focused on application integrations. So we must use ebXML and Web Service characteristically, and sometimes use all at need. ebXML and Web Service contain business information by Registry specific way. So When using the services offered by ebXML and Web Service, we should access each Registry by using Registry specific tools. This thesis intended to integrate business information from ebXML Registry and UDDI Registry to accomplish e-business conveniently This thesis defined the common data model as well as integrated query language for integrated access to ebXML and Web Service along with design and implementation of the system.

• Geomechanics and Engineering
• /
• v.7 no.1
• /
• pp.37-53
• /
• 2014

A Web-based pile load test (WBPLT) system was developed and implemented in this study. Object-oriented and concept-based software design techniques were adopted to integrate the pile load test database into the system. A total of 673 case histories of pile load test were included in the database. The data consisted of drilled shaft and driven precast concrete pile axial load tests in drained, undrained, and gravel loading conditions as well as pre-analyzed data and back-calculated design parameters. Unified modeling language, a standard software design tool, was utilized to design the WBPLT system architecture with five major concept-based components. These components provide the static structure and dynamic behavior of system message flows in a visualized manner. The open-source Apache Web server is the building block of the WBPLT system, and PHP Web programming language implements the operation of the WBPLT components, particularly the automatic translation of user query into structured query language. A simple search and inexpensive query can be implemented through the Internet browser. The pile load test database is helpful, and data can be easily retrieved and utilized worldwide for research and advanced applications.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1277-1298
• /
• 2017

Related to the maximum vector problem, a skyline query is to discover dominating tuples from a set of tuples, where each defines an object (such as a hotel) in several dimensions (such as the price and the distance to the beach). A tuple, an instance of an object, dominates another tuple if it is equally good or better in all dimensions and better in at least one dimension. Traditionally, skyline queries are defined upon single-instance data or upon objects each of which is associated with an instance. However, in some cases, an object is not associated with a single instance but rather by multiple instances. For example, on a review website, many users assign scores to a product or a service, and a user's score is an instance of the object representing the product or the service. Such data is an example of multi-instance data. Unlike most (if not all) others considering the traditional setting, we consider skyline queries defined upon multi-instance data. We define the dominance calculation and propose an algorithm to reduce its computational cost. We use synthetic and real data to evaluate the proposed methods, and the results demonstrate their utility.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.125-134
• /
• 2009

A biological data acquisition based on web has emerged as a powerful tool for allowing scientists to interactively view entries form different databases, and to navigate from one database to another molecular-biology database links. In this paper, the biological conceptual model is constructed hybrid biological data model to represent interesting entities in the data sources to applying navigation rule property for each biological data source based on four biological data integrating layers to control biological data. When some user's requests for application service are occurred, we can get the data from database and data source via web service. In this paper, we propose a query processing model and execution structure based on integrating data layers that can search information on biological data sources.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.490-492
• /
• 2002

MPEG-7은 기존의 MPEG표준들과 다르게 컨텐츠 검색을 위하여 내용기반 검색에 필요한 요소 기술들을 제공하는 목적으로 개발된 표준이다. MPEG-7 메타데이터를 이용한 검색엔진으로 내용기반의 검색이 가능하다. 하지만, 사용자들이 지정만 Query에 대하여 DMIF 표준을 준수하면서 알맞은 컨텐츠와 HPEG-7 메타데이터를 실시간으로 전송하는 시스템은 현재 개발된 예가 없다. 따라서, 본 논문에서는 MPEG-7 메타데이터 검색엔진과 연동하기 위해 사용자가 요청하는 Query에 맞는 컨텐츠와 MPEG-7 메타데이터를 DMIF 스트리밍 엔진을 이용하여 실시간으로 전송하는 시스템을 설계해 보았다.

• Journal of Korea Multimedia Society
• /
• v.22 no.12
• /
• pp.1466-1480
• /
• 2019

This paper addresses the efficient processing of all-farthest-neighbors (AFN) queries in spatial network databases. Given a set of data points P={p₁,p₂,…,p_|p|} in a spatial network, where the distance between two data points p and s, denoted by dist (p,s), is the length of the shortest path between them, an AFN query is defined as follows: find the farthest neighbor ω(p)∈P of each data point p such that dist(p,ω(p)) ≥ dist(p,s) for all s∈P. In this paper, we propose a shared execution algorithm called FAST (for All-Farthest-neighbors Search in spatial neTworks). Extensive experiments on real-world roadmaps confirm the efficiency and scalability of the FAST algorithm, while demonstrating a speedup of up to two orders of magnitude over a conventional solution.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.562-571
• /
• 2000

이미지 데이터는 텍스트 데이터와는 달리 다양한 색상과 모양, 질감과 같은 비정형적인 특징을 가진다. 따라서 이미지 데이터베이스는 텍스트 기반의 전통 데이터베이스와는 다른 모델링 방법과 질의, 검색 방법을 사용한. 특히, 내용 기반 이미지 검색에서의 검색 속도와 정확도를 향상시키기 위해서는 새로운 복합 질의문 계획 생성 기법이 필요하다. 본 논문에서는 이를 위해 먼저, 단일 조건을 갖는 시각 질의에 대한 처리 기법들을 토대로 여러 조건을 갖는 복합 질의를 처리하기 위한 복합 질의문 계획 생성기법인 SSCC(Similarity Search for Conjunction Combination Query) 알고리즘을 제안한다. SSCC는 이미지 데이터베이스 검색 시스템에서 복합 질의를 처리하기 위한 질의 최적화 과정에서 질의 수행 시간과 투플 I/O를 최소화하는 질의문 계획을 생성하기 위해 사용된다. SSCC 알고리즘은 복합질의를 단일 질의들로 준해하고 퍼지 집합 이론을 도입하여 단일 질의의 결과들을 통합한다. 논문에서 연구된 내용 기반 복합 질의문 계획 생성 기법은 특정 이미지 영역에 국한되지 않으며 다양한 종류의 시각 질의를 수행하기 위한 효율적인 질의문 계획 생성 기법으로 사용될 수 있다.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.437-440
• /
• 2003

When we search database with a query image, the retrieval efficiency will vary from each kind of descriptor. Even the best representative descriptor, it results a few useless images that don't match with query image. This type of error can be reduced by adopting another descriptor which extracts features in different way. At present, the choice of descriptors is base on intuitive and experimental method. By theoretic accessing to the problem of descriptor choice, we can solve the given problem in the objective and rational way. In this study, we intend to make a composite of descriptors that can reduce retrieval error by adopting principal component analysis.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.455-461
• /
• 2002

Object-based image retrieval method is addressed. A new image segmentation algorithm and image comparing method between segmented objects are proposed. For image segmentation, color and texture features are extracted from each pixel in the image. These features we used as inputs into VQ (Vector Quantization) clustering method, which yields homogeneous objects in terns of color and texture. In this procedure, colors are quantized into a few dominant colors for simple representation and efficient retrieval. In retrieval case, two comparing schemes are proposed. Comparing between one query object and multi objects of a database image and comparing between multi query objects and multi objects of a database image are proposed. For fast retrieval, dominant object colors are key-indexed into database.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1373-1387
• /
• 2012

Contextual advertising is an important revenue source for major service providers on the Web. Ads classification is one of main tasks in contextual advertising, and it is used to retrieve semantically relevant ads with respect to the content of web pages. However, it is difficult for traditional text classification methods to achieve satisfactory performance in ads classification due to scarce term features in ads. In this paper, we propose a novel ads classification method that handles the lack of term features for classifying ads with short text. The proposed method utilizes a vocabulary expansion technique using semantic associations among terms learned from large-scale search query logs. The evaluation results show that our methodology achieves 4.0% ~ 9.7% improvements in terms of the hierarchical f-measure over the baseline classifiers without vocabulary expansion.