• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.454-456
• /
• 2002

인터넷의 발달로 인하여 웹을 통한 문서 송수신이 많아지면서 이메일의 사용자도 기하급수적으로 늘어나고 있다. 또한 전자상거래에서 무수한 개인적, 직접적 정보 서비스를 이메일로 이용하게 됨에 따라 빠르고 정확한 전송시스템이 현안이 되고 있다. 특히 전자상거래의 상업적 메일은 대량의 메일을 항상 송신해야 하고, 멀티미디어 자료들이 내재되어 있어 메일 용량이 커져서 메일 전송 시 많은 부하가 발생할 수밖에 없는 현실이다. 본 연구는 이러한 문제를 해결하기 위하여 전자상거래의 메일 특수성에 맞춰 템플릿(template)기반 메일 전송방법을 제안하고자 한다. 이는 시간 축을 기준으로 각각의 클라이언트에게 보내는 내용이 같은 항목 하에 일부 내용만이 바뀌는 수평적 유사성(horizontal similarity), 보내지는 폼의 전체적인 디자인 변화나 회사의 정보가 변경되는 수직적 유사성(vertical similarity)특징을 이용한다. 유사성을 가진 메일을 보낼 때 하나의 템플릿으로 작성해서 보내게 되면, 그 이후에는 템플릿 외 사용자 정보만을 전송하게 되며, 메일클라이언트는 컴퓨터에서 이러한 템플릿을 가지고 원래의 메일로 복원을 하게 된다. 이는 전체적인 메일 전송량을 현저하게 줄일 수 있게 해 준다.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2001.05a
• /
• pp.101-103
• /
• 2001

최근 셍물정보 분야에서 웹상에서 단백질과 유전자의 서열정보 및 이와 관련된 실험과 참조정보를 다른 유전체 데이터베이스 시스템과 상호교환을 위한 표준 형식으로 XML을 이용하기 시작하였다. 더불어 웹에서 데이터전송을 위한 표준 형식인 XML을 생물정보응용 분야에서 이용하기 위한 BioML을 정의하였다. 그러나 BioML에서는 서열의 소스 및 참조정보, 갱신정보와 XML문서사이의 참조정보를 포함하지 않고 있다. 따라서 이 논문에서는 BioML에서 포함하지 않는 이러한 정보를 XLink와 XPointer를 이용하여 나타낼 수 있도록 BioML을 확장하고 BioML에 포함된 서열 정보에 대한 메타정보를 RDF를 적용하여 제시하였다. 이렇게 함으로써 이질적인 생명정보데이터베이스 시스템에서 서열에 대한 복잡한 링크 정보와 서열의 변경정보를 효율적으로 교환이 가능하다.

• Journal of Broadcast Engineering
• /
• v.18 no.1
• /
• pp.43-58
• /
• 2013

Richmedia Service means that interactive media service can provide view with various multimedia elements(such as Video, Audio, Text) at same time. Various Multimedia elements can be serviced by Scene Description technology standards like BIFS(Binary Format for Scenes) and LASeR(Light Application Scene Representation). By providing Scene Component information, richmedia service is available to various multimedia services. so users is available to personalized services fitting temporal and spatial options. In conventional technology, when the scene is changed by user or service, mobile deletes the scene of configuration information and makes new scene of configuration information. this is a very inefficient way. In this paper, Propoesed that by using DOM(Document Object Model) method, to pass only the dynamic configuration part, changes scene method.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.252-272
• /
• 2003

The view mechanism provides users with appropriate portions of database through data filtering and integration. In the Web era where information proliferates, the view concept is also useful for XML, a future standard for data exchange on the Web. This paper proposes a method of implementing XML views called XML view indexing, whereby XML view xv is represented as an XML view index(XVI) which is a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements but not the elements themselves, when a user requests to retrieve xv, its XVI should be materialized against xv's underlying XML documents. Also an efficient algorithm to incrementally maintain consistency of XVI given a update of xv's underlying XML documents is required. This paper proposes and implements data structures and algorithms for XML view indexing. The performance experiments on XML view indexing reveal that it outperforms view recomputation for repeated accesses to the view, and requires as much as about 30 times less storage space compared to XML view materialization though the latter takes less time for repeated accesses to the view due to no need of materialization.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.374-386
• /
• 2016

Provenance means the meta data that represents the history or lineage of a data in collaboration storage environments. Therefore, as provenance has been accruing over time, it takes several ten times as large as the original data. The schemes for effciently compressing huge amounts of provenance are required. In this paper, we propose a provenance compression scheme considering the RDF graph patterns. The proposed scheme represents provenance based on a standard PROV model and encodes provenance in numeric data through the text encoding. We compress provenance and RDF data using the graph patterns. Unlike conventional provenance compression techniques, we compress provenance by considering RDF documents on the semantic web. In order to show the superiority of the proposed scheme, we compare it with the existing scheme in terms of compression ratio and the processing time.

• Korean Journal of Construction Engineering and Management
• /
• v.12 no.3
• /
• pp.62-72
• /
• 2011

As the construction industry is becoming large and complex, it is difficult to understand the overall business workflow and provide the required information. Accordingly, researches on the introduction of Interactive Electronic Technical Manual (IETM), used in manufacturing/maintenance industry, is being carried. In the case of construction projects, Frequent changes of relevant information occur according to changes in the project environments, so it is difficult for administrators to gather and organize the information. Therefore, this research suggests the Information Management Model for Construction Electronic Manual using Collective Intelligence to support the information changes, by expand the information mangers from the system administrators to the whole users and verify the model by applying the model to Urban Regeneration Electronic Manual.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.567-584
• /
• 2004

As XML becomes popular as the way of presenting information on the web, how to secure XML data becomes an important issue. So far study on XML security has focused on security of data communications by using digital sign or encryption technology. But, it now requires not just to communicate secure XML data on communication but also to manage query process to access XML data since XML data becomes more complicated and bigger. We can manage XML data queries by access control technique. Right now current XML data access control only deals with read operation. This approach has no option to process update XML queries. In this paper, we present XML access control model and technique that can support both read and update operations. In this paper, we will propose the operation for XML document update. Also, We will define action type as a new concept to manage authorization information and process update queries. It results in both minimizing access control steps and reducing memory cost. In addition, we can filter queries that have no access rights at the XML data, which it can reduce unnecessary tasks for processing unauthorized query. As a result of the performance evaluation, we show our access control model is proved to be better than other access control model in update query. But it has a little overhead to decide action type in select query.

• The Journal of Society for e-Business Studies
• /
• v.11 no.1
• /
• pp.1-23
• /
• 2006

As data on the Web is more and more in XML due to proliferation of Web applications such as e-Commerce, it is strongly required to rapidly process XML queries. One of such techniques is XML query caching. For frequently submitted queries, their results could be cached in order to guarantee fast response for the same queries. In this paper, we propose techniques for XML query performance improvement whereby the set of node identifiers(NIS) for an XML query is cached. NIS is most commonly employed as a format of XML query result,, consisting of the identifiers of the XML elements that comprise the query result. With NIS, it is suitable to meet the Web applications data retrieval requirements because reconstruction and/or modification of query results and integration of multiple query results can be efficiently done. Incremental refresh of NIS against its source updates can also be efficiently done. When the query result is requested in XML, however, materialization of NIS is needed by retrieving the source XML elements through their identifiers. In this paper, we consider three different types of NISs. proposing the algorithms of their creation, materialization, and incremental refresh. All of them were implemented using an RDBMS. Through a detailed set of performance experiments, we showed the efficiency of the proposed XML query caching techniques.