Sorting Items By Number Of Votes

Hi.  I'm new to CouchDB (and this list) and I am looking for some  
help.  I am trying to do something very similar to http://wiki.apache.org/couchdb/View_Snippets#aggregate_sum
.
I have a database with 2 types of documents, resources and votes.  The  
documents in the database look something like this:
resource 1 {_id: 1, type:"resource", name:"resource 1", ...}
resource 2 {_id: 2, type:"resource", name:"resource 2", ...}
resource 3 {_id: 3, type:"resource", name:"resource 3", ...}
vote for resource 3 {type:"vote", resource_id: 3, user_id: foo}
vote for resource 2 {type:"vote", resource_id: 2, user_id: foo}
vote for resource 3 {type:"vote", resource_id: 3, user_id: bar}
I want to create a view that will give me the resources in order of  
the most votes along with the number of votes.  In other words, I want  
to write a view that gives me something like the following results:
{id:3, key:3, value:{doc:(document for resource 3), score: 2}},
{id:2, key:2, value:{doc:(document for resource 2), score: 1}},
{id:1, key:1, value:{doc:(document for resource 1), score: 0}},
Here is my map function:
function(doc) {
	if (doc.type == 'vote' && doc.resource_id) {
		emit(doc.resource_id, doc);
	} else if (doc.type == 'resource' && doc.name) {
		emit(doc._id, doc);
	}
}
Here is my reduce function:
function(keys, values, rereduce) {
	var score = 0;
	var output_doc = {};
	for (var i=0; i < values.length; i++) {
		if (values[i].type == 'vote') {
			++score;
		} else if (values[i].type == 'resource') {
			output_doc = values[i];
		}
	}
	return {doc:output_doc, score:score};
}
When I query this view in Futon I get the following error:
"Reduce output must shrink more rapidly"
Am I trying to do something that can't be done with CouchDB?  Or am I  
just missing something?
Thanks so much for any help.
- Devon

That is true.  My app would need to detect the conflict, reload the  
document, add the vote to the array again and re-try the update.  I  
don't imagine enough collisions will occur in my app that this will be  
a problem.  And I believe it will make my views a lot easier to deal  
with.
- Devon

Per the online documentation "The number of votes can be modified in the replica set configuration. You should never change the number of votes per member unless your set has more than seven members." I'm not sure I agree with this and I'd like to explain why (and then hopefully someone can tell me I'm wrong and clarify). If I have two data centers in hot (active) / cold (standby). Lets say
Hi all, I'm currently working on an app where there are many "Pages" (identified by a page_id, of sorts), which may contain "Messages". Message documents having the matching page_id belong to a given Page, where users can cast "Vote" documents, indicating whether or not a user likes a Message. I would like to efficiently be able to do two things: 1) Show all Messages, for a Page, ordered descending
Hi, I was just reading through the by-laws[1] and it occurred to me that we might have the wrong definition of lazy consensus. Specifically, we define it here: "3.2.1. Lazy Consensus - Lazy consensus requires 3 binding +1 votes and no binding -1 votes." My understanding of lazy consensus is that it requires no votes whatsoever. In fact, there are two modes. The first is to simply do whatever it
cellog Sat Nov 11 00:52:19 2006 UTC Modified files: /pearweb/include pear-election.php Log: improve validation of choices correct language of error message when choices and minimum/maximum do not line up http://cvs.php.net/viewvc.cgi/pearweb/include/pear-election.php?r1=1.4&r2=1.5&diff_format=u Index: pearweb/include/pear-election.php diff -u pearweb/include
Hi all! I have a question as to the optimal method of counting and storing votes in an online poll. performing a query on a table which holds values for each option. Currently I - query the table to get the current count - increment the count by 1 - UPDATE the table with the new value I wonder: what happens if two users submit the answer simulatneously, and the answer is the same. Will
Hash: SHA1 Hi everyone. I need to ensure that only one 'vote' per 'article' can be cast by each visitor and was hoping you might share any opinions you have on my solution: IP's seem the way to go so I thought the simplest and most secure method would be this: Have a MySQL table with 2 fields: IP and ARTICLE_ID Check the $REMOTE_ADDR against this table WHERE IP = $REMOTE_ADDR AND
Hello, i would like to ask for a one week delay of the automatic deletion of the proposal. Currently I finish the code for the call for votes phase. http://pear.php.net/pepr/pepr-proposal-show.php?id� regards Stefan
Im writing a voting system for mp3s at lans I wanna know if there is a simpler way to do the following $songvotes = mysql_query("SELECT votes FROM mp3s Where ID=".$vote); $row = mysql_fetch_array($songvotes); $songvotes = $row["votes"]; mysql_query("UPDATE mp3s SET votes = ".($songvotes+1)." WHERE ID=".$vote); } what its doing is adding one to an mp3s votes when someone clicks a link ofr
Hello all, I have a field in my schema which holds the number of votes a document has. How can I boost documents based on that number? Something like the one which has the maximum number has a boost of 10, the one with the smallest number has 0.5 and in between the values get calculated automatically. Thanks, Alexandru Badiu
We have a 3-node cluster, and will be adding a 4th hidden server off-site, for backups.        This creates an even number of votes, and would necessitate adding an arbiter to bring the number up to 5.        It seems to me, that setting the new node's votes to 0 would be a better solution.     Then there are still the three original replica set members which have an odd number.