• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.162-169
• /
• 2009

The real-time traffic data is generated continuous and unbounded stream data type while intelligent transport system (ITS) needs to provide various and high quality services by combining with spatial information. Traditional database techniques in ITS has shortage for processing dynamic real-time stream data and static spatial data simultaneously. In this paper, we design and implement an advanced traffic monitoring system (ATMS) with the integration of existed data stream management system (DSMS) and spatial DBMS using IntraMap. Besides, the developed ATMS can deal with the stream data of DSMS, the trajectory data of relational DBMS, and the spatial data of SDBMS concurrently. The implemented ATMS supports historical and one time query, continuous query and combined query. Application programmer can develop various intelligent services such as moving trajectory tracking, k-nearest neighbor (KNN) query and dynamic intelligent navigation by using components of the ATMS.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.10
• /
• pp.1-10
• /
• 2016

In this paper, we propose an approach to generate machine readable context annotations for SPARQL Results. According to W3C Recommendations, the retrieved data from RDF or OWL data sources are represented in tabular form, in which each cell's data is described by only type and value. The simple query result form is generally useful, but it is not sufficient to explain the semantics of the data in query results. To explain the meaning of the data, appropriate annotations must be added to the query results. In this paper, we generate the annotations from the basic graph patterns in user's queries. We could also manipulate the original queries to complete the annotations. The generated annotations are represented using the RDFa syntax in our study. The RDFa expressions in HTML are machine-understandable. We believe that our work will improve the trustworthiness of query results and contribute to distribute the data to meet the vision of the Semantic Web.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.550-569
• /
• 2019

We propose approaches for improving Bloom filter in terms of false positive probability and membership query speed. To reduce the false positive probability, we propose special type of additional Bloom filters that are used to handle false positives caused by the original Bloom filter. Implementing the proposed approach for a routing table lookup, we show that our approach reduces the routing table lookup time by up to 28% compared to the original Bloom filter by handling most false positives within the fast memory. We also introduce an approach for improving the membership query speed. Taking the hash table-like approach while storing only values, the proposed approach shows much faster membership query speed than the original Bloom filter (e.g., 34 times faster with 10 subsets). Even compared to a hash table, our approach reduces the routing table lookup time by up to 58%.

• Journal of the Korean Society for information Management
• /
• v.36 no.4
• /
• pp.183-205
• /
• 2019

Among the various methods for identifying users's information needs, Log analysis methods can realistically reflect the users' actual search behavior and analyze the overall usage of most users. Based on the large quantity of query log big data obtained through the portal service of the National Archives of Korea, this study conducted an analysis by the information type and search result type in order to identify the users' information needs. The Query log used in analysis were based on 1,571,547 query data collected over a total of 141 months from 2007 to December 2018, when the National Archives of Korea provided search services via the web. Furthermore, based on the analysis results, improvement methods were proposed to improve user search satisfaction. The results of this study could actually be used to improve and upgrade the National Archives of Korea search service.

• Journal of the Korean Society for information Management
• /
• v.30 no.3
• /
• pp.23-48
• /
• 2013

This study compared and analyzed 15 CBMR (Content-based Music Retrieval) systems accessible on the web in terms of DB size and type, query type, access point, input and output type, and search functions, with reviewing features of music information and techniques used for transforming or transcribing of music sources, extracting and segmenting melodies, extracting and indexing features of music, and matching algorithms for CBMR systems. Application of text information retrieval techniques such as inverted indexing, N-gram indexing, Boolean search, truncation, keyword and phrase search, normalization, filtering, browsing, exact matching, similarity measure using edit distance, sorting, etc. to enhancing the CBMR; effort for increasing DB size and usability; and problems in extracting melodies, deleting stop notes in queries, and using solfege as pitch information were found as the results of analysis.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.1-15
• /
• 2009

This paper presents an assignment method of the multidimensional type inheritance indexes (MD-TIXs) to support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested element and type inheritance hierarchies. In this paper, we have analyzed the strategy of the query processing by using the MD-TIXs, and presented an assignment method of the MD-TIXs in the framework of complex queries, containing conjunctions of nested predicates, each one involving an Xpath having target types or domain types substitution. We first consider MD-TIX operations caused by updating of XML data-bases, and the use of the MD-TIXs in the case of a query containing a single nested predicate. And then, we consider the assignments of the MD-TIXs in the framework of more general queries containing nested predicates over overlapping paths that have common subpaths.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.138-143
• /
• 2002

This paper describes a framework for extending GIS databases to support moving object data type and query language. The rapid progress of wireless communications, positioning systems, and mobile computing devices have led location-aware applications to be essential components for commercial and industrial systems. Location-aware applications require GIS databases system to represent moving objects and to support querying on the motion properties of objects. For example, fleet management applications may require storage of information about moving vehicles. Also, advanced CRM(Customer Relationship Management) applications may require to store and query the trajectories of mobile phone users. In this trend, maintaining consistent information about the location of continuously moving objects and processing motion-specific queries is challenging problem. We formally define a data model and query language for mobile objects that includes complex evolving spatial structure, and propose core algebra to process the moving object query language. Main profit of proposed moving objects query language and algebra is that proposed model can be constructed on the top of GIS databases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1626-1633
• /
• 2010

In this paper, we implemented medicinal plant information system based on user requirement using Ajax technique which can retrieve data from the server asynchronously in the background without refresh webpage and jQuery which is a lightweight cross-browser javascript library. Also, we presented the source code handling the server response data used in the system and compared the features by the type of response data. This system shows the improvement of user interaction and response rates because of a simple response data from the server, client-side data processing and change of web page by manipulating the DOM tree and provides ease of use and convenient data access.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1437-1457
• /
• 2016

In outsourced databases, the cloud provides an authorized user with querying services on the outsourced database. However, sensitive data, such as financial or medical records, should be encrypted before being outsourced to the cloud. Meanwhile, k-Nearest Neighbor (kNN) query is the typical query type which is widely used in many fields and the result of the kNN query is closely related to the interest and preference of the user. Therefore, studies on secure kNN query processing algorithms that preserve both the data privacy and the query privacy have been proposed. However, existing algorithms either suffer from high computation cost or leak data access patterns because retrieved index nodes and query results are disclosed. To solve these problems, in this paper we propose a new kNN query processing algorithm on the encrypted database. Our algorithm preserves both data privacy and query privacy. It also hides data access patterns while supporting efficient query processing. To achieve this, we devise an encrypted index search scheme which can perform data filtering without revealing data access patterns. Through the performance analysis, we verify that our proposed algorithm shows better performance than the existing algorithms in terms of query processing times.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.44-52
• /
• 2012

This paper proposes to increase an efficiency of somebody searching information by a visualization of an unseen query words with well-selected user's intent structures. If a search engine identifies user's intent to pursue information, it would be an effective search engine. To do so, it is needed that relationships between query-words are to be visible after recovering words lost during formulated, and that an intention structure/elements is to be established. This paper will review previous studies, after then, define a simple structure of the search intent, and show a process to expand and to generate the query words appropriate to the intent structure with a method for the visualization of the query words. In this process, some examples and tests are necessary that one of the multiple intent structured layers is to assign to a range of query-words. Increasing/Decreasing an efficiency are analyzed to find. Future research is needed how to automate a process to extend structural nodules of user's intent.