Relational queries in Cloud Code (parse.com)

Question

Table structure:

Collection
name (String)

Image
collection (Pointer<Collection>)
url (String)
position (Number)

Image class has the column collection which is a pointer to the Collection class.

position is used to sort Images within a Collection.

What would be the most efficient way in Cloud Code to accomplish the following?

Lets assume I have ~3000 images and 3 collections.

What would be the best way to construct a query that returns an array containing all collections that have at least one associated Image and show only the first 5 images of each collection, sorted by position

Associated images for each collection would need to be included in the response and could look vaguely like this:

results: [{
  collection: {
    name: 'foo'
  },
  images: [{
    position: 0,
    url: 'test.jpg'
  },
  {
    position: 1,
    url: 'test.gif'
  }]
}, {

  ...

}]

All I can think of at the moment is doing two queries, one to get all Collections and another to get all Images upfront and then filter them, which seems quite backwards, coupled with the fact that Parse is limited to result sets of 1000 at maximum. Do I need to rethink my table structure?

I have two solutions, but I need a little more information. First, is the position absolute or relative? Does each collection have an item where position = 1, or is position unique and you're just looking for the lowest number? Second, is the number of Collection objects around 3 total, or 3 per user? — Ryan Kreager
Thanks Ryan. Firstly, position is relative, so each collection will have an item where position = 1. Secondly, the number of Collection objects are total, not per user, though as you've probably gathered it's just an arbitrary figure, the real number would likely be a little higher than that — Robin Pyon

Ryan Kreager Ryan Kreager · Accepted Answer · 2015-05-12T21:52:40

You can do this in a single call, given your constraints.

If you have a small number of Collection objects and you're using a relative position (each Collection has an Image where position = 1, 2, etc.), there's no need to overthink the problem. These constraints mean there are relatively few items where 'position' < 6 (or 5, if 0 is your first index position).

Simply make a call on the Image class and restrict it to objects where position is less than or equal to 5. Use the .include() to return the Collection object attached to each Image object as part of the return. Then sort the Image objects locally in whatever format you see fit.

Remember that Parse limits the number of objects than can be returned to 100, and you can increase that to up to 1000. If you .include() for the Collection on each Image, it means each returned Image counts for 2 objects, so you can return up to 500 Image objects. Sounds like this is well above your expected needs.

Voilá - one call, all your objects.

var Image = Parse.Object.extend("Image");
var query = new Parse.Query(Image);
query.lessThan("number", 6); //Assumes a lowest index of 1; switch to 5 if your lowest index number is 0
query.include("collection");
query.find({
  success: function(results) {
    //Sort the results according to Collection, send to controllers, etc.
    //Each result will have a pulled, valid Collection object ready on its .collection
  },
  error: function(error) {
    alert("Error: " + error.code + " " + error.message);
  }
});

UPDATE It is also worth noting that this approach outperforms a 'nested query' approach, both for a small number of collections or at scale (1000s or 10,000s of collections)

Relational queries in Cloud Code (parse.com)

What would be the most efficient way in Cloud Code to accomplish the following?

2 Answers