GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases

Autor: Nicola Licheri, Vincenzo Bonnici, Marco Beccuti, Rosalba Giugno

Publikováno v: BMC Bioinformatics, Vol 22, Iss 1, Pp 1-24 (2021)

Abstract Background Graphs are mathematical structures widely used for expressing relationships among elements when representing biomedical and biological information. On top of these representations, several analyses are performed. A common task is

Externí odkaz: https://doaj.org/article/0f48a263795844cdb84d282ed7c7b3bd

Indexing Simple Graphs by Means of the Resistance Distance

Autor: Chatchawit Aporntewan, Prabhas Chongstitvatana, Nachol Chaiyaratana

Publikováno v: IEEE Access, Vol 4, Pp 5570-5578 (2016)

For every simple connected graph, we present a polynomial time algorithm for computing a numerical index, which is composed of primary and secondary parts. Given a graph G = (V, E) where V and E are, respectively, vertex and edge sets, the primary pa

Externí odkaz: https://doaj.org/article/ecbc46c628c04002901defcac51b26df

Efficient access methods for very large distributed graph databases

Autor: José M. Cotos, José Ramon Rios Viqueira, Julián Flores, David Luaces

Publikováno v: Minerva: Repositorio Institucional de la Universidad de Santiago de Compostela
Universidad de Santiago de Compostela (USC)
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
instname

Subgraph searching is an essential problem in graph databases, but it is also challenging due to the involved subgraph isomorphism NP-Complete sub-problem. Filter-Then-Verify (FTV) methods mitigate performance overheads by using an index to prune out

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d6d6c90af69b792c42f7c1b55f8b40b
https://doi.org/10.1016/j.ins.2021.05.047

Optimized Distributed Subgraph Matching Algorithm Based on Partition Replication

Autor: Peng Pan, Jiali Bin, Ling Yuan

Publikováno v: Electronics, Vol 9, Iss 1, p 184 (2020)
Electronics
Volume 9
Issue 1

At present, with the explosive growth of data scale, subgraph matching for massive graph data is difficult to satisfy with efficiency. Meanwhile, the graph index used in existing subgraph matching algorithm is difficult to update and maintain when fa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20f73350a68bc6b0fac8637247e4d150
https://www.mdpi.com/2079-9292/9/1/184

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.