top button
Flag Notify
Site Registration

What would you do to optimize slow-running queries?​

+4 votes
What would you do to optimize slow-running queries?​
posted Jun 30, 2015 by Manikandan J

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

0 votes
answer Jul 2, 2015 by Vrije Mani Upadhyay
Similar Questions
+2 votes

I have the following setup:

class Unit
 has_many :reports

class Report
 belongs_to :unit

Basically I have a list of units and I want to select the last report for each unit (based on time) and order the resulting last reports by longitude.

Sounds simple, but my implementation looks like this:

units = current_user.accessible_units
report_ids = []
if units.size > 0 do |id|
    report = id).order("time desc").limit(1)
    if !report.empty?
      report_ids << report.try(:first).try(:id)
reports = Report.where(id: report_ids).order("longitude desc")

Is there a way to perform this same query using sql (active record relations) and minimize the use of ruby iterators, like map and each? Also notice in query above, I make two hits to the database by querying reports for time and then descending order. Is there a way to eliminate that too?

+3 votes

(ie. NULL - 25 = ?)​

+3 votes

How to convert c # inline queries into stored procedure written in transact sql?