• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.51-63
• /
• 2001

In this paper, we design and implement a XML document retrieval system to support structure-based retrieval using the BRS/Search system that is a commercial search engine, The implemented system in this paper represents the logical structure of XML documents as the directory structure of the Unix file system. In addition, we define the database schema of BRS/Search system to store documents, We also implement a ETID extractor, a structure information extractor, a storage manager and a query processor additionally to support content retrieval, structure retrieval, mixed retrieval and attribute retrieval in the BRS/Search system.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1404-1417
• /
• 1998

Currently, there exists two different methods for database retrieval in the internet. First is to use the search engine and the second is to use the plug-in or ActiveX technology, If a search engine, which makes use of indices built from keywords of simple text data in order to do a search, is used when accessing a database, first it is not possible to access more than one database at a time, second it is also not possible to support various conditional retrievals as in using query language, and third the set of data received might include many unwanted data, in other words, precision rate might be relatively low. Plug in or Active technology make use of Web browset to execute chents' query in order to do a database retrieval. Problems associated with this is that it is not possible to activate more than one DBMS simultaneously even if they are of the same data model. sefond it is not possible to execute a user query other than the ones thai arc previou sly defined by the client program In this paper, to resolve those aforementioned problems we design and implement database retrieval system using a virtual database, which makes it possible to provide direct query jntertacc through the conventional Web browser. We assume that the virtual database is designed and aggregated from more than one relational database using the same data model.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.809-822
• /
• 2004

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.

• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.793-798
• /
• 2009

In this paper, the performances of implementation real-time book search service of government library using OpenAPI. Since 2000, each self-government made a governmnt library for local resident because of policies to encourage reading. Each self-government library services book perusal and lend free for local resident. In current system local residents visit to a library for lending, returning and reading books. And each library run by a self-governing administration provides their own homepage for searching service as well as booking. For each services are not unified, however, it is not easy for lenders to search and lend these enormous books which are spread each library. Accordingly, we present a plan which using organization of every system established now in each library as it is, for a scheme of database by libraries' efficient unification and search, a network of TCP/IP and application which connects each library's database, servicing which uses Open API a check books through real time accessing Database.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2005.05a
• /
• pp.142-143
• /
• 2005

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.423-430
• /
• 2003

Generally, elements of DRM(Digital Road Map) consist of road, background and landmark data. The landmark, expressed as text and symbol, on map and additional search data are processed by GISSD(Geo-spatial Information System Service Data). This paper aims to develop the DBMS(Database Management System) for operating landmark and search data, and to discuss the characteristics and application of the DBMS. To accomplish the two objectives, the following four tasks were performed in this study. First, the working scopes of field survey and specification to construct the GISSD were defined. Second, the suggested process of manufacture and design of database were described. Third, the software for required construction and management of the system were developed. Lastly, the properties of developed system and data were analyzed. Especially, the efforts for the GISSD in this study are expected to provide a direct use and practical application to the creation of landmark in DRM and search data.

• ETRI Journal
• /
• v.38 no.3
• /
• pp.518-528
• /
• 2016

The searching of an extensive document database for documents that are locally similar to a given query document, and the subsequent detection of similar regions between such documents, is considered as an essential task in the fields of information retrieval and data management. In this paper, we present a framework for such a task. The proposed framework employs the method of short-read mapping, which is used in bioinformatics to reveal similarities between genomic sequences. In this paper, documents are considered biological objects; consequently, edit operations between locally similar documents are viewed as an evolutionary process. Accordingly, we are able to apply the method of evolution tracing in the detection of similar regions between documents. In addition, we propose heuristic methods to address issues associated with the different stages of the proposed framework, for example, a frequency-based fragment ordering method and a locality-aware interval aggregation method. Extensive experiments covering various scenarios related to the search of an extensive document database for documents that are locally similar to a given query document are considered, and the results indicate that the proposed framework outperforms existing methods.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.388-396
• /
• 2016

Through the correspondence works with international electrotechnical vocabulary(IEV) in the smart grid field and power information technology field, we analyzed cases for discussion of terms and definitions in the IEV and then proposed an advanced procedure and computing system for standardization of International Electronical Committee(IEC) terminologies. The standardization procedure consists of processes for existing terminology, new terminology and correspondent terminology which have different structures. An example of the standardization work of correspondent terminology is given. The standardization computing system are based on the process for terminology extraction, terminology verification and terminology management which could provide the Wikipedia type terminology search function. In order to prevent that there exist multiple terminologies in IEV, the database search system is needed to be developed. We proposed the 'IEV_Term_Search' program which is the database search system. Terminology standardization of different technical committees(TC) and completion of the IEV to promote cooperation between TC 1 and the TCs must be followed by revision and standardization using the standardization computing system.

• IE interfaces
• /
• v.16 no.1
• /
• pp.8-15
• /
• 2003

With rapid growth of internet technology, companies have developed an information system such as the electronic catalog for product data in the E-Business. Due to the heuristic nature of the catalog search for proper tools in the specific process, the intelligent and user friendly methods residing in the search process give a comfortable environment even for the beginners in the field. In this paper, we develop a web based catalog for machining tools especially in Milling process. It has two distinct procedures for the users of the catalog; Search and Analysis. The Search is to select a proper cutter, insert, component combination in the developed relational database based on the cutting process and material. The Analysis is to suggest a recommended optimal cutting conditions based on the machining tools and selected materials. All of these procedures are stored in a server with a program based on the ASP and Java Script where the procedure is initiated by the client using the internet which is accessed through insert. With the success on implementing the above engineering database in the internet, we can provide the foundation for developing PDM with heuristic procedure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.1063-1066
• /
• 2005

Most reading systems that supply various study data generally support keyword search. But the usual keyword matching techniques have a problem to require the exact keyword matching, and could not find similar field materials. Futhermore, testing materials have too little information to apply the keyword matching search. To solve these problems, this thesis proposes the method to extract the important keyword from study data and to construct the database automatically when the data are stored at the storage. And using prepared similar terminology database, we suggest the intelligent and efficient technique to find study materials.