Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A SQL: 1999 code generator for the pathfinder xquery compiler
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
FERRY: database-supported program execution
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
On graph query optimization in large networks
Proceedings of the VLDB Endowment
gStore: answering SPARQL queries via subgraph matching
Proceedings of the VLDB Endowment
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
Horton: Online Query Execution Engine for Large Distributed Graphs
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Graph analysis: do we have to reinvent the wheel?
First International Workshop on Graph Data Management Experiences and Systems
Proceedings of the VLDB Endowment
Hybrid query execution engine for large attributed graphs
Information Systems
Hi-index | 0.00 |
We propose a SPARQL-like language, G-SPARQL, for querying attributed graphs. The language expresses types of queries which of large interest for applications which model their data as large graphs such as: pattern matching, reachability and shortest path queries. Each query can combine both of structural predicates and value-based predicates (on the attributes of the graph nodes and edges). We describe an algebraic compilation mechanism for our proposed query language which is extended from the relational algebra and based on the basic construct of building SPARQL queries, the Triple Pattern. We describe a hybrid Memory/Disk representation of large attributed graphs where only the topology of the graph is maintained in memory while the data of the graph is stored in a relational database. The execution engine of our proposed query language splits parts of the query plan to be pushed inside the relational database while the execution of other parts of the query plan are processed using memory-based algorithms, as necessary. Experimental results on real datasets demonstrate the efficiency and the scalability of our approach and show that our approach outperforms native graph databases by several factors.