• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.1-12
• /
• 2015

NAND flash memory has being used for storage systems widely, because it has good features which are low-price, low-power and fast access speed. However, NAND flash memory has an in-place update problem, and therefore it needs FTL(flash translation layer) to run for applications based on hard disk storage. The FTL includes complex functions, such as address mapping, garbage collection, wear leveling and so on. Futhermore, implementation of the FTL on low-power embedded systems is difficult due to its memory requirements and operation overhead. Accordingly, many index data structures for NAND flash memory have being studied for the embedded systems. Overall performances of the index data structures are enhanced by a decreasing of page write counts, whereas it has increased page read counts, as a side effect. Therefore, we propose an index management method using a page mapping log table in $B^+$-Tree based on NAND flash memory to decrease page write counts and not to increase page read counts. The page mapping log table registers page address information of changed index node and then it is exploited when retrieving records. In our experiment, the proposed method reduces the page read counts about 61% at maximum and the page write counts about 31% at maximum, compared to the related studies of index data structures.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2011.08a
• /
• pp.29-34
• /
• 2011

최근 인용 네트워크 분석을 통해서 단일 문헌의 인용 영향력을 측정하려는 시도가 다양하게 전개되고 있다. 널리 알려진 PageRank를 보완하려는 일부 시도와 함께 h-index를 단일 문헌의 인용 영향력 측정에 적용한 단일문헌 h-index도 제안되었다. 이 연구에서는 Web of Science에서 검색한 계량정보학 분야 문헌집합을 대상으로 여러 측정 방식의 특징을 비교해본 후, 새로운 인용지수 2종을 제안하였다. 제안한 인용지수는 PageRank처럼 전역 네트워크 분석 방식인 지수 1종과 h-index처럼 지역 네트워크 분석 방식인 지수 1종으로서 상황에 따라 선택하여 사용할 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.1-9
• /
• 2019

In this paper, we propose a Small Active Command scheme which reduces the power consumption of the command bus to DRAM. To do this, we target the ACTIVE command, which consists of multiple packets, containing the row address that occupies the largest size among the addresses delivered to the DRAM. The proposed scheme identifies frequently referenced row addresses as Hot pages first, and delivers index numbers of small caches (tables) located in the memory controller and DRAM. I-ACTIVE and I-PRECHARGE commands using unused bits of existing DRAM commands are added for index number transfer and cache synchronization management. Experimental results show that the proposed method reduces the command bus power consumption by 20% and 8.1% on average in the close-page and open-page policies, respectively.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.707-710
• /
• 2000

WWW(World wide Web) is a place where many laymen receive and send the information at the worldwide. A visualization of WWW is very important as one of functions helping to retrieve and browse the information. However, as the information volume displayed at one time is limited by a screen size, it is useful to limit the volume of information capable for users to browse. In this report, we propose the page-index, which extract its information according to degree of user’s interest. This index is a numbers, which relate the user’s interest with verbal and structural characteristics of homepages. The homage-index constructed with sequence of this index are useful to help a user’s browsing. We constructed the estimating system about an article of commerce and really tried to estimate. From this trial, we verified the usefulness of the page-index, homepage-index.

• Journal of Korean Library and Information Science Society
• /
• v.41 no.3
• /
• pp.155-183
• /
• 2010

A book index is a locater system that ordinarily connects a set of terms from a text of a book to the page where they occur in the book's text. The DDC Relative Index differs somewhat in both of this matters. Its terms refers to classification notations and their corresponding category statements as found in the schedule text rather than to page numbers. The index is the final equipment of a classification scheme. The index is of primary importance to any classification scheme. Therefore The purpose of this study is to analysis DDC Relative Index.

• Journal of the Korean Society for information Management
• /
• v.30 no.1
• /
• pp.179-191
• /
• 2013

Since information scientists have begun trying to quantify significant research trends in scientific publications, '-metrics' research such as 'bibliometrics', 'scientometrics', 'informetrics', 'webometrics', and 'citation analysis' have been identified as crucial areas of information science. To illustrate the dynamic research activities in these areas, this study investigated the major contributors of '-metrics' research for the last decade at three levels: nations, institutions, and documents. '-metrics' literature of this study was obtained from the Science Citation Index for the years 2001-2011. In this analysis, we used Pathfinder network, PNNC algorithm, PageRank and several indicators based on h-index. In terms of international collaborations, USA and England were identified as major countries. At the institutional level, Katholieke University, Leuven and the University of Amsterdam in Europe and Indiana University and the Office of Naval Research in the USA have led co-research projects in informetrics areas. At the document level, Hirsch's h-index paper and Ingwersen's web impact factor paper were identified as the most influential work by two methods: PageRank and single paper h-index.

• Journal of the Korean Society for information Management
• /
• v.32 no.4
• /
• pp.205-221
• /
• 2015

The impact of a journal is commonly used as the impact of an individual paper within that journal. It is problematic to interpret a journal's impact as a single paper's impact of the journal, so there are several researches to measure a single paper's impact with its own citation counts. This study applied 8 impact indicators to Korean Citation Index database and examined discipline bias of each indicator. Analyzed indicators are simple citation counts, PageRank, f-value, CCI, c-index, single publication h-index, single publication hs-index, and cl-index. PageRank has the least discipline bias at highly ranked papers and journal bias in a discipline. On the contrary, simple citation counts showed strongly biased results toward a certain discipline or a journal. KCI database provides only simple citation counts. It needs to show PageRank (global indicator) to discover influential papers in diverse areas. Furthermore it needs to consider to provide the best of local indicators. Local indicators can be calculated only with papers in users' search results because they uses citation counts of citing papers and the number of references. They are more efficient than global indicators which explore the whole database. KCI should also consider to provide Cl-index (local indicator).

• Journal of Industrial Technology
• /
• v.15
• /
• pp.235-244
• /
• 1995

In this paper, we propose a bulk-load algorithm for $B^+-trees$, the most widely used index structures in database systems. The main characteristic of our algorithm is to simultaneously process all the keys to be placed on each $B^+-trees$ page when accessing the page. This avoids the overhead for accessing the same page multiple times, which results from applying the $B^+-trees$ insertion algorithm repeatedly. For performance evaluation, we analyze our algorithm in terms of the number of disk accesses. The results show that the number of disk accesses excluding those in the redistribution process in identical to the number of $B^+-trees$ pages. Considering that the redistribution process is an unavoidable preprocessing step for bulk-loading, our algorithm requires just one disk access per $B^+-trees$ page, and therefore turns out to be optimal. We also present performance tendancy according to the changes of parameter values via simulation.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.593-604
• /
• 2001

A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.269-281
• /
• 2011

For the MD-TIX(multidimensional type inheritance index) that supports query processing for the type inheritance concept in XML databases, this paper presents an index tuning algorithm that enhances the performance of the XML query processing according to the query pattern. The MD-TIX uses a multidimensional index structure to support complex XML queries involving both nested elements and type inheritance hierarchies. In this index tuning algorithm, we first determine a shape of index page regions by using the query information about the user's query pattern, and then construct an optimal MD-TIX by applying a region splitting strategy that makes the shape of the page regions into the predetermined one. The performance evaluation results indicate that the proposed tuning algorithm builds an optimal MD-TIX by a given query pattern, and in the case of the three-dimensional query regions for the nested predicates of path length 2, the performance is much enhanced according to the skewed degree of the query region's shape.