• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.193-199
• /
• 2013

In this paper, a user search history based potential query recommendation system is proposed to enable the user of information search system to represent one's potential desire for information in terms of query and to facilitate the desired information to be searched. The proposed system has analyzed the association with the existing users's search histories based on the users' search query, and it has extracted the users's potential desire for information. The extracted potential desire for information is represented in terms of recommended query and thereby made recommendations to users. In order to analyze the effectiveness of the system proposed in this paper, we conducted behavioral experiments by using search histories of 27656. As a result of behavioral experiments, the experiment subjects were found to show a statistically significant higher level of satisfaction when using the proposed system as compared to using general search engines.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.9
• /
• pp.3759-3765
• /
• 2015

Background: Approaches in disruption of MDM2-p53 interactions have now emerged as an important therapeutic strategy in resurrecting wild type p53 functional status. The present study highlights virtual screening strategies in identification of high affinity small molecule non-peptidic inhibitors. Nutlin3A and RG7112 belonging to compound class of Cis-imidazoline, MI219 of Spiro-oxindole class and Benzodiazepine derived TDP 665759 served as query small molecules for similarity search with a threshold of 95%. The query molecules and the similar molecules corresponding to each query were docked at the transactivation binding cleft of MDM2 protein. Aided by MolDock algorithm, high affinity compound against MDM2 was retrieved. Patch Dock supervised Protein-Protein interactions were established between MDM2 and ligand (query and similar) bound and free states of p53. Compounds with PubCid 68870345, 77819398, 71132874, and 11952782 respectively structurally similar to Nutlin3A, RG7112, Mi219 and TDP 665759 demonstrated higher affinity to MDM2 in comparison to their parent compounds. Evident from the protein-protein interaction studies, all the similar compounds except for 77819398 (similar to RG 7112) showed appreciable inhibitory potential. Of particular relevance, compound 68870345 akin to Nutlin 3A had highest inhibitory potential that respectively showed 1.3, 1.2, 1.16 and 1.26 folds higher inhibitory potential than Nutilin 3A, MI 219, RG 7112 and TDP 1665759. Compound 68870345 was further mapped for structure based pharamacophoric features. In the study, we report Cis-imidazoline derivative compound; Pubcid: 68870345 to have highest inhibitory potential in blocking MDM2-p53 interactions hitherto discovered.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.31-38
• /
• 2018

As the use of open source databases grows, so does need to evaluate, the performance of search queries for these databases. This paper compares the search query performance of SQL-based open source databases with commercial databases through experiments. The targets are MySql, MariaDB, and MS-SQL Server. In this study, the execution time of various types of search queries are measured. Also, search query performance was experimented according to change of index and number of tuples. Experimental results show that SQL-based open source databases have the potential to replace commercial databases when indexes are used and the number of tuples is not very large.

• The Journal of the Korea Contents Association
• /
• v.15 no.7
• /
• pp.30-42
• /
• 2015

In this paper, we propose a new skyline query processing scheme to enhance accuracy of query processing and communication cost in mobile P2P environments. The proposed scheme consists of three stages such as the pre-skyline processing, the query transmission range extension policy, and the continuous skyline query processing. In the pre-skyline processing, a peer selects the candidate filtering objects who have the potential to be selected. By doing so, the proposed scheme reduces the filtering cost when processing the query. In the query transmission range extension policy, we have improved the accuracy by extending the query transmission range. In addition, it can handle continuous skyline query by performing the monitoring after the first skyline query processing. In order to show the superiority of the proposed method, we compare it with the existing schemes through performance evaluation. As a result, it was shown that the proposed scheme outperforms the existing schemes.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

• Interdisciplinary Bio Central
• /
• v.4 no.4
• /
• pp.11.1-11.8
• /
• 2012

Genes that are indispensable for survival are referred to as essential gene. Due to the momentous significance of these genes for cellular activity they can be selected potentially as drug targets. Here in this study, an essential gene for Streptococcus suis was predicted using coherent statistical analysis and powerful genome comparison computational method. At first the whole genome protein scatter plot was generated and subsequently, on the basis of statistical significance, a reference genome was chosen. The parameters set forth for selecting the reference genome was that the genome of the query (Streptococcus suis) and subject must fall in the same genus and yet they must vary to a good degree. Streptococcus pneumoniae was found to be suitable as the reference genome. A whole genome comparison was performed for the reference (Streptococcus pneumoniae) and the query genome (Streptococcus suis) and 14 conserved proteins from them were subjected to a screen for potential essential gene property. Among those 14 only one essential gene was found to be with impressive similarity score between reference and query. The essential gene encodes for a type of 'Clp protease'. Clp proteases play major roles in degrading misfolded proteins. Results found here should help formulating a drug against Strptococcus suis which is responsible for mild to severe clinical conditions in human. However, like many other computational studies, the study has to be validated furthermore through in vitro assays for concrete proof.

• Journal of the Korea Society for Simulation
• /
• v.24 no.2
• /
• pp.31-39
• /
• 2015

Unemployment is related to social issues as well as personal economics activity so various policies have been made to reduce the unemployment rate in many countries. Because of delay inherent in the survey mechanism to collect unemployment data, it takes lots of time to acquire survey unemployment data. To develop proper policies for reducing unemployment rate at the right time, it is quite critical to obtain faster and more accurate information concerning about unemployment level. To remedy this problem, recently an advanced analytics utilizing internet queries is suggested. To examine the potential of Web query information, this research investigates the usefulness of internet activity data to predict Korean unemployment rate. One of selected web-query data(unemployment claim) has a quite strong correlation with unemployment rate. This research employes a time series approach of the ARIMA model that utilizes the information of keyword queries provided by the Naver(Korean representative portal site) trend together with unemployment rate data provisioned from Statistics Korea. With respect to model selection guidelines of mean squared error and prediction error, the model with utilizing the web query information shows better results than the model without such information. This suggests that there is a strong potential for the used method, which needs to be further explored.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.1-20
• /
• 2013

Over the past generation, data warehousing and online analytical processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While MOLAP systems do indeed provide impressive performance on common analytics queries, they tend to have limited scalability. Conversely, ROLAP's table oriented model scales quite nicely, but offers mediocre performance at best relative to the MOLAP systems. In this paper, we describe a storage and indexing framework that aims to provide both MOLAP like performance and ROLAP like scalability by essentially combining some of the best features from both. Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage model. Specifically, it utilizes an OLAP algebra coupled with a domain specific query optimizer, to map user queries directly to the storage and indexing framework. Experimental results demonstrate that not only does the design improve upon more naive approaches, but that it does indeed offer the potential to optimize both query performance and scalability.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.211-234
• /
• 2007

In e-business, XML is a major format of data and it is essential to efficiently process queries against XML data. XML query caching has received much attention for query performance improvement. In employing XML query caching, some efficient technique of cache replacement is required. The previous techniques considered as a replacement unit either the whole query result or the path in the query result. The former is simple to employ but it is not efficient whereas the latter is more efficient and yet the size difference among the potential victims is large, and thus, efficiency of caching would be limited. In this paper, we propose a new technique where the element in the query result is are placement unit to overcome the limitations of the previous techniques. The proposed technique could enhance the cache efficiency to a great extent because it would not pick a victim whose size is too large to store a new cached item, the variance in the size of victims would be small, and the unused space of the cache storage would be small. A technique of XML semantic cache replacement is presented which is based on the replacement function that takes into account cache hit ratio, last access time, fetch time, size of XML semantic region, size of element in XML semantic region, etc. We implemented a prototype XML semantic cache system that employs the proposed technique, and conducted a detailed set of experiments over a LAN environment. The experimental results showed that our proposed technique outperformed the previous ones.

• Korean Management Science Review
• /
• v.32 no.3
• /
• pp.91-103
• /
• 2015

This study recognizes that there is a correlation between the movement of the financial market and the sentimental changes of the public participating directly or indirectly in the market, and applies the relationship to investment strategies for stock market. The concerns that market participants have about the economy can be transformed to the search terms that internet users query on search engines, and search volume of a specific term over time can be understood as the economic trend of big data. Under the hypothesis that the time when the economic concerns start increasing precedes the decline in the stock market price and vice versa, this study proposes three investment strategies using casuality between price of domestic stock market and search volume from Naver trends, and verifies the hypothesis. The computational results illustrate the potential that combining extensive behavioral data sets offers for a better understanding of collective human behavior in domestic stock market.