• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.752-758
• /
• 2012

SNS(Social Networking Services) is oneline service that enable users to construct human network through their relation on web, such as following relation, friend relation, and etc. Recently, owing to the advent of digital devices (smart phone, tablet PC) which embedded GPS some applications which provide services with spatial relevance and social relevance have been released. Such an online service is called LBSNS. It is required to use spatial filtering so as to build the LBSNS system that enable users to subscribe information of interesting area. For spatial filtering, user and tweet attaches location information which divide into static property presenting fixed area and dynamic property presenting user's area changed along the moving user. In the case of using a location information including dynamic property, Continuous query occurred from the moving user causes the problem in server. In this paper, we propose spatial filtering algorithm using Virtual Grid for reducing frequency of query, and conclude that frequency of query on using Virtual Grid is 93% decreased than frequency of query on not using Virtual Grid.

• 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.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.75-94
• /
• 2009

Since XML emerged as a standard for data exchange on the web, it has been established as a core component in e-Commerce and efficient query processing over XML data in ubiquitous computing environment has been also receiving much attention. Recently, the techniques were proposed whereby an XML document is fragmented into XML fragments to be streamed and the mobile clients receive the stream while processing queries over it. In processing queries over an XML fragment stream, the average access time significantly depends on the order of fragments in the stream. As such, for query performance, an efficient organization of XML fragment stream is required as well as the indexing for energy-efficient query processing due to the reduction of tuning time. In this paper, a technique of XML fragment stream organization based on query frequencies, fragment size, fragment access frequencies, and an active XML-based indexing scheme are proposed. Through implementation and performance experiments, our techniques were shown to be efficient compared with the conventional XML fragment stream organizations.

• The Journal of the Korea Contents Association
• /
• v.15 no.12
• /
• pp.24-34
• /
• 2015

With the development of the semantic web, a large amount of data being produced nowadays is in RDF format. RDF is represented by a triple. An RDF database consisting of triples requires the high cost of join query processing. Materialized view is known as a scheme to reduce the query processing cost by accessing materialized views without accessing the database. It is physically stored the results or the intermediate results of the query processing in a storage area. In this paper, we propose a materialized view selection scheme by using decision tree to solve such a problem. The decision tree considers the size and maintenance costs of the materialized view as well as the profit of query response times. It is shown through performance evaluation that the proposed scheme increases the number of materialized views in the limited storage space and decreases the update rates of the materialized views.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.123-137
• /
• 2007

The information space of semantic web comprised of various resources, properties, and relationships is more complex than that of WWW comprised of just documents and hyperlinks. Therefore, ranking methods in the semantic web should be modified to reflect the complexity of the information space. In this paper we propose a method of ranking query results from RDF(Resource Description Framework) knowledge bases. The ranking criterion is the importance of a resource computed based on the link structure of the RDF graph. Our method is expected to solve a few problems in the prior research including the Tightly-Knit Community Effect. We illustrate our methods using examples and discuss directions for future research.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.464-468
• /
• 2003

인터넷의 급성장과 더욱 발전하는 On-line환경에 있어서 기업들간의 정보 교환이 실시간으로 이루어지고 있고, 서로 요구하는 정보의 양질이 높아져감에 따라 현 시점에서 데이터베이스의 관리 및 운용이 대우 중요한 요소가 되었다. 본 연구에서는 (주)대한증석과 경희대학교의 공동연구로 만들어진 KT-Guide라는 전자 카달로그를 Web상으로 구축하여, 피삭재의 절삭에 있어서 사용자가 원하는 가공형식, 공구 및 피삭재를 선택하고 적정 데이터의 입력 후에 최적절삭조건을 실시간으로 알아보고자 함을 목적으로 하고 있다. 이것은 사용자가 절삭을 사용함에 있어서 플랫폼에 제한없이 온라인환경에서 보조도구를 사용하게 하며 궁극적으로는 온라인 상으로 CAD/CAM시스템을 사용함을 목적으로 한다. 한편, 이 전의 연구에 있어서도 Web으로의 확장은 있었으나 많은 부분에 있어서 제한적이었다. DB의 관리에 있어서 MS SQL 2000으로의 Upgrade를 선택하였다. 또한, 프로그램 내부적으로는 기존의 대부분이 HTML Tag를 사용한 ASP형태였다면, 본 논문에 있어서 많은 부분이 XML로 전환되었음을 알 수 있다. 절삭조건의 최적화에는 뉴럴 네트워크를 적용하여 연구된 자료를 이용하였으며, Virtual Machining에 있어서 절삭 조건의 검색 및 Query부분은 XML을 이용하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.467-471
• /
• 2008

With active research on Web ontology, various storages and query languages have been developed to store Web Ontology. As SPARQL usage increases and most of storages are based on relational data base, the necessity of SPARQL-to-SQL translation algorithm development becomes issued. Even though several translation algorithms have been proposed, there still remain the following problems. They do not support fully SPARQL clauses and they are dependent on a specific storage model. This paper proposes a new model to use a specific translation algorithm independently on storages.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.11-20
• /
• 2010

Ontology is important role in semantic web to construct and query semantic data. Because of dynamic characteristic of ontology, P2P environment is considered for ontology processing in web environment. For efficient processing of ontology in P2P environment, clustering of peers should be considered. When new peer is added to the network, cluster allocation problem of the new peer is important for system efficiency. For clustering of peers with similar chateristics, similarlity measure method of ontology in added peer with ontologies in other clusters is needed. In this paper, we propose similarity measure techniques of ontologies for clustering of peers. Similarity measure method in this paper considered ontology's strucural characteristics like schema, class, property. Results of experiments show that ontologies of similar topics, class, property can be allocated to the same cluster.

• Proceedings of the CALSEC Conference
• /
• 2003.09a
• /
• pp.218-223
• /
• 2003

UDDI is the open standard for distributed Web-based registry standard which supports registrations and discoveries of Web services. Recently, UDDI version 3.0 specifications were opened by OASIS UDDI Spec, technical committee. UDDI version 3.0 supports many useful functions, which are not supported in version 2.0 specification, such as nested query, enhanced find qualifiers, digital signatures subscription, etc. Despite of its merits, complexity of the standard and backward-compatibility support makes it difficult to adopt this standard in real application domains. In this paper, we develop the Registry server which support UDDI version 3.0 standard. This server is based on common RDBMS and it supports all functions of UDDI version 3.0 including backward-compatibility with version 2.0 API, XML digital signature and URI- based key schemes.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.1
• /
• pp.91-103
• /
• 2010

This paper introduces efficient rule-based semantic search techniques to ontology-based knowledge commerce services. Primarily, the search techniques presented in this paper define rules of reasoning that are required for users to search using the concept of ontology, multiple characteristics, relations among concepts and data type. In addition, based on the defined rules, the rule-based reasoning techniques search ontology for knowledge commerce services. This paper explains the conversion rules of query which convert user's query language into semantic search words, and transitivity rules which enable users to search related tags, knowledge products and users. Rule-based sematic search techniques are also presented; these techniques comprise knowledge search modules that search ontology using validity examination of queries, query conversion modules for standardization and expansion of search words and rule-based reasoning. The techniques described in this paper can be applied to sematic knowledge search systems using tags, since transitivity reasoning, which uses tags, knowledge products, and relations among people, is possible. In addition, as related users can be searched using related tags, the techniques can also be employed to establish collaboration models or semantic communities.