• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2211-2232
• /
• 2018

The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

• The Journal of Information Technology and Database
• /
• v.7 no.2
• /
• pp.47-59
• /
• 2000

In this paper, we analyze the applicability of a general optimization algorithm to a database optimization problem. The index selection problem Is the problem to choose a set of indexes for a database in a way that the cost to process queries in the given workload is minimized subject to a given storage space restriction for storing indexes. The problem is well known in database research fields, and many optimization and/or heuristic algorithms have been proposed. Our work differs from previous research in that we formalize the problem in the form of non-linear Integer Programming model, and investigate the feasibility and applicability of a general purpose optimization algorithm, called OPBDP, through experiments. We implemented algorithms to generate workload data sets and problem instances for the experiment. The OPBDP algorithm, which is a non-linear 0-1 Integer Programming problem solver based on Davis-Putnam method, worked generally well for our problem formulation. The experiment result showed various performance characteristics depending on the types of decision variables, variable navigation methods and ocher algorithm parameters, and indicates the need of further study on the exploitation of the general purpose optimization techniques for the optimization problems in database area.

• Genomics & Informatics
• /
• v.16 no.4
• /
• pp.28.1-28.6
• /
• 2018

Due to the increasing interest in synonymous codons, several codon bias-related terms were introduced. As one measure of them, the tRNA adaptation index (tAI) was invented about a decade ago. The tAI is a measure of translational efficiency for a gene and is calculated based on the abundance of intracellular tRNA and the binding strength between a codon and a tRNA. The index has been widely used in various fields of molecular evolution, genetics, and pharmacology. Afterwards, an improved version of the index, named specific tRNA adaptation index (stAI), was developed by adapting tRNA copy numbers in species. Although a subsequently developed webserver (stAIcalc) provided tools that calculated stAI values, it was not available to access pre-calculated values. In addition to about 100 species in stAIcalc, we calculated stAI values for whole coding sequences in 148 species. To enable easy access to this index, we constructed a novel web database, named STADIUM (Species-specific tRNA adaptive index compendium). STADIUM provides not only the stAI value of each gene but also statistics based on pathway-based classification. The database is expected to help researchers who have interests in codon optimality and the role of synonymous codons. STADIUM is freely available at http://stadium.pmrc.re.kr.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.371-381
• /
• 2011

Recently, there are some social issues that personal sensitive data in database were let out. The best method to protect these personal sensitive data is used by the database encryption method. But the encrypting database makes the query difficult. So, there are a lot of study to protect the database and increase the query efficiency as well. In this paper, we analysed recent research trend to protect the sensitive data and propose the combined method using buckets and the bloom filter for the medical database with range property. Compared to bucket index model, the proposed method can increase bucket index value and protect data distribution exposure. We can estimate that this proposed method can improve searching time and efficiency.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.393-401
• /
• 2013

Most traditional databases exploit record-oriented storage model where the attributes of a record are placed contiguously in hard disk to achieve high performance writes. However, for search-mostly datawarehouse systems, column-oriented storage has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce fast column-oriented database model and then propose a new column-aware index management scheme for the high-speed column-oriented datawarehouse system. Our index management scheme which is based on enhanced $B^+$-Tree achieves high search performance by embedded flash index and unused space compression in internal and leaf nodes. Based on the results of the performance evaluation, we conclude that our index management scheme outperforms the traditional scheme in the respect of the search throughput and response time.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.259-264
• /
• 2001

This paper presents impact factors of domestic journals in mechanical engineering area to present an objective data for journal evaluation. For this purpose, reference data of 47 Korean journals are databased and analyzed. From the developed database, impact factor, immediacy index and self citation index are calculated.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.2
• /
• pp.327-348
• /
• 2005

The purpose of this study is to emphasize the importance of index definition and to prepare the basis of optimal index in bibliographic retrieval system. For the purpose, this research studied a index extraction theory on index tag definition and index normalization from the bibliographic marc database and analyzed a retrieval utilization rate of extracted index. In this experiment, we divided index between text-type and code-type about the generated 29,219,853 indexes from 2,200,488 bibliographic records and analyzed utilization rate by the comparison of index-type and index term of web logs. According to the result, the text-type indexes such as title, author, publication, subject are showed high utilization rate while the code-type indexes were showed low utilization rate. So this study suggests that the unused index is removed from index definition to optimize index.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.17 no.2
• /
• pp.49-56
• /
• 2009

In this study, a side collision accident reconstruction using database based on the deformed shape information from the collision test using model cars is suggested. A deformation index and angle index related to the deformed shape is developed to set the database for the collision accident reconstruction algorithm. Two small size RC cars are developed to carry out the side collision test. Several side collision tests according to the velocity and collision angles are performed for establishing the side collision database. A high speed camera with 1000fps is used to capture the motion of the car. A side collision accident reconstruction algorithm is developed and applied to find the collision conditions before the accident occurs. Two collision cases are tested to validate the database and the algorithm. The results obtained by the reconstruction algorithm show good match with original conditions with regard to the velocity and angle.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1653-1660
• /
• 2010

The user information stored in database have been leaked frequently. To protect information against malevolent manager on the inside or outside aggressor, it is one of the most efficient way to encrypt information and store to database. It is better to destruct information than not to use encrypted information stored in database. The encrypted database search system is developed variously, and used widely in many fields. In this paper, we implemented the scheme that can search encrypted document without exposing user's information to the untrusted server in mobile device. We compared and analyzed the result embodied with DES, AES, and ARIA based on symmetric key by searching time.

• Journal of Gastric Cancer
• /
• v.15 no.2
• /
• pp.87-104
• /
• 2015

Purpose: To assess real-world treatment patterns, health care utilization, costs, and survival among Medicare enrollees with locally advanced/unresectable or metastatic gastric cancer receiving standard first-line chemotherapy. Materials and Methods: This was a retrospective analysis of the Surveillance, Epidemiology, and End Results-Medicare linked database (2000~2009). The inclusion criteria were as follows: (1) first diagnosed with locally advanced/unresectable or metastatic gastric cancer between July 1, 2000 and December 31, 2007 (first diagnosis defined the index date); (2) ${\geq}65$ years of age at index; (3) continuously enrolled in Medicare Part A and B from 6 months before index through the end of follow-up, defined by death or the database end date (December 31, 2009), whichever occurred first; and (4) received first-line treatment with fluoropyrimidine and/or a platinum chemotherapy agent. Results: In total, 2,583 patients met the inclusion criteria. The mean age at index was $74.8{\pm}6.0years$. Over 90% of patients died during follow-up, with a median survival of 361 days for the overall post-index period and 167 days for the period after the completion of first-line chemotherapy. The mean total gastric cancer-related cost per patient over the entire post-index follow-up period was United States dollar (USD) $70,808{\pm}56,620$. Following the completion of first-line chemotherapy, patients receiving further cancer-directed treatment had USD 25,216 additional disease-related costs versus patients receiving supportive care only (P<0.001). Conclusions: The economic burden of advanced gastric cancer is substantial. Extrapolating based on published incidence estimates and staging distributions, the estimated total disease-related lifetime cost to Medicare for the roughly 22,200 patients expected to be diagnosed with this disease in 2014 approaches USD 300 millions.