Foundations of modern query languages for graph databases

R Angles, M Arenas, P Barceló, A Hogan… - ACM Computing …, 2017 - dl.acm.org
We survey foundational features underlying modern graph query languages. We first
discuss two popular graph data models: edge-labelled graphs, where nodes are connected …

A survey on NoSQL stores

A Davoudian, L Chen, M Liu - ACM Computing Surveys (CSUR), 2018 - dl.acm.org
Recent demands for storing and querying big data have revealed various shortcomings of
traditional relational database systems. This, in turn, has led to the emergence of a new kind …

Poirot: Aligning attack behavior with kernel audit records for cyber threat hunting

SM Milajerdi, B Eshete, R Gjomemo… - Proceedings of the …, 2019 - dl.acm.org
Cyber threat intelligence (CTI) is being used to search for indicators of attacks that might
have compromised an enterprise network for a long time without being discovered. To have …

Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems

M Besta, R Kanakagiri, G Kwasniewski… - MICRO-54: 54th Annual …, 2021 - dl.acm.org
Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …

Efficient subgraph matching on billion node graphs

Z Sun, H Wang, H Wang, B Shao, J Li - arXiv preprint arXiv:1205.6691, 2012 - arxiv.org
The ability to handle large scale graph data is crucial to an increasing number of
applications. Much work has been dedicated to supporting basic graph operations such as …

On graph query optimization in large networks

P Zhao, J Han - Proceedings of the VLDB Endowment, 2010 - dl.acm.org
The dramatic proliferation of sophisticated networks has resulted in a growing need for
supporting effective querying and mining methods over such large-scale graph-structured …

Space-time processing for wireless communications

AJ Paulraj, CB Papadias - IEEE signal processing magazine, 1997 - ieeexplore.ieee.org
Space-time processing can improve network capacity, coverage, and quality by reducing co-
channel interference (CCI) while enhancing diversity and array gain. This article focuses …

Graph pattern matching: From intractable to polynomial time

W Fan, J Li, S Ma, N Tang, Y Wu… - Proceedings of the VLDB …, 2010 - research.ed.ac.uk
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes
it an np-complete problem. Moreover, it requires bijective functions, which are often too …

A subgraph isomorphism algorithm and its application to biochemical data

V Bonnici, R Giugno, A Pulvirenti, D Shasha, A Ferro - BMC bioinformatics, 2013 - Springer
Background Graphs can represent biological networks at the molecular, protein, or species
level. An important query is to find all matches of a pattern graph to a target graph …

Incremental graph pattern matching

W Fan, X Wang, Y Wu - ACM Transactions on Database Systems (TODS …, 2013 - dl.acm.org
Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …