• Title/Summary/Keyword: Web Storage

Search Result 346, Processing Time 0.026 seconds

Real-Time Personalized Advertisement Techniques for Internet Shopping Mall (인터넷 상점에서의 실시간 개인화된 광고 제공 기법)

  • Kim, Jong-Woo;Lee, Kyung-Mi;Kim, Young-Kuk;Yoo, Kwan-Jong
    • Asia pacific journal of information systems
    • /
    • v.9 no.4
    • /
    • pp.107-124
    • /
    • 1999
  • This paper describes a personalized advertisement technique as a part of intelligent customer services in Internet shopping malls. Based on customers' initial profile, purchase history, and behaviors in an Internet shopping mall, the technique displays appropriate advertisements on Internet web pages when customers' visit to the shopping mall. Customers preference scores for product groups which are main sources to select advertisements, are stored either a preference table or preference trees. Both of the two storage methods can support selection of advertisements on real time, and the preference tree method can reflect affinity among product groups. The suggested technique selects different advertisements to reflect changes of customers preferences as time goes by. An experiment has been performed to evaluate the effectiveness of the algorithm, which revealed that the algorithm selects more customer-oriented advertisements rather than random selection.

  • PDF

An Exhaustive Review on Security Issues in Cloud Computing

  • Fatima, Shahin;Ahmad, Shish
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3219-3237
    • /
    • 2019
  • The Cloud Computing is growing rapidly in the current IT industry. Cloud computing has become a buzzword in relation to Grid & Utility computing. It provides on demand services to customers and customers will pay for what they get. Various "Cloud Service Provider" such as Microsoft Azure, Google Web Services etc. enables the users to access the cloud in cost effective manner. However, security, privacy and integrity of data is a major concern. In this paper various security challenges have been identified and the survey briefs the comprehensive overview of various security issues in cloud computing. The classification of security issues in cloud computing have been studied. In this paper we have discussed security challenges in cloud computing and also list recommended methods available for addressing them in the literature.

Comparison of Storage Structures for RDF Data in Semantic Web. (시맨틱 웹에서 RDF 데이터 저장구조들의 성능비교)

  • Kim, KyungHo;Back, WooHyoun;Son, JiEun;Kim, KyungChang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.881-884
    • /
    • 2013
  • RDF(Resource Description Framework)는 시맨틱 웹의 기초로서 웹 사용자에게 정보를 보다 정확하고 효율적으로 접근하는 표준이다. RDF 데이터를 효율적으로 저장하고 접근하는 필요성이 날로 증가하고 있다. RDF 데이터를 저장하고 검색하는 기본 저장 구조는 관계형 데이터베이스를 이용하는 것이다. 최근에는 RDF 데이터가 엄청나게 증가하고 있는 시점에 대용량 database의 질의(단순 조회)에 최적화된 칼럼-지향(column-oriented) 데이터베이스가 대안으로 제안되었다. 본 논문에서는 RDF 데이터의 저장 구조로서 관계형 데이터베이스와 칼럼-기반 데이터베이스를 비교분석 하고자 한다. Berlin SPARQL Benchmark 를 이용한 성능분석 결과 RDF data 의 저장 구조로서 칼럼-기반 데이터베이스의 효율성을 입증하였다.

Query Optimization on Large Scale Nested Data with Service Tree and Frequent Trajectory

  • Wang, Li;Wang, Guodong
    • Journal of Information Processing Systems
    • /
    • v.17 no.1
    • /
    • pp.37-50
    • /
    • 2021
  • Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

Design of logistics Management System based on Web (웹기반 물류관리시스템 설계)

  • Kwark, Woo-Young;Lim, Yong-Muk;Kim, Woo-Sung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.310-312
    • /
    • 2009
  • 오늘날 기업은 전국,전세계적으로 storage location을 가지고 있으며, 전세계적으로 가장 많이 사용되는 물류관리시스템으로 SAP R/3을 들수있다. 기업은 비용절감을 위해 통합시스템 구축을 하려한다. 통합시스템 구축시 가장 우선되는 부분인 비용절감, 안정성, 보안성 등을 고려한다. 또한 RFID의 도입은 물류관리시스템에서 입고, 출고의 정확성 및 적재위치로의 관리가 용이하며 선입선출의 편리성을 도모할 수 있다. 따라서 본 논문에서는 RFID활용한 물류관리 middleware 설계방법과 RFC(Remote Function Call)을 활용한 웹과 interface방법 및 UML을활용한 framework 설계하고, 마지막으로 향후 연구과제를 제시하였다.

Web based Microservice Framework for Survival Analysis of Lung Cancer Patient using Digital Twin (디지털 트윈을 사용하는 폐암환자 생존분석을 위한 웹 기반 마이크로 서비스 프레임워크)

  • Kolekar, Shivani Sanjay;Yeom, Sungwoong;Choi, Chulwoong;Kim, Kyungbaek
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.11a
    • /
    • pp.537-540
    • /
    • 2021
  • One of the most promising technologies that is raised from the fourth industrial revolution is Digital Twin (DT). A DT captures attributes and behaviors of the entity suitable for communication, storage, interpretation or processing within certain context. A digital twin based on microservice framework architecture is proposed in this paper which identifies elements required for the complete orchestration of microservice based Survival Analysis of Lung Cancer Patients. Integration of microservices and Digital Twin Technology is studied.

An Efficient Reasoning Method for OWL Properties using Relational Databases (관계형 데이터베이스를 이용한 효율적인 OWL 속성 추론 기법)

  • Lin, Jiexi;Lee, Ji-Hyun;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.37 no.2
    • /
    • pp.92-103
    • /
    • 2010
  • The Web Ontology Language (OWL) has become the W3C recommendation for publishing and sharing ontologies on the Semantic Web. To derive hidden information from OWL data, a number of OWL reasoners have been proposed. Since OWL reasoners are memory-based, they cannot handle large-sized OWL data. To overcome the scalability problem, RDBMS-based systems have been proposed. These systems store OWL data into a database and perform reasoning by incorporating the use of a database. However, they do not consider complete reasoning on all types of properties defined in OWL and the database schemas they use are ineffective for reasoning. In addition, they do not manage updates to the OWL data which can occur frequently in real applications. In this paper, we compare various database schemas used by RDBMS-based systems and propose an improved schema for efficient reasoning. Also, to support reasoning for all the types of properties defined in OWL, we propose a complete and efficient reasoning algorithm. Furthermore, we suggest efficient approaches to managing the updates that may occur on OWL data. Experimental results show that our schema has improved performance in OWL data storage and reasoning, and that our approaches to managing updates to OWL data are more efficient than the existing approaches.

A Study of 3D Modeling of Compressed Urban LiDAR Data Using VRML (VRML을 이용한 도심지역 LiDAR 압축자료의 3차원 표현)

  • Jang, Young-Woon;Choi, Yun-Woong;Cho, Gi-Sung
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.19 no.2
    • /
    • pp.3-8
    • /
    • 2011
  • Recently, the demand for enterprise for service map providing and portal site services of a 3D virtual city model for public users has been expanding. Also, accuracy of the data, transfer rate and the update for the update for the lapse of time emerge are considered as more impertant factors, by providing 3D information with the web or mobile devices. With the latest technology, we have seen various 3D data through the web. With the VRML progressing actively, because it can provide a virtual display of the world and all aspects of interaction with web. It offers installation of simple plug-in without extra cost on the web. LiDAR system can obtain spatial data easily and accurately, as supprted by numerous researches and applications. However, in general, LiDAR data is obtained in the form of an irregular point cloud. So, in case of using data without converting, high processor is needed for presenting 2D forms from point data composed of 3D data and the data increase. This study expresses urban LiDAR data in 3D, 2D raster data that was applied by compressing algorithm that was used for solving the problems of large storage space and processing. For expressing 3D, algorithm that converts compressed LiDAR data into code Suited to VRML was made. Finally, urban area was expressed in 3D with expressing ground and feature separately.

Experiment and Simulation for Evaluation of Jena Storage Plug-in Considering Hierarchical Structure (계층 구조를 고려한 Jena Plug-in 저장소의 평가를 위한 실험 및 시뮬레이션)

  • Shin, Hee-Young;Jeong, Dong-Won;Baik, Doo-Kwon
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.2
    • /
    • pp.31-47
    • /
    • 2008
  • As OWL(Web Ontology Language) has been selected as a standard ontology description language by W3C, many ontologies have been building and developing in OWL. The lena developed by HP as an Application Programming Interface(API) provides various APIs to develop inference engines as well as storages, and it is widely used for system development. However, the storage model of Jena2 stores most owl documents not acceptable into a single table and it shows low processing performance for a large ontology data set. Most of all, Jena2 storage model does not consider hierarchical structures of classes and properties. In addition, it shows low query processing performance using the hierarchical structure because of many join operations. To solve these issues, this paper proposes an OWL ontology relational database model. The proposed model semantically classifies and stores information such as classes, properties, and instances. It improves the query processing performance by managing hierarchical information in a separate table. This paper also describes the implementation and evaluation results. This paper also shows the experiment and evaluation result and the comparative analysis on both results. The experiment and evaluation show our proposal provides a prominent performance as against Jena2.

  • PDF

Building B2B system using timestamp tree for data change detection in low speed network environment (저속 네트워크 환경에서 데이터 변화 탐지를 위해 타임스탬프 트리를 이용하는 B2B 시스템 구축)

  • Son Sei-Il;Kim Heung-Jun
    • The KIPS Transactions:PartD
    • /
    • v.12D no.6 s.102
    • /
    • pp.915-920
    • /
    • 2005
  • In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.