Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cypher Query Language

Known as: Cypher 
Cypher is a declarative graph query language for the graph database Neo4j that allows for expressive and efficient querying and updating of the graph… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
The Cypher property graph query language is an evolving language, originally designed and implemented as part of the Neo4j graph… Expand
  • figure 2
  • figure 1
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2018
2018
Cypher is a query language for property graphs. It was originally designed and implemented as part of the Neo4j graph database… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Review
2017
Review
2017
We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models: edge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2014
2014
When querying databases, users often wish to express vague concepts, as for instance asking for the cheap hotels. This has been… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
NoSQL and especially graph databases are constantly gaining popularity among developers of Web 2.0 applications as they promise… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
2010
2010
An encryption scheme is said to be entropically secure if an adversary whose min-entropy on the message is upper bounded cannot… Expand
Is this relevant?
2010
2010
Wireless sensor networks are now in widespread use to monitor regions, detect events and acquire information. To reduce the… Expand
  • figure 1
  • table I
  • table III
  • table II
  • table IV
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We establish a lower bound of O(log N/log log N) remote memory references for N-process mutual exclusion algorithms based on… Expand
Is this relevant?
1999
1999
Plan libraries are the most important knowledge source of many plan recognition systems. The plan decompositions they contain… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
This paper brings together a number of previously known techniques in order to obtain practical and efficient implementations of… Expand
Is this relevant?