Using domain-specific languages for analytic graph databases
| Autor: | Martin Sevenich, Jayanta Banerjee, Hassan Chafi, Oskar van Rest, Zhe Wu, Sungpack Hong |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Power graph analysis
Domain-specific language SPQR tree Graph rewriting Graph database Theoretical computer science Wait-for graph Programming language Computer science General Engineering 020206 networking & telecommunications 02 engineering and technology computer.software_genre Graph Data model 020204 information systems 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) Compiler computer |
| Zdroj: | Proceedings of the VLDB Endowment. 9:1257-1268 |
| ISSN: | 2150-8097 |
| DOI: | 10.14778/3007263.3007265 |
| Popis: | Recently graph has been drawing lots of attention both as a natural data model that captures fine-grained relationships between data entities and as a tool for powerful data analysis that considers such relationships. In this paper, we present a new graph database system that integrates a robust graph storage with an efficient graph analytics engine. Primarily, our system adopts two domain-specific languages (DSLs), one for describing graph analysis algorithms and the other for graph pattern matching queries. Compared to the API-based approaches in conventional graph processing systems, the DSL-based approach provides users with more flexible and intuitive ways of expressing algorithms and queries. Moreover, the DSL-based approach has significant performance benefits as well, (1) by skipping (remote) API invocation overhead and (2) by applying high-level optimization from the compiler. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|