Search
Now showing items 1-4 of 4
Divide and Conquer Approach to Scalable Substructure Discovery: Partitioning Schemes, Algorithms, Optimization and Performance Analysis using Map/Reduce Paradigm
(2017-05-08)
With the proliferation of applications rich in relationships, graphs are becoming the preferred choice of data model for representing/storing data with relationships. The notion of "information retrieval'' and "information ...
Finding Representative Entities From Entity Graph By Using Neighborhood Based Entity Similarity
(2018-09-17)
Several applications deploy the use of large entity graphs. Given the entirety of its application scope, it is challenging to select a single entity graph for a particular need from numerous data sources. For a comprehensible ...
MR_QP: A Scalable Approach To Query Processing on Arbitrary-Size Graphs Using The Map/Reduce Framework
(2020-06-03)
The utility and widespread use of Relational Database Management Systems(RDBMSs) comes not only from its simple, easy-to-understand data model (a relation or a set) but mainly from the ability to write non-procedural queries ...
MLN-Subdue: Decoupling Approach-Based Substructure Discovery In Multilayer Networks (MLNs)
(2020-06-03)
Substructure discovery is well-researched for single graphs (both simple and attribute) as it is an important component of knowledge discovery for many applications
such as finding the core substructure in a protein, ...