content/operate/oss_and_stack/stack-with-enterprise/release-notes/redisgraph/redisgraph-2.10-release-notes.md
RedisGraph v2.10.15 requires:
This is a maintenance release for RedisGraph 2.10.
Update urgency: MODERATE: Program an upgrade of the server, but it's not urgent.
Details:
Bug fixes:
Improvements:
This is a maintenance release for RedisGraph 2.10.
Update urgency: MODERATE: Program an upgrade of the server, but it's not urgent.
Details:
Bug fixes:
INDEX SCAN followed by DEL followed by SET) (MOD-5430)This is a maintenance release for RedisGraph 2.10.
Update urgency: MODERATE: Program an upgrade of the server, but it's not urgent.
Details:
Bug fixes:
This is a maintenance release for RedisGraph 2.10.
Update urgency: MODERATE: Program an upgrade of the server, but it's not urgent.
Details:
Bug fixes:
UNION clause sets or modifies an indexed propertyMATCH clauses where label filters are used (MOD-5093)WITH n MATCH (n:X) are ignoredThis is a maintenance release for RedisGraph 2.10.
Update urgency: HIGH: There is a critical bug that may affect a subset of users. Upgrade!
Details:
Bug fixes:
This is a maintenance release for RedisGraph 2.10.
Update urgency: HIGH: There is a critical bug that may affect a subset of users. Upgrade!
Details:
Bug fixes:
toInteger and toIntegerOrNull don't convert Booleansright and left should reply with an error when length is nullTIMEOUT_MAX configuration parameter is not enforced when TIMEOUT_DEFAULT is 0indegree and outdegree - relationships are counted more than once when same relationship type is supplied more than onceImprovements:
This is a maintenance release for RedisGraph 2.10.
Update urgency: HIGH: There is a critical bug that may affect a subset of users. Upgrade!
Details:
Bug fixes:
Improvements:
This is the General Availability release of RedisGraph 2.10.
RedisGraph 2.10 introduces new path algorithms, additional expressivity (constructs and functions), performance improvements, and bug fixes.
algo.SPpaths procedure yields one, n, or all minimal-weight, optionally bounded-cost, optionally bounded-length paths between a given pair of nodes.algo.SSpaths procedure yields one, n, or all minimal-weight, optionally bounded-cost, optionally bounded-length paths from a given node.SET for adding node labels and REMOVE for removing node labels, node properties, and edge properties.DELETE.toBoolean, toBooleanOrNull, toFloatOrNull, toIntegerOrNull, toStringOrNull, toBooleanList, toFloatList, toIntegerList, toStringList, properties, split, last, isEmpty, e, exp, log, log10, sin, cos, tan, cot, asin, acos, atan, atan2, degrees, radians, pi, and haversin.GRAPH.SLOWLOG g RESET.Bug fixes (since 2.10-RC1):
:R|RUNWINDing relationshipsMERGE ... ON ... - cannot remove property by setting it to nullsqrt, log, log10 - incorrect result for negative values