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 35 for “"Graph queries"”.
-
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 …
-
Evaluating conjunctive and graph queries over the EL profile of OWL 2
… results and algorithms for answering expressive queries over OWL 2 EL knowledge bases (KBs) with regular role inclusions. </p> <p>We first focus on the complexity of conjunctive query (CQ) answering in OWL 2 EL and show that the problem is PSpace-complete in combined complexity, the complexity …
-
Models and Algorithms for Persistent Queries over Streaming Graphs
… to model and represent interaction data as graphs in a broad range of domains such as online social networks, protein interaction data, and e-commerce applications. A number of emerging applications require continuous processing and querying of interaction data that evolves at a high rate, …
-
Optimization Techniques for Graph Databases: Challenges and Approaches
Graphs are everywhere and will retain their popularity due to the continuous growth of social networks, the rise of the Semantic Web, and the characterization of biological networks. The popularity and utility of graphs have led to the need for graph databases to manage and query large graphs. This …
-
Graph Data Processing and Analysis: From Algorithms to System Development
… domains where data can be naturally modelled as graphs, such as social networks and computer networks. The amount of data generated and published is rapidly increasing with the explosion of information. Effective storage of graph data and querying has become a significant challenge; hence the …
-
Optimizing graph query performance by indexing and caching
Subgraph/supergraph queries, though central to graph analytics, are costly as they entail the NP-Complete problem of subgraph isomorphism. To expedite graph query processing, the community has contributed a wealth of approaches that gradually form two categories, i.e., heuristic subgraph …
-
Information Architecture for a Chemical Modeling Knowledge Graph
… parameters were stored in a Neo4j property graph database. Machine learning model instances were created with permutations of dataset, learning algorithm, molecular featurization, data scaling, data splitting, hyperparameters, and hyperparameter optimization techniques. The resulting graph …
-
Beyond Property Graphs: Development and Applications of a Hybrid Graph Analytics System
Over the past two decades, graph analytics has grown from a fairly niche discipline into a ubiquitous field touching nearly every aspect of modern computing. This growth began with the internet, which led to the standardization of OWL and RDF, and was accelerated by social media and large-scale …
-
Privacy-preserving queries on encrypted databases
… due to the high complexity of many important queries on encrypted large-scale datasets. This thesis studies the problem of privacy-preserving database query processing on structured data (e.g., relational and graph databases). In particular, this thesis proposes several practical and provable …
-
Why-Query Support in Graph Databases
… large amount of data and executing complex queries over them. In addition to extended functionality, novel types of databases appear like triple stores, distributed databases, etc. Graph databases implementing the property-graph model belong to this development branch and provide a new way …
-
Hyperscale Data Processing With Network-Centric Designs
… covers all three directions. It first discusses GraphRex, a network-aware system that combines classic database and systems techniques to push the performance of massive graph queries in current data centers. It then introduces data processing in disaggregated data centers, a promising new cloud …
-
Decentralized Social Data Sharing
… query processing. We show that Regular Path Queries, a useful class of graph queries, can still be processed on the shared data: although in the worst case such queries are intractable, we propose a cost estimation technique to identify tractable queries from partial knowledge of the data. …
-
Towards Making JavaScript Applications Secure and Private
… static analysis approach to generate a novel graph structure, named Object Dependence Graph (ODG), to address the server-side vulnerability detection challenges, and a cross-browser fingerprinting method that utilizes multiple novel OS and hardware level features to solve the client-side …
-
Private Federated Analytics At Scale
… we describe a new approach that uses cryptographic techniques to collect data privately and safely, without placing trust in any party. Although the natural candidates, such as secure multiparty computation (MPC) and fully homomorphic encryption (FHE) do not scale to millions of parties on …
-
Dynamic Large-Scale Graph Processing over Data Streams with Community Detection as a Case Study
Processing large graphs provides invaluable insights for the industry and research alike. The applications range from e-commerce, web, and social networking to analyzing gene expressions and cellular signaling. While numerous graph processing solutions have been developed with the capability to …
-
A Workload-Driven Framework for NoSQL Data Modeling and Partitioning
… maintenance. On the other hand, the existing graph partitioning strategies are mostly workload-agnostic, as they presume the same probability of traversing edges or visiting vertices, which does not always hold with different query workloads. In addition, they are mostly graph …
-
A mechanism to evaluate context-free queries inspired in LR(1) parsers over graph databases
… called the Web of Data, which forms a global graph, consisting of RDF [22] statements from numerous sources, covering all sorts of topics. To find specific information in this graph, queries are performed starting at a subject and analyzing their predicates in the RDF statements. These …
-
Exploring Heterogeneous Architectures With Tools And Applications
… present Presponse, a GPU-based incremental graph processing framework. This framework proposes an approach to reducing response latency for large-scale graph queries. We first fill the gap that few incremental graph algorithms have been tailored for GPUs. Then, based on the key observation …
-
Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases
Graph database management systems (GDBMSs) are increasingly used to support traversal-heavy workloads. Graph queries often follow data-dependent paths through the graph, producing irregular or non-sequential accesses that do not align with the storage hierarchy, from data layout on disk to …
Page 1 of 2