PROCESSING QUERIES OVER PARTITIONED GRAPH DATABASES: AN APPROACH AND IT'S EVALUATION
View/ Open
Date
2016-05-12Author
Bodra, Jay Dilipbhai D.
0000-0003-0723-0709
Metadata
Show full item recordAbstract
Representation of structured data using graphs is meaningful for applications such as road and social networks. With the increase in the size of graph databases, querying them to retrieve desired information poses challenges in terms of query representation and scalability. Independently, querying and graph partitioning have been researched in the literature. However, to the best of our knowledge, there is no effective scalable approach for querying graph databases using partitioning schemes. Also, it will be useful to analyze the quality of partitioning schemes from the query processing perspective.
In this thesis, we propose a divide and conquer approach to process queries over very large graph database using available partitioning schemes. We also identify a set of metrics to evaluate the effect of partitioning schemes on query processing. Querying over partitions requires handling answers that: i) are within the same partition, ii) span multiple partitions, and iii) requires the same partition to be used multiple times. Number of connected components in partitions and number of starting nodes of a plan in a partition may be useful for determining the starting partition and the sequence in which partitions need to be processed. Experiments on processing queries over three different graph databases (DBLP, IMDB, and Synthetic), partitioned using different partitioning schemes have been performed. Our experimental results show the correctness of the approach and provide some insights into the metrics gleaned from partitioning schemes on query processing. QP-Subdue a graph querying system developed at UTA, has been modified to process queries over partitions of a graph database.
Related items
Showing items related by title, author, creator and subject.
-
Semi-supervised Learning using Triple-Siamese Network
Banerjee, Debapriya; 0000-0001-6666-5863 (2020-06-04)Missing data problem is inevitable in mostly all research areas including Artificial Intelligence, Machine Learning and Computer Vision where we have modicum knowledge about the complete dataset. One of the key reasons of ... -
MACHINE LEARNING WITH GRAPHS
Deng, Jianjin; 0000-0002-7971-8984 (2021-05-09)In recent years, graph-based machine learning methods have attracted great attention because of their effectiveness and efficiency. Inspired by this trend, this thesis summarizes my research topics on machine learning ... -
Graph Representation Learning for Heterogeneous Multimodal Biomedical Data
Tran, Nhat Chau; 0000-0002-2575-9633 (2022-12-20)The emergence of high-throughput sequencing technology has generated a wealth of “multi-omics” data, capturing information about different types of biomolecules at multiple levels. Since large-scale genomics, transcriptomics, ...