• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.345-354
• /
• 2005

Subsequence matching is one of the most important operations in the field of data mining. The existing subsequence matching algorithms use only one index, and their performance gets worse as the difference between the length of a query sequence and the site of windows, which are subsequences of a same length extracted from data sequences to construct the index, increases. In this paper, we propose a new subsequence matching method based on index interpolation to overcome such a problem. An index interpolation method constructs two or more indexes, and performs search ing by selecting the most appropriate index among them according to the given query sequence length. In this paper, we first examine the performance trend with the difference between the query sequence length and the window size through preliminary experiments, and formulate a search cost model that reflects the distribution of query sequence lengths in the view point of the physical database design. Next, we propose a new subsequence matching method based on the index interpolation to improve search performance. We also present an algorithm based on the search cost formula mentioned above to construct optimal indexes to get better search performance. Finally, we verify the superiority of the proposed method through a series of experiments using real and synthesized data sets.

• Journal of Korean Foot and Ankle Society
• /
• v.25 no.3
• /
• pp.126-132
• /
• 2021

Purpose: This study examined whether there are seasonal variations in the number of plantar fasciitis cases from the database of the Korean Health Insurance Review & Assessment Service and an internet search of the volume data related to plantar fasciitis and whether there are correlations between variations. Materials and Methods: The number of plantar fasciitis cases per month was acquired from the Korean Health Insurance Review & Assessment Service from January 2016 to December 2019. The monthly internet relative search volumes for the keywords "plantar fasciitis" and "heel pain" were collected during the same period from DataLab, an internet search query trend service provided by the Korean portal website, Naver. Cosinor analysis was performed to confirm the seasonality of the monthly number of cases and relative search volumes, and Pearson and Spearman correlation analysis was conducted to assess the correlation between them. Results: The number of cases with plantar fasciitis and the relative search volume for the keywords "plantar fasciitis" and "heel pain" all showed significant seasonality (p<0.001), with the highest in the summer and the lowest in the winter. The number of cases with plantar fasciitis was correlated significantly with the relative search volumes of the keywords "plantar fasciitis" (r=0.632; p<0.001) and "heel pain" (r=0.791; p<0.001), respectively. Conclusion: Both the number of cases with plantar fasciitis and the internet search data for related keywords showed seasonality, which was the highest in summer. The number of cases showed a significant correlation with the internet search data for the seasonality of plantar fasciitis. Internet big data could be a complementary resource for researching and monitoring plantar fasciitis.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.204-218
• /
• 2005

XML has rapidly emerged as the standard for the interchange of data in numerous application areas. To support for efficient queries against XML data, many query languages have been designed. The query languages require the users to know the structure of the XML documents and specify search conditions on the structure. This path-based query against XML documents is a natural consequence of the hierarchical structure of XML. However, it is also desirable to allow the users to formulate no path queries against XML documents, to complement the current path-based queries. In this paper, we design a query expression capable of querying without knowledge about the structure of XML documents, and develop a query processor to evaluate no path queries.

• Journal of Platform Technology
• /
• v.11 no.1
• /
• pp.52-59
• /
• 2023

The importance of spatio-temporal trajectories for contact tracing has increased due to the recent COVID-19 pandemic. Spatio-temporal trajectories store time and spatial data of moving objects. In this paper, I propose query processing for spatio-temporal trajectories of moving objects. The spatio-temporal trajectory model of moving objects has point type spatial data for storing locations and timestamp type temporal data for time. A trajectory query is a query to search for pairs of users who have been in close contact by boarding the same bus. To process the trajectory query, I use the Geolife dataset provided by Microsoft. The proposed trajectory query processing method divides trajectory data by date and checks whether users' trajectories were nearby for each date to generate information about contacts as the result.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.69-77
• /
• 2009

Stream service environment demands real-time query processing for voluminous data which are ceaselessly delivered from tremendous sources. Typical R-tree based query processing technologies cannot efficiently handle such situations, which require repetitive and inefficient exploration from the tree root on every data event. However, many stream data including sensor readings show high locality, which we exploit to reduce the search space of queries to explore. In this paper, we propose a query processing scheme exploiting the locality of stream data. From the simulation, we conclude that the proposed scheme performs much better than the traditional ones in terms of scalability and exploration efficiency.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.59-70
• /
• 2003

Spatial data base system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to access unnecessary node by adapting pruning technique. But this method accesses more disks than necessary while pruning unnecessary nodes. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN objects using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit less disks than MINMAX method by the factor of maximum 22% and average 7%.

• Journal of the Korean Society for information Management
• /
• v.29 no.4
• /
• pp.101-121
• /
• 2012

Since IR systems which adopt only Boolean IR model can not provide ranked search result, users have to conduct time-consuming checking process for huge result sets one by one. This study proposes a method to provide search results ranked by using coupling information between tags instead of index weight information in Boolean IR model. Because document queries are used instead of general user queries in the proposed method, key tags used as queries in a relevant document are extracted. A variety of groups of Boolean queries based on tag couplings are created in the process of extracting queries. Ranked search result can be extracted through the process of matching conducted with differential information among the query groups and tag significance information. To prove the usability of the proposed method, the experiment was conducted to find research trend analysis information on selected research information. Aslo, the service based on the proposed methods was provided to get user feedback for a year. The result showed high user satisfaction.

• The Journal of the Korea Contents Association
• /
• v.16 no.6
• /
• pp.205-214
• /
• 2016

As a large amount of graph-structured data is widely used in various applications such as social networks, semantic web, and bio-informatics, keyword-based search over graph data has been getting a lot of attention. In this paper, we propose an efficient method for keyword search over graph data to find a set of top-k answers that are relevant as well as non-redundant in structure. We define a non-redundant answer structure for a keyword query and a relevance measure for the answer. We suggest a new indexing scheme on the relevant paths between nodes and keyword terms in the graph, and also propose a query processing algorithm to find top-k non-redundant answers efficiently by exploiting the pre-calculated indexes. We present effectiveness and efficiency of the proposed approach compared to the previous method by conducting an experiment using a real dataset.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.360-373
• /
• 2003

The Meta Search system proposed in this paper is operated based on relevance distribution Infer mation(RDI). It first evaluates the sources applicable to the search, and then selects the most appropriate source. According to the evaluation of the sources, it discreetly collects the documents from the concerned sources and classifies them into a useful order based on the RDI, which is an evaluation score of the sources. The documents are classified into order and presented to the user as a single search result. For this Purpose, this study presents evaluation factor models to present the RDI between the query, and source, and proposes a method for drawing out the RDI based on the evaluation factors. The system for selecting the most appropriate sources according to the query has been developed based on an algorithm that selects the best source. Finally, after searching the documents suitable for query from extracted sources, we present a Meta Search system, HoleInOne, that ranks and merges them.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.231-242
• /
• 2008

W3C has selected OWL as a standard for Web ontology description and a necessity of research on storage models that can store OWL ontologies effectively has been issued. Until now, relational model-based storage systems such as Jena, Sesame, and DLDB, have been developed, but there still remain several issues. Especially, they lead inefficient query processing performance. The structural problems of their low query processing performance are as follow: Jena has a simple structure which is not normalized and also stores most information in a single table. It exponentially decreases the performance because of comparison with unnecessary information for processing queries requiring join operations as well as simple search. The structures of storages(e.g., Sesame) have been completely normalized. Therefore it executes many join operations for query processing. The storages require many join operations to find simply a specific class. This paper proposes a storage model to resolve the problems that the query processing performance is decreased because of non-normalization or complete normalization of the existing storages. To achieve this goal, we analyze the problems of existing storage models as well as relations of OWL elements and query patterns. The proposed model, defined with the analysis results, provides an optimal normalized structure to minimize join operations or unnecessary information comparison. For the experiment of query processing performance, a LUBM data sets are used and query patterns are defined considering search targets and their hierarchical relations. In addition, this paper conducts experiments on correctness and completeness of query results to verify data loss of the proposed model, and the results are described. With the comparative evaluation results, our proposal showed a better performance than the existing storage models.