Rich-link oriented graph model for improving query performance

2017 ◽  
Author(s):  
Dewi Wisnu Wardani
Keyword(s):  
Graph Model ◽  
Oriented Graph ◽  
Query Performance

scholarly journals A Unification of Heterogeneous Data Sources into a Graph Model in E-commerce

2021 ◽  
Author(s):  
Sonal Tuteja ◽  
Rajeev Kumar
Keyword(s):  
Large Scale ◽  
Graph Model ◽  
Heterogeneous Data ◽  
Data Models ◽  
Graph Models ◽  
Query Performance ◽  
Source Models ◽  
Database Size ◽  
Modelling Techniques ◽  
Heterogeneous Source

AbstractThe incorporation of heterogeneous data models into large-scale e-commerce applications incurs various complexities and overheads, such as redundancy of data, maintenance of different data models, and communication among different models for query processing. Graphs have emerged as data modelling techniques for large-scale applications with heterogeneous, schemaless, and relationship-centric data. Models exist for mapping different types of data to a graph; however, the unification of data from heterogeneous source models into a graph model has not received much attention. To address this, we propose a new framework in this study. The proposed framework first transforms data from various source models into graph models individually and then unifies them into a single graph. To justify the applicability of the proposed framework in e-commerce applications, we analyse and compare query performance, scalability, and database size of the unified graph with heterogeneous source data models for a predefined set of queries. We also access some qualitative measures, such as flexibility, completeness, consistency, and maturity for the proposed unified graph. Based on the experimental results, the unified graph outperforms heterogeneous source models for query performance and scalability; however, it falls behind for database size.

scholarly journals Graph model development in the context of the grain cleaning machine

2018 ◽  
Vol 224 ◽  
pp. 05012 ◽  
Author(s):  
Andrey Butovchenko ◽  
Artem Dorochenko ◽  
Inna Kotelnikova
Keyword(s):  
Mathematical Model ◽  
Model Development ◽  
Graph Model ◽  
Oriented Graph ◽  
Control Factors ◽  
Schematic Layout ◽  
Cleaning Machine ◽  
General Mathematical Model ◽  
Output Characteristics ◽  
Working Bodies

Schematic layout and graph model of seed-cleaning unit are introduced in the article. Input vector, vector of control factors and vector of output characteristics are mentioned. The general mathematical model of purification section process is given. This model together with an oriented graph allows to conduct a program forecast and to find out the rational directions of increasing the efficiency of the work of individual working bodies and the system as a whole.

scholarly journals Constructive and object-oriented modeling text for detection of text borrowings

2019 ◽  
Vol 4 (123) ◽  
pp. 34-47
Author(s):  
Olena Serhiivna Kuropiatnykov
Keyword(s):  
Program Implementation ◽  
Main Idea ◽  
Graph Model ◽  
Object Oriented ◽  
Oriented Graph ◽  
Information Support ◽  
Edge Weight ◽  
Graph Representations ◽  
Text Model ◽  
Class Graph

The scientific community is encouraged to use such models and data structures as arrays of LERP-RSA (the longest expected duplicate array of reduced suffix templates), tag classifier-a model based on Stanford NER's three-class, structures based on DN-sequences, graph representations, etc. The following algorithms are used: GreedyString-Tiling, ARPAD, shingle, statistical methods, genetic algorithms, and others. It should also be noted that much attention is paid to morphological analysis and lemmatization, pre-processing of texts. Models and algorithms only partly have program realization.The purpose of this work is to develop a text model to identify borrowings and bring it to program implementation. The task is to develop the object-oriented model and program implementation of a graph text model, with the application of the problem of detection of borrowing. As well as obtaining timeframes for program implementation work for further evaluation of the possibility of its use in the academic environment.The main idea of the graph model is to present the text as a weighted oriented graph. The vertex weight is a character or sequence of characters. Edge weight is the set of numbers of paths into which the edge enters. To formalize the model will use the apparatus of constructive-synthesizing modeling. To create graphs, a constructor and its components are defined: carrier, signature, multiple statements of information support for design. Transformations are made for the constructor: specialization, interpretation and concretization.On the basis of this model, the object-oriented model is constructed. it includes three classes: vertex, graph and work .The object of class Work presents the text as a set of objects of class Graph. The correspondences between the components of the presented models are established.The object-oriented model is implemented by software. Data are given about the execution time of graph construction and texts comparison.At this stage, software implementation of the model has shown acceptable time performance. Further research in this direction is promising. Directions for improving the model and program are proposed.

scholarly journals A Novel Process-Oriented Graph Storage for Dynamic Geographic Phenomena

2019 ◽  
Vol 8 (2) ◽  
pp. 100 ◽  
Author(s):  
Cunjin Xue ◽  
Chengbin Wu ◽  
Jingyi Liu ◽  
Fenzhen Su
Keyword(s):  
Graph Model ◽  
Oriented Graph ◽  
Spatial Evolution ◽  
Edge Structure ◽  
Oracle Spatial ◽  
Object A ◽  
Order Of Magnitude ◽  
Process Oriented ◽  
Point Line ◽  
Dynamic Geographic Phenomena

There exists a sort of dynamic geographic phenomenon in the real world that has a property which is maintained from production through development to death. Using traditional storage units, e.g., point, line, and polygon, researchers face great challenges in exploring the spatial evolution of dynamic phenomena during their lifespan. Thus, this paper proposes a process-oriented two-tier graph model named PoTGM to store the dynamic geographic phenomena. The core ideas of PoTGM are as follows. 1) A dynamic geographic phenomenon is abstracted into a process with a property that is maintained from production through development to death. A process consists of evolution sequences which include instantaneous states. 2) PoTGM integrates a process graph and a sequence graph using a node–edge structure, in which there are four types of nodes, i.e., a process node, a sequence node, a state node, and a linked node, as well as two types of edges, i.e., an including edge and an evolution edge. 3) A node stores an object, i.e., a process object, a sequence object, or a state object, and an edge stores a relationship, i.e., an including or evolution relationship between two objects. Experiments on simulated datasets are used to demonstrate an at least one order of magnitude advantage of PoTGM in relation to relationship querying and to compare it with the Oracle spatial database. The applications on the sea surface temperature remote sensing products in the Pacific Ocean show that PoTGM can effectively explore marine objects as well as spatial evolution, and these behaviors may provide new references for global change research.

Bond graph model of a PEM fuel cell stack

2008 ◽  
Vol 1 (06) ◽  
pp. 329-334
Author(s):  
S. Rabih ◽  
C. Turpin ◽  
S. Astier
Keyword(s):  
Fuel Cell ◽  
Graph Model ◽  
Pem Fuel Cell ◽  
Bond Graph ◽  
Fuel Cell Stack

Structural Analysis of Product and Computer-Aided Assembly Planning in AssemBL Software Package

2018 ◽  
pp. 11-33
Author(s):  
A. N. Bozhko
Keyword(s):  
Computer Aided Design ◽  
State Of The Art ◽  
Graph Model ◽  
Design System ◽  
Assembly Planning ◽  
Complex Products ◽  
Assembly Sequences ◽  
Computer Aided ◽  
Cad Cam ◽  
Aided Design

Computer-aided design of assembly processes (Computer aided assembly planning, CAAP) of complex products is an important and urgent problem of state-of-the-art information technologies. Intensive research on CAAP has been underway since the 1980s. Meanwhile, specialized design systems were created to provide synthesis of assembly plans and product decompositions into assembly units. Such systems as ASPE, RAPID, XAP / 1, FLAPS, Archimedes, PRELEIDES, HAP, etc. can be given, as an example. These experimental developments did not get widespread use in industry, since they are based on the models of products with limited adequacy and require an expert’s active involvement in preparing initial information. The design tools for the state-of-the-art full-featured CAD/CAM systems (Siemens NX, Dassault CATIA and PTC Creo Elements / Pro), which are designed to provide CAAP, mainly take into account the geometric constraints that the design imposes on design solutions. These systems often synthesize technologically incorrect assembly sequences in which known technological heuristics are violated, for example orderliness in accuracy, consistency with the system of dimension chains, etc.An AssemBL software application package has been developed for a structured analysis of products and a synthesis of assembly plans and decompositions. The AssemBL uses a hyper-graph model of a product that correctly describes coherent and sequential assembly operations and processes. In terms of the hyper-graph model, an assembly operation is described as shrinkage of edge, an assembly plan is a sequence of shrinkages that converts a hyper-graph into the point, and a decomposition of product into assembly units is a hyper-graph partition into sub-graphs.The AssemBL solves the problem of minimizing the number of direct checks for geometric solvability when assembling complex products. This task is posed as a plus-sum two-person game of bicoloured brushing of an ordered set. In the paradigm of this model, the brushing operation is to check a certain structured fragment for solvability by collision detection methods. A rational brushing strategy minimizes the number of such checks.The package is integrated into the Siemens NX 10.0 computer-aided design system. This solution allowed us to combine specialized AssemBL tools with a developed toolkit of one of the most powerful and popular integrated CAD/CAM /CAE systems.

On Some Properties of Semi-rings

2018 ◽  
pp. 35-50
Author(s):  
A. I. Belousov
Keyword(s):  
Linear Equations ◽  
Oriented Graph ◽  
Theoretical Computer Science ◽  
Alternative Methods ◽  
Main Role ◽  
Cost Matrix ◽  
Sequential Elimination ◽  
The Matrix ◽  
Systems Of Linear Equations ◽  
The Cost

The main objective of this paper is to prove a theorem according to which a method of successive elimination of unknowns in the solution of systems of linear equations in the semi-rings with iteration gives the really smallest solution of the system. The proof is based on the graph interpretation of the system and establishes a relationship between the method of sequential elimination of unknowns and the method for calculating a cost matrix of a labeled oriented graph using the method of sequential calculation of cost matrices following the paths of increasing ranks. Along with that, and in terms of preparing for the proof of the main theorem, we consider the following important properties of the closed semi-rings and semi-rings with iteration.We prove the properties of an infinite sum (a supremum of the sequence in natural ordering of an idempotent semi-ring). In particular, the proof of the continuity of the addition operation is much simpler than in the known issues, which is the basis for the well-known algorithm for solving a linear equation in a semi-ring with iteration.Next, we prove a theorem on the closeness of semi-rings with iteration with respect to solutions of the systems of linear equations. We also give a detailed proof of the theorem of the cost matrix of an oriented graph labeled above a semi-ring as an iteration of the matrix of arc labels.The concept of an automaton over a semi-ring is introduced, which, unlike the usual labeled oriented graph, has a distinguished "final" vertex with a zero out-degree.All of the foregoing provides a basis for the proof of the main theorem, in which the concept of an automaton over a semi-ring plays the main role.The article's results are scientifically and methodologically valuable. The proposed proof of the main theorem allows us to relate two alternative methods for calculating the cost matrix of a labeled oriented graph, and the proposed proofs of already known statements can be useful in presenting the elements of the theory of semi-rings that plays an important role in mathematical studies of students majoring in software technologies and theoretical computer science.

THE DEVELOPMENT OF THE MATHEMATICAL MODEL OF PREDICTING THE INDICATORS OF ACCREDITATION OF TECHNICAL UNIVERSITIES IN THE RUSSIAN FEDERATION

2017 ◽  
pp. 27-38
Author(s):  
Olga Mikhaylovna Tikhonova ◽  
Alexander Fedorovich Rezchikov ◽  
Vladimir Andreevich Ivashchenko ◽  
Vadim Alekseevich Kushnikov
Keyword(s):  
Mathematical Model ◽  
System Dynamics ◽  
Regression Model ◽  
Oriented Graph ◽  
Real Data ◽  
Educational Process ◽  
Proposed Model ◽  
Linear Differential ◽  
The University ◽  
The Mathematical Model

The paper presents the system of predicting the indicators of accreditation of technical universities based on J. Forrester mechanism of system dynamics. According to analysis of cause-and-effect relationships between selected variables of the system (indicators of accreditation of the university) there was built the oriented graph. The complex of mathematical models developed to control the quality of training engineers in Russian higher educational institutions is based on this graph. The article presents an algorithm for constructing a model using one of the simulated variables as an example. The model is a system of non-linear differential equations, the modelling characteristics of the educational process being determined according to the solution of this system. The proposed algorithm for calculating these indicators is based on the system dynamics model and the regression model. The mathematical model is constructed on the basis of the model of system dynamics, which is further tested for compliance with real data using the regression model. The regression model is built on the available statistical data accumulated during the period of the university's work. The proposed approach is aimed at solving complex problems of managing the educational process in universities. The structure of the proposed model repeats the structure of cause-effect relationships in the system, and also provides the person responsible for managing quality control with the ability to quickly and adequately assess the performance of the system.

Sign in / Sign up

Export Citation Format

Share Document