Big Data Security through Privacy–Preserving Data Mining (PPDM): A Decentralization Approach
R Josphineleela, S Kaliappan… - … on Electronics and …, 2023 - ieeexplore.ieee.org
The increasing familiarity and improvements in data mining technologies bring serious
security threats to the data of individuals. An emerging technology that provides better …
security threats to the data of individuals. An emerging technology that provides better …
A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphs
Graph pattern matching is a fundamental operation for exploring and analyzing large
graphs, which are widely used to represent entities and their relationships in a plethora of …
graphs, which are widely used to represent entities and their relationships in a plethora of …
Leveraging double simulation to efficiently evaluate hybrid patterns on data graphs
Labeled graphs are used to represent entities and their relationships in a plethora of Web
applications. Graph pattern matching is a fundamental operation for the analysis and …
applications. Graph pattern matching is a fundamental operation for the analysis and …
[PDF][PDF] Answering Graph Pattern Queries using Compact Materialized Views.
M Lan, X Wu, D Theodoratos - DOLAP, 2022 - ceur-ws.org
We address the problem of evaluating graph pattern queries involving reachability (edge-to-
path mapping) and direct (edge-to-edge mapping) relationships under homomorphisms on …
path mapping) and direct (edge-to-edge mapping) relationships under homomorphisms on …
Efficient in-memory evaluation of reachability graph pattern queries on data graphs
Graphs are a widely used data model in modern data-intensive applications. Graph pattern
matching is a fundamental operation for the exploration and analysis of large data graphs. In …
matching is a fundamental operation for the exploration and analysis of large data graphs. In …
Evaluating mixed patterns on large data graphs using bitmap views
Developing efficient and scalable techniques for pattern queries over large graphs is crucial
for modern applications such as social networks, Web analysis, and bioinformatics. In this …
for modern applications such as social networks, Web analysis, and bioinformatics. In this …
Efficiently computing homomorphic matches of hybrid pattern queries on large graphs
In this paper, we address the problem of efficiently finding homomorphic matches for hybrid
patterns over large data graphs. Finding matches for patterns in data graphs is of …
patterns over large data graphs. Finding matches for patterns in data graphs is of …
Evaluating hybrid graph pattern queries using runtime index graphs
X Wu, D Theodoratos, N Mamoulis, M Lan - arXiv preprint arXiv …, 2021 - arxiv.org
Graph pattern matching is a fundamental operation for the analysis and exploration ofdata
graphs. In thispaper, we presenta novel approachfor efficiently finding homomorphic …
graphs. In thispaper, we presenta novel approachfor efficiently finding homomorphic …
NREngine: A Graph-Based Query Engine for Network Reachability
A quick and intuitive understanding of network reachability is of great significance for
network optimization and network security management. In this paper, we propose a query …
network optimization and network security management. In this paper, we propose a query …
Using Materialized Views for Answering Graph Pattern Queries
M Lan - 2022 - search.proquest.com
Discovering patterns in graphs by evaluating graph pattern queries involving direct (edge-to-
edge mapping) and reachability (edge-to-path mapping) relationships under …
edge mapping) and reachability (edge-to-path mapping) relationships under …