Proceedings ArticleDOI
GraphGrep: A fast and universal method for querying graphs
Rosalba Giugno,Dennis Shasha +1 more
- Vol. 2, Iss: 2, pp 112-115
Reads0
Chats0
TLDR
The algorithm uses hash-based fingerprinting to represent the graphs in an abstract form and to filter the database, and has been tested on databases of size up to 16,000 molecules and performs well in this entire range.Abstract:
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expression graph query language Glide that combines features from Xpath and Smart. Glide incorporates both single node and variable-length wildcards. Our algorithm uses hash-based fingerprinting to represent the graphs in an abstract form and to filter the database. GraphGrep has been tested on databases of size up to 16,000 molecules and performs well in this entire range.read more
Citations
More filters
Journal ArticleDOI
Survey of graph database models
Renzo Angles,Claudio Gutierrez +1 more
TL;DR: The main objective of this survey is to present the work that has been conducted in the area of graph database modeling, concentrating on data structures, query languages, and integrity constraints.
BookDOI
Managing and Mining Graph Data
Charu C. Aggarwal,Haixun Wang +1 more
TL;DR: This is the first comprehensive survey book in the emerging topic of graph data processing and contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy.
Journal ArticleDOI
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
TL;DR: This paper proposes a novel and efficient algorithm for testing subgraph isomorphism, QuickSI, and develops a new feature-based index technique to accommodate QuickSI in the filtering phase.
Proceedings ArticleDOI
GADDI: distance index based subgraph matching in biological networks
TL;DR: A novel distance measurement is proposed which reintroduces the idea of frequent substructures in a single large graph in a given large graph of thousands of vertices and the novel structure distance based approach (GADDI) is devised to efficiently find matches of the query graph.
Proceedings ArticleDOI
Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j
Florian Holzschuher,René Peinl +1 more
TL;DR: The results show that the graph-based back-end can match and even outperform the traditional JPA implementation and that Cypher is a promising candidate for a standard graph query language, but still leaves room for improvements.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
SMILES, a chemical language and information system. 1. introduction to methodology and encoding rules
TL;DR: This chapter discusses the construction of Benzenoid and Coronoid Hydrocarbons through the stages of enumeration, classification, and topological properties in a number of computers used for this purpose.