Getting document with max size of inner array in MongoDB -


नमूना मोंगो दस्तावेज़: 

  {" _id ":" 128374 "," x ": [{" i ":" 83847575 "," y ": [{" i ":" 938 9 48 9 283 "," टी ":" 2014-04-11 टी 20: 46: 57+ 0000 "}" {"i": "938948 9 284", "t": "2014-04-11T20: 47: 57 + 0000"}]}, {"i": "83847576", "y": [ I ":" 238234 9 385 "," t ":" 2014-01-15T23: 43: 29 + 0000 "}, {" i ":" 9389489286 "," टी ":" 2014-04-11T20: 47: 57+ 0000 "}, {" i ":" 9389489286 "," t ":" 2014-04-11T20: 49: 57 + 0000 "}]}]}   
 आप कैसे प्राप्त करें प्रति सरणी 'y' दस्तावेज़ की अधिकतम संख्या? मैं जिस समस्या को हल करने की कोशिश कर रहा हूं वह रिकॉर्ड प्राप्त करना है जिसमें अधिकतम संख्या है 'वाई' धन्यवाद!  
 निम्नलिखित मुझे 'वाई' की कुल संख्या देता है <"" $ "" {"$" "": "$ X": " $ X "}}, {" $ unwind ":" $ xy "}, {" $ group ": {_id: null, number: {$ sum: 1}}})    
 
 
 यदि आप संग्रह में दस्तावेज ढूंढना चाहते हैं जिसमें सबसे अधिक "y" तत्व हैं जो एकीकरण में ऐसा करने का तरीका है ढांचा इस तरह होगा:  
  db.coll.aggregate ({$ unwind: "$ x"}, {$ परियोजना: {ysize: {$ size: "$ xy"}}} , {$ Group: {_ id: "$ _ id", numys: {$ sum: "$ ysize"}}}, {$ sort: {numys: -1}}, {$ limit: 1})   
 यह प्रत्येक दस्तावेज़ में आंतरिक y arrays के आकार के प्रोजेक्ट का उपयोग करता है, और समूह उन्हें प्रत्येक दस्तावेज़ में कितने "y" तत्वों की गणना करने के लिए वापस जोड़ता है  
 सॉर्ट और सीमा जोड़ना आपको शीर्ष एक या शीर्ष एन को रखने की अनुमति देता है।  
 यह आपको पूरे दस्तावेज़ में कुल y तत्वों की संख्या से आदेश देता है। यदि आप सिर्फ यह जानना चाहते हैं कि कौन सा दस्तावेज़ में सबसे लंबे समय तक सरणी वाई है, तो यह भी आसान है, बस समूह को निकालें और ठीक करें:  
  db.coll.aggregate ({$ unwind: "$ X"}, {$ project: {ysize: {$ size: "$ xy"}}}, {$ sort: {ysize: -1}}, {$ सीमा: 1})

Comments

Post a Comment

Popular posts from this blog

sql - Return Function using Cursor -

My current schedule is: USERID Department NAME Real Estimated 522 Xyz Department John Wayne 2/1/14/14 8:34 522 Investigation Department John Wayne 2/17/1411: 21 78 9Except Department Bill Smith 2/17/14 9:41 78 9 Excise Department Bill Smith 2/17/14 11:16 78 9 Excise Department Bill Smith 2 / 17/14 11:50 78 9 Excise Department Bill Smith 2/17/14 12: 18 856 Explore Department Raul Castill 2/17/14 9:25 I have to create a function which enables me to enter a user ID and that Allows the user to return data from the person. However, I want to take the first line and want to hold the actual date and then put it in the 'column' check and I also carry the last row and store it in 'Check Out' in the column call. Basically, for every day, I want to record the records in the user's time and want to take the time for each day. This is what I have done so far " return @RtnValue table (useridd integer, deptname varchar (max), emplname varchar (100), actualDate da...
Read more

javascript - Is there any way to add a new parameter to a function programmatically? -

Since I can set the number of expectations by calling a function its function.length Property, do I have to programmatically create the right number of parameters to include in that function at runtime? Example: var xyz = function (a, b) {}; Var BCD = function (A, B, C, D, E, F) {}; // vararg example var doc = document, func_length = xyz.length; Doc.xyz = (function () {returns function (A, B, C, D, E) works for one / but other is not}}}. Call (doctor); / * With `only two parameters ', like' Return function (A, B)`, if this function is used for `xyz` (although in this case 5 works fine), and return function ( If the function is used for 'BCD' (which does not work with only five parameters) with A, B, C, D, E, F) `6 / / Xyz.apply (blank, arguments) Think about ... but which logic ..? : // Returning function (A, B, C, D, E) does not support work with more than five parameters, which will be mostly class - hence my question / I also know very well That I use an obj...
Read more

c++ - why does this code produce a runtime error? -

contains # lt; Stdio.h & gt; #to & lt include, conio.h & gt; #to & lt include, windows.h & gt; Structure node {int a; Structure node * next; }; Zero constructivist (Structure node ** head) {struct node * p, * temp; Int n; Printf ("Enter number \ n"); Scanf ("% d", & amp; n); P = (straight node *) maulok (psychophag (strip node)); P-> = N; If (* head == 0) {* head = p; P-> Next = 0; Temporary = p; } And {temp-> next = p; Temporary = p; P-> Next = 0; }} Void frontbacksplit (Structure node ** head, Structure node ** Head1, Structure node ** Head 2) {int counter = 0, i; Structure node * temporary, * p; Temporary = * head; While (temporary! = 0) {counter ++; Temporary = temp-> Next; } Int n; If (counter% 2 == 0) {n = counter / 2; } And {n = (counter + 1) / 2; } Temp = * head; (I = 0; i & lt; n-1; i ++) for {if (* head1 == 0) {* head1 = temp; } Temp = temp- & gt; next; } P = temp; Temporary = temp-> Next; P-> Next ...
Read more