blocks|key|4873183|text|built+in中，Memcache具有此功能|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|4873184|edit:看起来，如果不更新源代码，您将无法获得原子更新，因为似乎没有锁函数。如果有(这不是很好)，你可以锁定值，获取它，在你的应用程序中增加它，放置它，然后解锁它。不过，这并不是最好的。|style|BOLD|4873185|entityMap|0|LINK|mutability|MUTABLE|url|http://www.apachefriends.org/docs/phpdoc_de/function.memcache-increment.html|1^0|0|8|0|A|8|1|0|0|5|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]|$A|U|B|V|1|W]]|C|$]]|$1|D|3|E|5|6|7|X|8|@$A|Y|B|Z|F|G]]|9|@]|C|$]]|$1|H|3|-4|5|6|7|10|8|@]|9|@]|C|$]]]|I|$J|$5|K|L|M|C|$N|O]]|P|$5|K|L|M|C|$N|O]]]]

<a href="http://www.apachefriends.org/docs/phpdoc_de/function.memcache-increment.html" rel="nofollow noreferrer">Memcache</a> has this functionality <a href="http://www.apachefriends.org/docs/phpdoc_de/function.memcache-increment.html" rel="nofollow noreferrer">built in</a>

edit: it looks like you're not going to get an atomic update without updating the source, as there doesn't appear to be a lock function. If there is (and this is not pretty), you can lock the value, get it, increment it in your application, put it, and unlock it. Suboptimal though.

blocks|key|1145950|text|拥有incr()函数的意义在于它都是存储的内部函数。你不需要把数据拉出来再推回来。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1145951|你正在做的事情听起来像是你想在你的代码中加入一些逻辑，将数据提取出来，递增，然后再推回……虽然这并不是很难(我想我刚刚描述了你是如何做的)，但它在某种程度上忽略了这一点。|1145952|为了获得好处，您需要更改密钥库的源。这可能很简单。|1145953|但是很多缓存已经有这个功能了。如果你真的需要它来提高速度，也许你应该找一个像memcached这样的替代存储来支持它。|1145954|entityMap^0|2|6|0|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|Q|8|@]|D|@]|E|$]]|$1|H|3|I|5|6|7|R|8|@]|D|@]|E|$]]|$1|J|3|K|5|6|7|S|8|@]|D|@]|E|$]]|$1|L|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|M|$]]

The point of having a <code>incr()</code> function is it's all internal to the store. You don't have to pull data out and push it back in.

What you're doing sounds like you want to put some logic in your code that pulls the data out, increments it and pushes it back in... While it's not very hard (I think I've just described how you'd do it), it does defeat the point somewhat.

To get the benefit you'd need to change the source of your key store. Might be easy.

But a lot of caches already have this. If you really need this for speed, perhaps you should find an alternate store like memcached that does support it.

blocks|key|4873221|text|看起来好像没有compareAndSet你就不走运了。但这将有助于从另一个角度来考虑这个问题。例如，如果您正在实现一个原子计数器来显示问题的赞成票数量，那么一种方法是为每个问题设置一个“表”，并为每个问题添加一个%2B1和一个“-1”。然后，为了“获取”，你需要对“表”求和。为了实现这一点，我假设“表”是便宜的，并且你不关心"get“需要多长时间才能计算，你只提到了incr/decr。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4873222|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

it kind of seems like without a compareAndSet then you are out of luck. But it will help to consider the problem from another angle. For example, if you were implementing an atomic counter that shows the number of upvotes for a question, then one way would be to have a "table" per question and to put a +1 for each upvote and -1 for each downvote. Then to "get" you would sum the "table". For this to work I assume "tables" are inexpensive and you don't care how long "get" takes to compute, you only mentioned incr/decr.

blocks|key|1140228|text|如果您希望以原子方式递增或递减与string类型的键关联的int值，并且如果您希望在必须对其中任何一个键执行原子操作之前知道所有键，请使用Dictionary<string,+int[]>并为每个键值预先填充一个单项数组。然后就可以通过像Threading.Interlocked.Increment(MyDict[keyString][0]);这样的代码在项目上执行原子操作(例如递增)。如果需要能够处理预先未知的键，则可能需要使用ConcurrentDictionary而不是Dictionary，但是如果两个线程试图同时为同一个键创建字典条目，则需要小心。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1140229|entityMap^0|G|6|T|3|1X|P|3B|1I|61|K|6O|A|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]|$9|K|A|L|B|C]|$9|M|A|N|B|C]|$9|O|A|P|B|C]|$9|Q|A|R|B|C]|$9|S|A|T|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|U|8|@]|D|@]|E|$]]]|G|$]]

If you wish to atomically increment or decrement an <code>int</code> value associated with a key of e.g. type <code>string</code>, and if you'll know all of the keys in advance of having to perform the atomic operations on any of them, use <code>Dictionary&lt;string, int[]&gt;</code> and pre-populate the dictionary with a single-item array for each key value. It will then be possible to perform atomic operations (e.g. increment) on items via code like <code>Threading.Interlocked.Increment(MyDict[keyString][0]);</code>. If you need to be able to deal with keys that are not known in advance, you may need to use a <code>ConcurrentDictionary</code> instead of <code>Dictionary</code>, but you need to be careful if two threads try to simultaneously create dictionary entries for the same key.

blocks|key|1088279|text|由于递增和递减是简单的“可交换”的加法和减法操作，因此您需要实现的是PN计数器。它是一种CRDT+(交换复制数据类型)。如何在Riak上实现这一点的各种示例在web和Github上都可以找到。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1088280|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Since increment and decrement are simple addition and subtraction operations that are "commutative", what you need to implement is a PN-Counter. It is a CRDT (commutative replicated data type). Various examples of how to implement this on Riak are available around the web and on Github.

How can I implement incr/decr on top of a key/value store?

I'm using a key value store that doesn't support incr and decr though which is why I want to create this. I have used Redis and Memcached incr and decr, so as mentioned in some of the answers then this is a perfect example of how I want the incr and decr to behave, so thanks to those who mentioned this.

How can I implement incr/decr on top of a key/value store?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

如何在键/值存储上实现incr/decr？我使用的键值存储不支持incr和decr，这就是我想要创建它的原因。我使用过Redis和Memcached incr和decr，所以正如一些答案中提到的那样，这是一个完美的例子，说明了我希望incr和decr如何运行，所以感谢那些提到这一点的人。

问如何在键/值存储上实现incr/decr？
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在键/值存储上实现incr/decr？EN