Approximate querying for the Property Graph Language Cypher
Fletcher, G. and Poulovassilis, Alexandra and Selmer, P. and Wood, Peter (2019) Approximate querying for the Property Graph Language Cypher. In: 2019 IEEE International Conference on Big Data, 9-12 Dec 2019, Los Angeles, U.S.. (In Press)
|
Text
bigdata2019.pdf - Author's Accepted Manuscript Download (169kB) | Preview |
Abstract
Graph databases are well-suited to managing large, complex, dynamically evolving datasets. However, for data that is irregular and heterogeneous, it may be difficult to formulate queries that precisely capture a user's information seeking requirements. This points to the need for approximate query processing capabilities that can automatically make changes to a so as to aid in the incremental discovery of relevant information. In this paper we motivate and explore techniques for providing such capabilities for the Cypher query language. This is the first time that query approximation has been investigated in the context of the property graph data model, which is becoming increasingly prevalent in research and industry.
Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| School: | Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems |
| Research Centre: | Birkbeck Knowledge Lab |
| Depositing User: | Peter Wood |
| Date Deposited: | 15 Jan 2020 12:46 |
| Last Modified: | 17 Jan 2020 05:43 |
| URI: | http://eprints.bbk.ac.uk/id/eprint/29920 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |