• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.6-8
• /
• 2000

XML 문서의 폭발적인 확산에 따라 Web상의 각 사이트는 XML 문서를 분산 저장하여 관리하고 있다. 그리고 XML 문서들 간에는 다양한 링크를 통해 관련된 정보를 참조할 수 있다. 그러나 현재까지 XML과 관련하여, 링크를 지원하는 질의어 개발이나 링크를 활용한 XML 검색 시스템 개발에 대한 연구는 미비하다. 본 논문에서는, 실제 Web상에 분산되어 저장된 전자 문서들 중 하이퍼링크로 연결된 XML 문서들을 대상으로, 링크를 지원하기 위해 기존 XML 질의어를 확장에 대해 연구하였다. 이를 위해 XML 링크를 지원하는 질의의 유형을 분류하고, 링크를 지원하기 위한 XML 질의어의 확장에 대해 기술한다. 그리고 링크를 활용한 XML 질의 처리 방안에 대해 기술한다.

• Electronics and Telecommunications Trends
• /
• v.11 no.1 s.39
• /
• pp.1-8
• /
• 1996

웹 서비스가 인터넷을 주도하면서 Hyper Text Markup Language(HTML) 문서 위주의 정보검색 서비스에서 한 발 더 나아가 SQL 데이터베이스와 웹을 통합하여 이를 비즈니스 분야로 확대 발전시키기 위한 연구가 진행되고 있다. 실제로 많은 웹 서버에서 Common Gateway Interface(CGI) 기능을 데이터베이스 검색에 활용하고 있다. 이와 함께 GCI를 사용자 입장에서 한 단계 발전시킨 WWW interface to DataBase(WDB), Gateway Structure Query Language(GSQL) 등이 인터넷에서 소개되고 있다. 본 고에서는 현재 다각도로 진행중인 웹과 데이터베이스 통합기술 동향을 CGI와 WDB를 통해 살펴보았다.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.106-118
• /
• 2016

Recently, as the generation and sharing of web data have increased, the importance of a social semantic web that combines the semantic web and the social web has also been increasing. In this paper, we propose a trust evaluation scheme based on provenance by extending the PROV model in the social semantic web environment. The proposed scheme manages the provenance of web data and adds the necessary elements for trust evaluation in the PROV model of W3C. The extended PROV model supports data management and provenance tracing. The proposed trust evaluation scheme considers various parameters such as user trust, original data trust, and user evaluation. The evaluated trust is managed as provenance. When processing a query, the proposed scheme generates a result by considering the trust. Therefore, the proposed scheme can manage the provenance of web data and compute data trust correctly by using such various parameters. The evaluated trust becomes a criterion to determine whether the query result can be trusted or not. In order to show the validity of the proposed scheme, we verify its performance using SPARQL queries.

• Journal of the Korea Society for Simulation
• /
• v.22 no.3
• /
• pp.71-79
• /
• 2013

Web server cluster systems are widely used, where a large number of PC level servers are interconnected via network. This paper focuses on forecasting an appropriate number of web servers which can serve four different classes of user requests, simple web page viewing, knowledge query, motion picture viewing and motion picture uploading. Two ways of serving different classes of web service requests are considered, commonly used web servers and service dedicated web servers. Computer simulation experiments are performed in order to find a good way of allocating web servers among different classes of web service requests, maintaining certain levels of resource utilization and response time.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.222-229
• /
• 2016

Linked Data is a powerful technology for storing and publishing the structures of data. It is helpful for web applications because of its usefulness through semantic query data. However, using Linked Data is not easy for ordinary users who lack knowledge about the structure of data or the query syntax of Linked Data. For that problem, we propose a translator component that is used for translating RESTful/JSON request messages into SPARQL commands based on ontology - a metadata that describes the structure of data. Clients do not need to worry about the structure of stored data or SPARQL, a kind of query language used for querying linked data that not many people know, when they insert a new instance or query for all instances of any specific class with those complex structure data. In addition, the translator component has the search function that can find a set of data from multiple classes based on finding the shortest paths between the target classes - the original set that user provide, and target classes- the users want to get. This translator component will be applied for any dynamic ontological structure as well as automatically generate a SPARQL command based on users' request message.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.207-218
• /
• 2012

In recent years, the skyline query paradigm has been established as a reliable method for database query personalization. While early efficiency problems have been solved by sophisticated algorithms and advanced indexing, new challenges in skyline retrieval effectiveness continuously arise. In particular, the rise of the Semantic Web and linked open data leads to personalization issues where skyline queries cannot be applied easily. We addressed the special challenges presented by linked open data in previous work; and now further extend this work, with a heuristic workflow to boost efficiency. This is necessary; because the new view on linked open data dominance has serious implications for the efficiency of the actual skyline computation, since transitivity of the dominance relationships is no longer granted. Therefore, our contributions in this paper can be summarized as: we present an intuitive skyline query paradigm to deal with linked open data; we provide an effective dominance definition, and establish its theoretical properties; we develop innovative skyline algorithms to deal with the resulting challenges; and we design efficient heuristics for the case of predicate equivalences that may often happen in linked open data. We extensively evaluate our new algorithms with respect to performance, and the enriched skyline semantics.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1375-1384
• /
• 2004

Streaming data processing is an area of interest with much research under way. There has been increasing attention on the demands for efficient processing of streaming data produced in the application areas such as monitoring and sensor network. We have developed a continuous query processing system for streaming data and evaluated its performance in this paper. XML, the standard for data exchange on the web, is used as the model for the streaming data and the XQuery appended with a time interval is adopted as the query language for expressing con-tinuous queries. In the proposed system, the result is produced through background processing and materialized for reute in subsequent query processing. Through a detailed set of performance experiments, we shoed the effectiveness of the proposed system.

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

We design and implement an efficient storage technique to improve query processing for a large RDF data set. The proposed techniques can minimize data redundancy compared to the existing techniques by splitting relation information and data information from triple formatted RDF data. Also, we can enhance query processing speed separating and connecting the entire query steps by relation and data based on the proposed storage technique. The proposed technique can be applied to the areas, such as e-Commerce, semantic web, and KMS to store and retrieve a large RDF data set.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.991-998
• /
• 2002

With the advent of XML and database languages armed with the object-oriented concept and deductive logic, the problem of efficient query processing for them has become a major issue. We describe a way of processing semi-structured XML data through an implementation of a Deductive and Object-oriented Database (DOODB) language with the explanation of query processing. We have shown how to convert an XML data model to a DOODB data model. We have then presented an efficient query processing method based on Connection Graph Resolution. We also present a knowledge-based query processing method that uses the homomorphism of objects in the database and the associative rule of substitutions.

• Journal of Digital Convergence
• /
• v.12 no.5
• /
• pp.255-261
• /
• 2014

This paper intends to suggest methods to design and implement a jQuery mobile based system in a future mobile webapp environment through a study on an N-Screen application in a mobile webapp. N-Screen is one of the representative services of cloud computing. It is promoted by the need of users to require universal functions for all devices. However, this situation is in conflict with the users' need to have the same experience and N-Screen cannot deal with these disparate services. Thus, this study intends to suggest a system analysis, structure of design, and a framework by implementing the N-Screen based movie reservation system in the jQuery mobile environment.