Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automata theory for XML researchers
ACM SIGMOD Record
Optimizing Regular Path Expressions Using Graph Schemas
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
RE-tree: an efficient index structure for regular expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
A query language for biological networks
Bioinformatics
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Proceedings of the 16th international conference on World Wide Web
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Dex: high-performance exploration on large graphs for information retrieval
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Graphs-at-a-time: query language and access methods for graph databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SPARQLeR: Extended Sparql for Semantic Association Discovery
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
High-performance information extraction with AliBaba
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
SoQL: A Language for Querying and Creating Data in Social Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Representing, Querying and Transforming Social Networks with RDF/SPARQL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Pregel: a system for large-scale graph processing - "ABSTRACT"
Proceedings of the 28th ACM symposium on Principles of distributed computing
A query language for analyzing networks
Proceedings of the 18th ACM conference on Information and knowledge management
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A RPL through RDF: expressive navigation in RDF graphs
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Adding regular expressions to graph reachability and pattern queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Regular path queries on large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Regular path queries on large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |
The significance of regular path queries (RPQs) on graph-like data structures has grown steadily over the past decade. RPQs are, often in restricted forms, part of graph-oriented query languages such as XQuery/XPath and SPARQL, and have applications in areas such as semantic, social, and biomedical networks. However, existing systems for evaluating RPQs are restricted either in the type of the graph (e.g., only trees), the type of regular expressions (e.g., only single steps), and/or the size of the graphs they can handle. No method has yet been developed that would be capable of efficiently evaluating general RPQs on large graphs, i.e., with millions of nodes/edges. We present a novel approach for answering RPQs on large graphs. Our method exploits the fact that not all labels in a graph are equally frequent. We devise an algorithm which decomposes an RPQ into a series of smaller RPQs using rare labels, i.e., elements of the query with few matches, as way-points. A search thereby is decomposed into a set of smaller search problems which are tackled in a bi-directional fashion, supported by a set of graph indexes. Comparison of our algorithm with two approaches following the traditional methods for tackling such problems, i.e., the usage of automata, reveals that (a) the automata-based methods are not able to handle large graphs due to the amount of memory they require, and that (b) our algorithm outperforms the automata-based approach, often by orders of magnitude. Another advantage of our algorithm is that it can be parallelized easily.