• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.21-32
• /
• 2024

This study analyzes the global literature on the black open-access phenomenon from 2011 to 2023. A bibliometric analysis was conducted using the Scopus database. The search strategy employed advanced queries with multiple synonymous terms to ensure exhaustive retrieval of relevant documents. The VOSviewer software was employed to visualize the co-occurrence networks. The findings reported 90 papers published during the study period. An evolving scholarly landscape was revealed, with heightened attention from 2016 onwards, peaking in 2017, 2021, and 2023. Articles constitute 83.3% of the total published documents. Singh and Srichandan are prolific authors, with 11.2% of the total publications. The United States contributes 18.9% of the papers, followed by India and Spain. Information Development and Scientometrics are pivotal journals in scholarly discussions about this scope, contributing 4.4% of publications. Co-occurrence network visualization revealed "Sci-Hub" and "open access" as the most used keywords in the global literature. The findings underscore the need for additional research to discover innovative business models to safeguard intellectual property rights while meeting researchers' evolving needs. The importance of this paper comes from being the first bibliometric study analyzing international literature related to this phenomenon, which provides a basis for future research efforts and policymaking.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.221-227
• /
• 2010

Web access sequence mining can discover the frequently accessed web pages pursued by users. Utility-based web access sequence mining handles non-binary occurrences of web pages and extracts more useful knowledge from web logs. However, the existing utility-based web access sequence mining approach considers web access sequences from the very beginning of web logs and therefore it is not suitable for mining data streams where the volume of data is huge and unbounded. At the same time, it cannot find the recent change of knowledge in data streams adaptively. The existing approach has many other limitations such as considering only forward references of web access sequences, suffers in the level-wise candidate generation-and-test methodology, needs several database scans, etc. In this paper, we propose a new approach for high utility web access sequence mining over data streams with a sliding window method. Our approach can not only handle large-scale data but also efficiently discover the recently generated information from data streams. Moreover, it can solve the other limitations of the existing algorithm over data streams. Extensive performance analyses show that our approach is very efficient and outperforms the existing algorithm.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1299-1313
• /
• 2010

Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL -index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the $i^{th}$ sublayer in the partitioned database has the objects that can be the top-i object in the partitioned one. To retrieve top k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sublayer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL -index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (ie., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sublayer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.61-68
• /
• 2004

Now, the representative researching trends of view managements for improving the query processing in multi-database system are focused on the materialized view mechanism and the signature view index mechanism. But when we compare with both mechanisms, the former mechanism's access time is faster than one of the latter's, and needs large space. The latter mechanism needs small space and the access time is slower than one of the former. These mechanisms are trade-off each other. Therefore, in case of query process using the view management, we are to improve the system performance and to reduce the access cost of disk input and output by suggesting a new mechanism mixing both the materialized view mechanism and the signature view index mechanism. We suggested that the structure of metadata and the algorithm about the new mired mechanism.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.11-20
• /
• 2008

An inevitable trend in the next generation wireless network environments is coexistence of different wireless access networks in a complementary, manner. In addition, mobile devices equipped with multiple air interfaces simultaneously executing diverse applications have been emerging, In such network environment, It is required that a solution for mobile users to seamlessly roam between different access networks as well as to satisfy QoS requirements of each application by efficiently utilizing coexisting various wireless access networks. In this paper, therefore, we propose a mobility management platform based on per-application end-to-end mobility management and cross-layer handover controls. Four core functional modules composing the proposed platform for end user devices are defined: Monitoring Agents, Profile Database, Decision Engine, and IP Agent. We show through simulations that the presented platform provides an improved QoS as it selectively utilizes the best available networks.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.4
• /
• pp.1-5
• /
• 2001

This study presents an electronic catalogue based cutting parameter selection system using MS Access software. The proposed system has been designed to electronically select proper cutting conditions based on the stored data base. The existing approaches used in most small and medium sized companies are basically to use manufacturing engineer's experience or to find the recommended values from the manufacturing engineer handbook. These processes are often time consuming and inconsistent, especially when a new engineer is involved. Therefore, this study proposes a simple, yet quick and consistent electronic catalogue based cutting parameter selection method which uses MS Access in terms of programming and database implementation. Consequently, the proposed system could automatically generate the proper cutting conditions (feed, depth of cut, and cutting speed) as soon as the input data (proper information about the tool and work material) is given. Thanks to the simple structure and popularity of the MS Access, the engineer could be quickly accustomed to the system and easily modify/insert/delete the database if necessary.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.12-23
• /
• 2005

In the past decade, advances in speed of commodity CPUs have iu out-paced advances in memory latency Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. To reduce memory access latency, cache memory incorporated in the memory subsystem. but cache memories can reduce the memory latency only when the requested data is found in the cache. This mainly depends on the memory access pattern of the application. At this point, previous research has shown that B+ trees perform much faster than T-trees because B+ trees are more cache conscious than T-trees, and also proposed 'Cache Sensitive B+trees' (CSB. trees) that are more cache conscious than B+trees. The goal of this paper is to make T-trees be cache conscious as CSB-trees. We propose a new index structure called a 'Cache Sensitive T-trees (CST-trees)'. We implemented CST-trees and compared performance of CST-trees with performance of other index structures.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.1
• /
• pp.379-403
• /
• 2015

Name Authority Control is useful not only to manage author information but also to gather other names of authors in order to provide access points in libraries and other institutes. The purpose of this study is to find problems through comparing and analyzing Literature Translation Institute of Korea Author Database, Korean name authority records of national libraries in the U. S., Japan and Korea. The results of the study are as follows. First, Literature Translation Institute of Korea Author Database missed some useful information about Korean writers in translated books in other countries. Second, the name authority file of Library of Congress and National Diet Library did not include the variant names, dates of authors' birth and death date, and filled out incorrect variant names with some birth and death dates. Third, English and Chinese character variants of Korean authors were not found in the National Library of Korea. To solve these problems, revisions of Korean author database, open access to National Library of Korea name authority file, and a strong participation of VIAF were suggested.

• Journal of Digital Convergence
• /
• v.18 no.5
• /
• pp.305-315
• /
• 2020

As the incidence and prevalence of dementia increases with our aging population, so does the social burden on our society, which calls for a special emphasis on need for early diagnosis. Thus, efforts are made to prevent dementia and early detection but with current diagnostic measures, these efforts appear futile. As a solution, it is crucial to integrate and standardize healthcare big data and analysis of each index. In order to increase use of large database, the Korea National Assembly passed the Data 3 Act focusing on open-access and sharing of database, but a follow-up legislation is needed a for safer utilization. In this study, we have identified number of foreign of foreign policies through review of prior researches on the topic leading to specific enforcement ordinances tailored to the Data 3 Act for safe access and utilization of database. We also aimed to establish secure process of data collection and disposal as well as governance at the national level to ensure safe utilization of healthcare big data.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.61-68
• /
• 2011

Due to the rapid development of the Internet, many companies in a variety of applications to users open an unspecified number of the current business environment, security of personal information about recent issues are often mentioned in terms of its importance may be the company's top priority. The government recently on personal information strengthening measures on information communications network law enacted into law which is applicable to various industries. Companies to protect the personal information of various measures to comply with these regulations, and arrange your personal information for internal management to enhance security fast security solution has been introduced. The number of used data is stored in the DBMS in terms of compliance with these regulations at the same time effectively to ensure data security and encryption measures, access control, audit, each separated by an implementation of the solution and how it compares with the best Database security plan allows you to explore as a this paper's security checklist.