Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 138 for “"Graph database"”.
-
Graph Locality Prefetcher for Graph Database
… to improve the performance of accessing graph data representing large and complex networks. We represent complex networks as graphs, and queries amount to traversals on the graph. Unlike conventional memory hierarchies that exploit spatial and temporal locality, we observe that graph …
-
Gromit An In-Memory Graph Database
… work presents the implementation of an in-memory graph database management system called Gromit. This graph database represents large and complex networks using labelled property graphs, and encodes semantic information in property lists of the vertices and edges. Gromit uses a vertex-edge graph …
-
Multi-Resolution Representation Using Graph Database
… of the proposed approach is based on a popular graph database platform, Neo4j. Neo4j is advanced in flexibility since it allows user-defined structures. Benefited from its node-relationship structure as well as the powerful query language, Cypher, query within Neo4j is exceedingly readable and …
-
Granular security in a graph database
… to this dual need is provided by Accumulo, a database that allows multiple users of various security levels to access one platform but receive authorization to view only portions of the database. Various databases, however, organize information differently. This thesis examines the possibility …
-
Graph database, and its tale on uncertainty
… real world, many complex objects are modelled as graphs. For instance, social networks, protein interaction networks, chemical compounds, World Wide Web, network design, work flows, and etc. While many models utilise Certain Graphs, in some cases, uncertainty on data is inherent, thus they are …
-
Link Prediction in Agent-based Graph Database System
… (MASS) library. By extending MASS’s distributed graph infrastructure and property-aware computation model, we implement both classical topological heuristics and embedding-based approaches—most notably Fast Random Projection (FastRP) combined with k-Nearest Neighbors (kNN)—to infer potential …
-
Robust Recursive Query Parallelization in Graph Database Management Systems
… path queries are a core feature set of modern graph database management systems (GDBMS). Since these queries tend to be computationally expensive and may suffer from high execution time, they require efficient parallel processing using multiple cores to achieve good performance. Existing work …
-
MULTI-LEVEL SECURITY (MLS) POLICY IMPLEMENTATION USING GRAPH DATABASE
… (MLS) lattice model framework based on a graph database by creating and testing the the Bell-LaPadula access control environment within it. The graph database (Neo4j) is used as a tool to implement MLS policy by leveraging Bell-LaPadula security principles and the MLS lattice model. After …
-
A+ Indexes: Highly Flexible Adjacency Lists in Graph Database Management Systems
… most fundamental storage structure in existing graph database management systems (GDBMSs) to index input graphs. Adjacency lists are universally linked-list like per-vertex structures that allow access to a set of edges that are all adjacent to a vertex. In several systems, adjacency lists can …
-
An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database
Graph databases have become essential in domains requiring real-time querying of highlyinterconnected data. This work is an enhancement of the querying capabilities of a distributed agent-based graph database. Built using the MASS (Multi-Agent Spatial Simulation) Java library, it combines the …
-
Integrating Column-Oriented Storage and Query Processing Techniques into Graph Database Management Systems
… these techniques in the context of contemporary graph database management systems (GDBMSs). GDBMSs support a new set of analytics workloads, such as fraud detection in financial transaction networks or recommendations in social networks, that are also read-heavy but have fundamentally different …
-
DPQP: A D-representation-based Pipelined Factorized Query Processor for Graph Database Management Systems
Factorized databases utilize factorized data representations during query processing to obtain more compact final query results and faster runtimes for queries with many-to-many joins. We revisit this technique in the context of graph database management systems (GDBMSs) whose common workloads are …
-
Interoperability between the StraboSpot graph database and GIS software– A Malpais Mesa Use Case
Geographic Information Systems (GIS) have been used by field geoscientists for decades to digitally collect data with several benefits: observations can be made in the field at a map independent scale while using multiple basemaps, the burdensome task of digitizing handwritten field notes and maps …
Page 1 of 7