• Title/Summary/Keyword: Graph Storage

Search Result 84, Processing Time 0.029 seconds

Data structures and the performance improvement of the minimum degree ordering method (최소차수순서화의 자료구조개선과 효율화에 관한 연구)

  • 모정훈;박순달
    • Korean Management Science Review
    • /
    • v.12 no.2
    • /
    • pp.31-42
    • /
    • 1995
  • The ordering method is used to reduce the fill-ins in interior point methods. In ordering, the data structure plays an important role. In this paper, first, we compare the efficiency and the memory storage requirement of the quotient graph structure and the clique storage. Next, we propose a method of reducing the number of cliques and a data structure for clique storage. Finally, we apply a method of merging rows and absorbing cliques and show the experimental results.

  • PDF

Topological Analysis of DC Motor Driving by John's Chopper Circuit

  • Won, Chung-Yun;Hwang, Hee-Yeong
    • Proceedings of the KIEE Conference
    • /
    • 1979.08a
    • /
    • pp.138-141
    • /
    • 1979
  • The purpose of this paper is to develop an efficient model for the analysis of a John's Chopper Circuit. In the John's Chopper Circuit analysis, the open branches are removed from the associated graph to formulate the modified incidence matrix. An algorithm for the generation of a modified proper tree and fundamental cut set matrix from a network graph is developed, which utilizes much less computer storage space and computation time compared to the classical methods.

  • PDF

In-memory Compression Scheme Based on Incremental Frequent Patterns for Graph Streams (그래프 스트림 처리를 위한 점진적 빈발 패턴 기반 인-메모리 압축 기법)

  • Lee, Hyeon-Byeong;Shin, Bo-Kyoung;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.1
    • /
    • pp.35-46
    • /
    • 2022
  • Recently, with the development of network technologies, as IoT and social network service applications have been actively used, a lot of graph stream data is being generated. In this paper, we propose a graph compression scheme that considers the stream graph environment by applying graph mining to the existing compression technique, which has been focused on compression rate and runtime. In this paper, we proposed Incremental frequent pattern based compression technique for graph streams. Since the proposed scheme keeps only the latest reference patterns, it increases the storage utilization and improves the query processing time. In order to show the superiority of the proposed scheme, various performance evaluations are performed in terms of compression rate and processing time compared to the existing method. The proposed scheme is faster than existing similar scheme when the number of duplicated data is large.

Semantic-based Mashup Platform for Contents Convergence

  • Yongju Lee;Hongzhou Duan;Yuxiang Sun
    • International journal of advanced smart convergence
    • /
    • v.12 no.2
    • /
    • pp.34-46
    • /
    • 2023
  • A growing number of large scale knowledge graphs raises several issues how knowledge graph data can be organized, discovered, and integrated efficiently. We present a novel semantic-based mashup platform for contents convergence which consists of acquisition, RDF storage, ontology learning, and mashup subsystems. This platform servers a basis for developing other more sophisticated applications required in the area of knowledge big data. Moreover, this paper proposes an entity matching method using graph convolutional network techniques as a preliminary work for automatic classification and discovery on knowledge big data. Using real DBP15K and SRPRS datasets, the performance of our method is compared with some existing entity matching methods. The experimental results show that the proposed method outperforms existing methods due to its ability to increase accuracy and reduce training time.

I/O Optimization Strategies for a GPU-based Graph Engine with High-Performance Storage (고성능 스토리지를 갖는 GPU 기반 그래프 분석 엔진을 위한 I/O 최적화 전략)

  • Jeong-Min Park;Myung-Hwan Jang;Sang-Wook Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.05a
    • /
    • pp.386-388
    • /
    • 2023
  • 본 논문은 고성능 스토리지를 사용하는 환경에서 대규모 그래프를 분석을 위한 GPU 기반 그래프 분석 엔진의 I/O 최적화 전략을 제안한다. 사전 실험을 통해 최신 GPU 기반 그래프 엔진인 RealGraphGPU 가 고성능 스토리지의 대역폭을 충분히 활용하지 못하고 있음을 발견하였다. 이를 개선하기 위해 (1) User-space I/O, (2) Asynchronous I/O 두 가지 최적화 전략을 적용하였으며, 실험을 통해 두 전략이 RealGraphGPU 의 그래프 분석 성능 향상시키는 데 효과적임을 확인하였다.

A new stability and sensitivity design and diagnosis approach

  • Sari, Ali;Korkmaz, Kasim A.
    • Steel and Composite Structures
    • /
    • v.23 no.6
    • /
    • pp.683-690
    • /
    • 2017
  • In the stability and sensitivity design and diagnosis approaches, there are various methodologies available. Bond graph modeling by lumping technique is one of the universal methodologies in methodical analysis used by many researchers in all over the world. The accuracy of the method is validated in different arenas. Bond graphs are a concise, pictorial representation of the energy storage, dissipation and exchange mechanisms of interacting dynamic systems, subsystems and components. This paper proposes a bond graph modeling for distributed parameter systems using lumping techniques. Therefore, a steel frame structure was modeled to analyze employing bond graph modeling of distributed system using lumping technique. In the analytical part, the effectiveness of bond graphs to model this system is demonstrated. The dynamic responses of the system were computed and compared with those computed from the finite element analysis. The calculated maximum deflection time histories were found to be comparable. The sensitivity and the stability of the steel frame structure was also studied in different aspects. Thus, the proposed methodology, with its simplicity, can be used for stability and sensitivity analyses as alternative to finite element method for steel structures. The major value brought in the practical design is the simplicity of the proposed method for steel structures.

Development of Calibration Model for Firmness Evaluation of Apple Fruit using Near-infrared Reflectance Spectroscopy (사과 경도의 비파괴측정을 위한 검량식 개발 및 정확도 향상을 위한 연구)

  • 손미령;조래광
    • Food Science and Preservation
    • /
    • v.6 no.1
    • /
    • pp.29-36
    • /
    • 1999
  • Using Fuji apple fruits cultivated in Kyungpook prefecture, the calibration model for firmness evaluation of fruits by near infrared(NIR) reflectance spectroscopy was developed, and the various influence factors such as instrument variety, measuring method, sample group, apple peel and selection of firmness point were investigated. Spectra of sample were recorded in wavelength range of 1100∼2500nm using NIR spectrometer (InfraAlyzer 500), and data were analyzed by stepwise multiple linear regression of IDAS program. The accuracy of calibration model was the highest when using sample group with wide range, and the firmness mean values obtained in graph by texture analyser(TA) were used as standard data. Chemometrics models were developed using a calibration set of 324 samples and an independent validation set of 216 samples to evaluate the predictive ability of the models. The correlation coefficients and standard error of prediction were 0.84 and 0.094kg, respectively. Using developed calibration model, it was possible to monitor the firmness change of fruits during storage frequently. Time, which was reached to firmness high value in graph by TA, is possible to use as new parameter for freshness of fruit surface during storage.

  • PDF

Study of Data Placement Schemes for SNS Services in Cloud Environment

  • Chen, Yen-Wen;Lin, Meng-Hsien;Wu, Min-Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.3203-3215
    • /
    • 2015
  • Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.

The Conversion Scheme of GML Document into Spatial Database using the Directed Schema Graph Mapping Rules (방향성 스키마 그래프 매핑 규칙을 이용한 GML 문서의 공간 데이터베이스 변환 기법)

  • Chung, Warn-Ill;Park, Soon-Young;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.1 s.13
    • /
    • pp.39-52
    • /
    • 2005
  • GML (Geography Markup Language) has become the widely adopted standard for transport and storage of geographic information. So, various researches such as modeling, storage, query, and etc have been studied to provide the interoperability of geographic information in web environments. Especially, there are increased needs to store semi-structured data such as GML documents efficiently. Therefore, in this paper, we design and implement a GML repository to store GML documents on the basis of GML schema using spatial database system. GML Schema is converted into directed GML schema graph and the schema mapping technique from directed schema graph to spatial schema is presented. Also, we define the conversion rules on spatial schema to preserve the constraints of GML schema. GML repository using spatial database system is useful to provide the interoperability of geographic information and to store and manage enormous GML documents.

  • PDF

Storage Enhancement of Grape through Precooling Process (예냉처리를 통한 포도의 저장성 향상)

  • Park, Shin
    • Korean Journal of Food Science and Technology
    • /
    • v.35 no.6
    • /
    • pp.1093-1097
    • /
    • 2003
  • The aim of this study was to investigate the benefits of storing grapes through precooling, which is easier and more economical than the existing methods of storage. According to the analysis on the weight loss ratio, which is considered an important indicator of grape storage, the time at which the grapes reached 7% weight loss was prolonged by 5 to 10 days by the precooling method. Moreover, the percentage of abnormality on the 31st day of storage was at most 25% less in the precooled grapes than in the non-precooled grapes. In addition, the total bacterial count and the hardness of the precooled grapes were superior to those of the non-precooled grapes. Therefore, the precooling process markedly improved the commercial value of grapes.