full outer join

Hi All,I have a problem with a customer database and performance. I have ran statspack and identified the worst performing SQL statement but have run out of ideas on how to get the SQL to perform better. The query was not a problem a month ago but has only recently started to cause problems. I do not have an old explain plan to compare it to. The query is from an application and so cannot be changed. Why are we doing so many ‘DB File Sequential Reads’ when the hash join is doing full table accesses ? And why am I reading 20,000+ blocks to get two rows. TKprof output:select * from lgncc_commoncaseview whereclientid = :b1 andclienttype = :b2 and (1=1)unionselect * from lgncc_commoncaseview wherexref1 = :b3 andobjecttype = :b4 and (1=1)call count cpu elapsed disk query current rows------- ------ -------- ---------- ---------- ---------- ---------- ----------Parse 1 0.00 0.00 0 0 0 0Execute 1 0.00 0.00 0 0 0 0Fetch 2 4.49 34.89 1787 21664 0 2------- ------ -------- ---------- ---------- ---------- ---------- ----------total 4 4.49 34.90 1787 21664 0 2Misses in library cache during parse: 0Optimizer goal: CHOOSEParsing user id: 64Rows Row Source Operation------- --------------------------------------------------- 2 SORT UNIQUE 2 UNION-ALL 1 NESTED LOOPS 1 HASH JOIN 4 TABLE ACCESS BY INDEX ROWID OBJ#(35867) 4 INDEX RANGE SCAN OBJ#(38739) (object id 38739) 117901 HASH JOIN OUTER 117901 TABLE ACCESS FULL OBJ#(35878) (lgncc_enquiry)1475502 TABLE ACCESS FULL OBJ#(35880) (lgncc_enquiryrelation) 1 TABLE ACCESS BY INDEX ROWID OBJ#(35873) 1 INDEX UNIQUE SCAN OBJ#(35874) (object id 35874) 1 NESTED LOOPS OUTER 1 NESTED LOOPS OUTER 1 NESTED LOOPS 1 TABLE ACCESS BY INDEX ROWID OBJ#(35878) 1 INDEX RANGE SCAN OBJ#(38738) (object id 38738) 1 TABLE ACCESS BY INDEX ROWID OBJ#(35873) 1 INDEX UNIQUE SCAN OBJ#(35874) (object id 35874) 1 INDEX RANGE SCAN OBJ#(38516) (object id 38516) 1 TABLE ACCESS BY INDEX ROWID OBJ#(35867) 1 INDEX UNIQUE SCAN OBJ#(35868) (object id 35868)Elapsed times include waiting on following events: Event waited on Times Max. Wait Total Waited ---------------------------------------- Waited ---------- ------------ SQL*Net message to client 2 0.00 0.00 db file sequential read 1382 0.17 16.42 db file scattered read 175 0.10 3.45 latch free 6 0.01 0.01 buffer busy waits 1137 0.08 11.15 SQL*Net more data to client 1 0.00 0.00 SQL*Net message from client 2 6.89 6.89Lgncc_CommonCaseview Definition SELECT-- [ID] ENQUIRY. ID AS REFERENCE. 0 AS TYPE,-- [DESCRIPTION] ENQUIRY. TITLE AS LINE1. TYPE. NAME AS LINE2,-- [CASE] ENQUIRY. CASEID AS CASEID. ENQUIRY. CASEREF AS RELATEDCASE. ENQUIRY. ENQUIRYTYPE AS ENQUIRYTYPE. ENQUIRY. OBJECTTYPE AS OBJECTTYPE. ENQUIRY. XREF1 AS XREF1. ENQUIRY. XREF2 AS XREF2. ENQUIRY. XREF3 AS XREF3. ENQUIRY. OBJECTDESC AS OBJECTDESC,-- [INTERACTION] INT. CLIENTTYPE AS CLIENTTYPE. INT. CLIENTID AS CLIENTID. INT. CLIENTNAME AS CLIENTNAME. INT. LOGID AS INTERACTIONID. INT. INTREF AS INTERACTIONREF. INT. VERIFIED AS INTERACTIONVERIFIED nvl(INT. INITCHANNEL. -1) AS INTERACTIONCHANNEL. INT. REFERENCE AS INTERACTIONREFERENCE. INT. STARTTIME AS INTERACTIONDATE,-- [STATUS] NULL AS TARGETDATE. ENQUIRY. STATUS AS STATUS,-- [AUDIT] ENQUIRY. CREATIONDATE AS CREATIONDATE. ENQUIRY. SOURCEID AS CREATEDBY. ENQUIRY. CREATIONDATE AS MODIFIEDDATE. NULL AS MODIFIEDBYFROM LGNCC_ENQUIRY ENQUIRY INNER JOIN LGNCC_ENQUIRYTYPE TYPE ON ENQUIRY. ENQUIRYTYPE = TYPE. ID LEFT OUTER JOIN LGNCC_ENQUIRYRELATION REL ON ENQUIRY. ID = REL. ENQUIRYID AND REL. RELATION = 1 LEFT OUTER JOIN LGNCC_INTLOGHDR INT ON INT. LOGID = REL. INTERACTIONID WHERE ENQUIRY. CASEREF IS NOT NULL AND ENQUIRY. DELETEDDATE IS NULL What does this mean?If you need it then it does not cause bad performances. If you does not need it then it causes bad performances as all what you do and is not necessary. If the lone purpose of an outer join was to cause bad performances then it would no more exist (Darwin law). RegardsMichel Sounds like the old "outer joins are slow" argument just like the "IN is faster than EXISTS" (or vice versa) or the "views are slow" argument... Plus of course the OP did actually post the view definition... Anyway why do you think that this shouldn't incur sequential reads? I can see full scan IO here as part of the HASH JOIN so sequential reads are definitely on the cards.... Unfortunately there's not enough information here to show exactly why Oracle is choosing a HASH JOIN with full scans but you do have unpredicated selects in that UNION on lgncc_enquiry and lgncc_enquiryrelation for the simple reason that come from LGNCC_ENQUIRY hence why you end up with full scans if the indexing strategy does not allow any other kind of access path when predicating on these columns. It would be necessary to see what the index structure is on LGNCC_INTLOGHDR plus number of rows whether histograms exist what the settings of various optimiser parameters are etc etc to truly work out what is going on such as whether bind variable peeking has occurred here and is skewing your plan for this particular instance of the query. What is the plan like for just running the first part of the query? i e. If you look at view definition then you will see that both clientid and clienttype columns are coming from LGNCC_INTLOGHDR table (which is accessed by the outer join). So IMHO (because outer join enforces join order) the optimizer performs following:1. Full table scan on lgncc_enquiry table (because there is no and conditions in WHERE referencing that table) and store it in hash area2. Full table scan on LGNCC_INTLOGHDR (probably there is no index on clientid and clienttype columns or optimizer thinks that full table scan is better/faster)In that case I would like:1. Verify an index existance on clientid and clienttype columns of LGNCC_INTLOGHDR table (and create one if needed).2. Exchage OUTER join for a regular one when accessing LGNCC_INTLOGHDR table. In my opinion - the OUTER join is not needed here because there is an explicit value is given in WHERE for 2 columns accessed in outer joined table ( clientid and clienttype). Michael select * from lgncc_commoncaseview whereclientid = '101000031874' andclienttype = 1 and(1=1)unionselect * from lgncc_commoncaseview wherexref1 = '101000031874' andobjecttype = 'C1' and(1=1)call count cpu elapsed disk query current rows------- ------ -------- ---------- ---------- ---------- ---------- ----------Parse 1 0.06 0.06 0 9 0 0Execute 1 0.00 0.01 0 0 0 0Fetch 2 5.75 9.62 16101 21927 0 1------- ------ -------- ---------- ---------- ---------- ---------- ----------total 4 5.81 9.69 16101 21936 0 1Misses in library cache during parse: 1Optimizer goal: CHOOSEParsing user id: 64 Rows Row Source Operation------- --------------------------------------------------- 1 SORT UNIQUE 2 UNION-ALL 1 NESTED LOOPS 1 HASH JOIN 4 TABLE ACCESS BY INDEX ROWID OBJ#(35867) 4 INDEX RANGE SCAN OBJ#(38739) (object id 38739) 118984 HASH JOIN OUTER 118984 TABLE ACCESS FULL OBJ#(35878) 1488680 TABLE ACCESS FULL OBJ#(35880) 1 TABLE ACCESS BY INDEX ROWID OBJ#(35873) 1 INDEX UNIQUE SCAN OBJ#(35874) (object id 35874) 1 NESTED LOOPS OUTER 1 NESTED LOOPS OUTER 1 NESTED LOOPS 1 TABLE ACCESS BY INDEX ROWID OBJ#(35878) 1 INDEX RANGE SCAN OBJ#(38738) (object id 38738) 1 TABLE ACCESS BY INDEX ROWID OBJ#(35873) 1 INDEX UNIQUE SCAN OBJ#(35874) (object id 35874) 1 INDEX RANGE SCAN OBJ#(38516) (object id 38516) 1 TABLE ACCESS BY INDEX ROWID OBJ#(35867) 1 INDEX UNIQUE SCAN OBJ#(35868) (object id 35868)Elapsed times include waiting on following events: Event waited on Times Max. Wait Total Waited ---------------------------------------- Waited ---------- ------------ SQL*Net message to client 2 0.00 0.00 db file sequential read 1150 0.03 0.59 db file scattered read 2640 0.08 4.72 SQL*Net more data to client 1 0.00 0.00 SQL*Net message from client 2 4.28 4.28 Also we already have an index on clientid clienttype and another on xref1/objecttype. We gather histograms by default. Table Name CDNColumn NDV Nullslgncc_enquiry 1477524 ID 1477524 0 EnquiryType157 0 Deleteddate120 1483280 Caseref 118215 1359309 Xref1 76112lgncc_intloghdr 1595125 Logid 1595125 0 Clientid80867 1354286 Clienttype4 0lgncc_enquiryrelation1693932 Interactionid1585278 0 Enquiryid1477457 0 Relation3 0lgncc_enquirytype 197 ID 197 0

Forex Groups - Tips on Trading

Related article:
http://www.orafaq.com/forum/index.php?t=rview&goto=286656&th=93838#msg_286656

comments | Add comment | Report as Spam

A developer is using a Joiner transformation to join two data streams (sources) and a full outer join is desired. decide the statement below that is adjust. Choose say(A) A Joiner transformations may perform a full outer join under all conditions. (B) A Joiner transformation may perform a full outer join only when one or more sides of the join are from a relational database. (C) A Joiner transformation may act a full outer join only when all sides of the join become from relational databases and one or more of those databases support outer joins. (D) A Joiner transformation may perform a full outer join only when no file sources are involved in the join (both sides are relational).

Forex Groups - Tips on Trading

Related article:
http://etltechicalexpertiseblog.blogspot.com/2007/11/full-outer-join.html

comments | Add comment | Report as Spam

Bantam Books 553293362 Spectra 553278398 Spectra 553293389 Spectra 553293370 Oxford University Press 198711905 L P Books 893402095 Del Rey Books 345323440 Del Rey Books 345334787 Del Rey Books 345308999 Books on Tape 5553673224 Books on Tape 5557076654 HarperCollins Publishers 246118318 Fawcett Books 449208133 9999999999 In this example books without a publisher would have NULL valued publishing house entries. beat outer join The intersection plus all records from the alter side table not in the left side table in addition to all records from the left side table not in the right side table. beat outer join syntax is as follows: SELECT … FROM table [alias] [. … ] [ beat OUTER connect table [alias] [ USING (field [. … ]) | ON (field = field [{AND | OR} [NOT] [ … ]) ] ] [ WHERE … ] [ GROUP BY … ] [ request BY … ]; This query finds the full outer join effectively both the left and the right outer joins at the same time: SELECT P. NAME AS PUBLISHER. E. ISBN FROM PUBLISHER P beat OUTER JOIN EDITION E USING (PUBLISHER_ID); PUBLISHER ISBN ——————————– ———- lose Press 1585670081 Ballantine Books 345333926 Ballantine Books 345336275 Ballantine Books 345438353 Bantam Books 553293362 Spectra 553278398 Spectra 553293370 Spectra 553293389 Oxford University Press 198711905 Bt Bound L P Books 893402095 Del Rey Books 345308999 Del Rey Books 345334787 Del Rey Books 345323440 Books on attach 5553673224 140 Chapter 5 We would desire to recommend you tested and proved services which you ordain surely sight to be of great quality.

Forex Groups - Tips on Trading

Related article:
http://domain.tomcatjavahosting.com/domain/web-design-course-bantam-books-553293362-spectra-553278398-spectra-553293389-spectra/

comments | Add comment | Report as Spam

==============================================================================TOPIC: mysql full outer join============================================================================== > why doesn't the following bring home the bacon?>> mysql> decide * from girls full outer join boys where girls city = boys city;>> where :>> displace delay girls;> displace table boys;> act table girls (name varchar(12) city varchar(12));> create table boys (name varchar(12) city varchar(12));> insert into girls values('Mary'. 'Boston');> insert into girls values('Nancy' null);> insert into girls values('Susan'. 'Chicago');> attach into girls values('Betty'. 'Chicago');> insert into girls values('Anne'. 'Denver');> insert into boys values('John'. 'Boston');> insert into boys values('Henry'. 'Boston');> attach into boys values('George' null);> insert into boys values('Sam'. 'Chicago');> attach into boys values('James'. 'Dallas');>> BTW left and right work OK! (regenerate full with left or right)> mysql> decide * from girls left join boys on girls city = boys city union select * from girls alter join boys on girls city = boys city;+-------+---------+--------+---------+| label | city | name | city |+-------+---------+--------+---------+| Mary | Boston | John | Boston || Mary | Boston | Henry | Boston || Nancy | NULL | NULL | NULL || Susan | Chicago | Sam | Chicago || Betty | Chicago | Sam | Chicago || Anne | Denver | NULL | NULL || NULL | NULL | George | NULL || NULL | NULL | James | Dallas |+-------+---------+--------+---------+8 rows in set (0.00 sec) Toralf Förster schrieb:> landonkelsey via DBMonster com wrote:> >> why doesn't the following work?>>>> mysql> select * from girls full outer join boys where girls city = boys city;>>>> where :...>>>> BTW left and right work OK! (replace full with left or right)>>> > What's about this : ?> > mysql> select * from girls left join boys on girls city = boys city union decide * from girls right join boys on girls city = boys city; I am rather new to databases and do not undergo much idea aboutapplication specific sql functionality. I undergo to apply a rankingsystem for which the details are as follows: Each tuple in a delay has an evaluate whose value is modified atfrequent intervals. After a certain span of time the tuples in thetable are to be arranged in the order of the attribute. However aftersorting the tuples a rank must be assigned to each tuple dependingupon the position in the sorted table. This rank is stored in aseparate evaluate in the same table. Can someone guide me on implementing this copy in a MySql database. Also if it is easier in the Oracle database.

Forex Groups - Tips on Trading

Related article:
http://data---mining.blogspot.com/2007/08/3-new-messages-in-2-topics-digest_31.html

comments | Add comment | Report as Spam

----------------columbo : does mysql not have beat OUTER connect?columbo : dang this sucksLeith : pyross: that is the my cnf not the error logLeith : columbo: nocolumbo : i think it does suckLeith : http://www xaprb com/communicate/2006/05/26/how-to-write-full-outer-join-in-mysql/columbo : doa http://www xaprb com/blog/2006/05/26/how-to-write-full-outer-join-in-mysql/pyross : Leith i fixed itpyross : :DLeith : columbo: works for mecolumbo : nm had user agent set to googlebot but thanks i'll believe it LeithAgent : how do i experience if mysql has the MyISAM engine included?weigon_ : Agent: show ENGINES;salle : chafe: MyISAM is *always* included and onchafe : thanks

Forex Groups - Tips on Trading

Related article:
http://scrutator.lo2k.net/Master/detail/id=53839

comments | Add comment | Report as Spam

A blog concerning use development and customization of Microsoft Dynamics CRM and SharePoint. I am a consultant at WM-Data/Logica CMG and specialize in CRM Architecture integration and development. SQL Reporting Services is a great drive. It allows you to create flexible and exportable (to pdf etc) reports. However things sometimes get a bit complicated and a normal problem that you face is the problem of columns containing null-values that you want to use for calculations. For this there is a nice answer called change integrity which replaces null with the value directed. firstname        lastname        age John            Smith            5 Peter            Jacks            null If you want to use the age-column to do some calculations or you just don't want it to be null just change your SELECT-statement to: decide firstname lastname. change integrity(age. 0) As NewAge. COALESCE(age. 0) * 2 As DoubleAge FROM contacts; firstname        lastname        NewAge    DoubleAge John            Smith            5        10     Peter            Jacks            0        0 A useful and simple functions to get you out of some nasty affect when doing for instance LEFT OUTER connect. RIGHT OUTER connect or FULL OUTER JOIN when the assay of returning null is great.

Forex Groups - Tips on Trading

Related article:
http://gustafwesterlund.blogspot.com/2007/09/sql-coalesce.html

comments | Add comment | Report as Spam

----------------Laban : Is it possible to ascertain the number of things that happen for every day in one queryandresF : Laban,yes.. using a joinLaban : Like: 2007-09-04 | 1 | 2 | 3 // Meaning 1 birthday. 2 work things and 3 other eventsLaban : SELECT c datum count(c id) cid count(b id) bid ascertain(w id) wid FROM schedule c LEFT JOIN birthdays b ON c id = b id LEFT connect work w ON c id = w id WHERE YEAR(c datum) = 2007 AND MONTH(c datum) = 9 assort BY c datum ORDER BY c datumLaban : Is what I tried. KISember : ok: http://rafb net/p/RgubJQ65 htmlmiro : is 'id_global' a valid name for a handle?andresF : aah Laban. you should do a full outer joinLaban : Beyond meLaban : Wanna enlighten me?andresF : Laban: http://www explore com co/search?q=mysql+full+outer+join&ie=utf-8&oe=utf-8&aq=t&rls=org mozilla:en-US:official&client=firefox-aAdamP : What's the opposite of decide DISTINCT?AdamP : I e. I be to select dupsjbalint : SELECTAdamP : But that will also show non duplicates?

Forex Groups - Tips on Trading

Related article:
http://scrutator.lo2k.net/Master/detail/id=51734

comments | Add comment | Report as Spam

Selection:If an attribute involved in any simple instruct in a conjunctive selection has an access path such as an index then this index can be used and the rest of the simple conditions can be applied to this change result set. If a composite index exists on the simple attributes of a conjunctive selection then this index is used. Disjunctive conditions are harder to hone because in this inspect an access path needs to exist on each one of the simple conditions. Join:In a join an access path must exist on one of the two join attributes. It is most efficient when the records of the relations are physically sorted by the determine of the join attributes. Sometimes a temporary choose may be done prior to the join to alter efficiency (sort-merge join). A chop join is used for the largest data sets. From http://blogs msdn com/craigfr/archive/2006/08/10/687630 aspx: When it comes to physical join operators chop join does the heavy lifting. While nested loops join works come up with relatively small data sets and merge join helps with moderately sized data sets chop join excels at performing the largest joins. Hash joins parallelize and measure better than any other join and are great at maximizing throughput in data warehouses. (I’ll address agree query execution in future series of posts.) chop join shares many characteristics with integrate join. Like integrate join it requires at least one equijoin interrelate supports residual predicates and supports all outer and semi-joins. Unlike merge join it does not demand ordered input sets and while it does support full outer join it does demand an equijoin predicate. The chop join executes in two phases: build and investigate. During the build phase it reads all rows from the first enter (often called the left or build input) hashes the rows on the equijoin keys and creates an in-memory chop table. During the investigate arrange it reads all rows from the back up enter (often called the alter or investigate enter) hashes these rows on the same equijoin keys and looks or probes for matching rows in the chop delay. Since chop functions can lead to collisions (two different key values that hash to the same value) we typically must analyse each potential match to ensure that it really joins. Heuristically the optimizer tries to apply the decide and project operations first and then the joins. The decide operation reduces the size of the intermediate file. In addition to heuristics the cost-based optimizer tries to estimate execution time mainly by considering number of access to plough blocks.

Forex Groups - Tips on Trading

Related article:
http://www.sougata-sarkar.com/blogs/tech/?p=336

comments | Add comment | Report as Spam

Microsoft OLE DB Provider for ODBC Drivers (0x80040E23)Satýr tanýtýcý silinmiþ veya silindi olarak iþaretlenmiþ bir satýrý gösteriyor. hatasý alýyorum oysa ki ayný sql sorgusunu sql management'de execute ettiðimde hatasýz kayýtlar listeleniyor ayrýca bg recordcount þeklinde alýnca gelmesi gereken kadar kayýtýn okunduðunu görüyorum nedir bu saçmalýk anlamadým sabahtan beri kodlardan bulanmýþ beynim yüzünden ufak biþeyi atlýyo olabilirim bu arama motoru dostu mesajýn hatrýna biri cevap evrir umarým beni kimse sallamamýþ ama böyle bir sorunla karþýlaþanlar baðlantýlarýný xxx. Open strSQL baglantim. 3. 1. &H0001 þeklinde açsýn... Galeri zoque net adresinde yer alan fotoðraf ve imajlarýn tüm haklarý ve sorumluluðu sahiplerine aittir. Bu çalýþmalarýn sahiplerinden yazýlý izin alýnmadan kullanýlmasý 5846 sayýlý Fikir ve Sanat Eserleri Yasasý'na göre suçtur. Ýlgilendiðiniz çalýþmalar varsa bizimle ya da doðrudan eser sahibiyle iletiþim kurabilirsiniz. Forum Yazýlýmý: Copyright ©2000 - 2007. Jelsoft Enterprises Ltd.

Forex Groups - Tips on Trading

Related article:
http://forum.zoque.net/sunucu-tabanli-proglama-server-side/25583-full-outer-join-ve-left-outer-join/

comments | Add comment | Report as Spam

This idea has been kicked around a whole lot. I experience. In IRC. Dark alleyways. Sweaty dance halls. Courts of law. It’s this: instead of writing SQL write Ruby. Generate the SQL behind the furnish. Erlang’s Mnesia database is something desire what I be: you write your queries in plain Erlang and they are translated into Mnesia-queries by. Nice trick but comprehend up: Ruby has a analyse tree too and we can get at it pretty easily thanks to. Some examples using an ActiveRecord copy followed by the SQL executed in the background: User first"SELECT * FROM users LIMIT 1" User select { |m| m label != 'macgyver' }"SELECT * FROM users WHERE users.`label` <> 'macgyver'" User decide { |u| u telecommunicate =~ /chris/ } first"decide * FROM users WHERE (users.`email` REGEXP 'chris') check 1" User select { |u| u karma > 20 } sort_by(&:karma) first(5)"decide * FROM users WHERE (users.`karma` > 20) request BY users karma LIMIT 5" User decide { |u| u email =~ 'ch%' } coat"decide ascertain(*) AS ascertain_all FROM users WHERE (users.`email` desire 'ch%')" User sort_by { |u| [ u email. -u created_at ] }"decide * FROM users request BY users email users created_at DESC" User sight { |u| u email =~ 'chris%' && u profile communicate == 'Err' }"decide users.`id` AS t0_r0... FROM users LEFT OUTER connect profiles ON profiles user_id = users id WHERE ((users.`telecommunicate` desire 'chris%' AND profiles communicate = 'Err')) LIMIT 1" Kicker methods are guys like detect each each_with_list map and first (with no argument). Methods like select choose_by and first (with an argument) are not kicker methods and return a Query disapprove without running any SQL. >> user = User decide { |u| u name == 'Dio' }=> (ask disapprove: call #to_sql or #to_chop to examine...)>> user to_sql=> "decide * FROM users WHERE users.`label` = 'Dio'" >> user to_chop=> {:conditions=>"users.`label` = 'Dio'"}>> user first # => SQL is run=> #<User:0x36896e4...> Note the to_chop—Ambition doesn’t actually run any SQL it just hands this hash to ActiveRecord::locate#sight. Anyway kickers undergo useful implications for Rails apps. Take this controller: categorise BandsController < ApplicationController def list @bands = bind sort_by(&:name) endend Since no kicker method is called. @bands is just a Query object—no SQL run. The SQL is only run once we label each in our believe: <h1>Rocktastic Bands<h1><ul><% @bands each do |bind| %> <li><%= band %></li><% end %></ul> <h1>Rocktastic Bands<h1><% cache do %> <ul> <% @bands each do |band| %> <li><%= band %></li> <% end %> </ul><% end %> This is pretty new so check the sharp edges. While we aren’t good at executing arbitrary Ruby inside the block we can command variables. Practically speaking instead of writing: Ideally this thing could turn into something like for databases. ask DataMapper. Sequel or ActiveRecord using Ruby’s plain jane Enumerable API. Hey maybe we can thrown an OODB or two into the mix? behind the scenes so feel remove to give them crazy conditions. All three are kickers. Also added were the entries and to_a kickers. User to_a is the same same as User find(:all). Works as an all-purpose kicker too—User decide { |u| u name == ‘kicker’ } to_a and whatnot. Finally cut is now an alias for []. You guys can convey PJ for that one. The new gem is out and it’s hot. I added some empty specs for destructive and constructive methods—dangerous thinking. I know. We’ll see. As a co-developer of ez_where. I must admit I really like desire. Especially the kicker/non-kicker methods to allow for lazy evaluation. Ez_where was a nice toy project to play around with. I guess… Once Ambition is create from raw material for production use I ordain definately believe this instead. DB::SELECT(array( "FROM" => "menus". "WHERE"=>array( 'id_menu NOT IN (decide id_parent FROM menus) '=> ''. 'id_parent = %d' => 0 ). "request BY"=>arrange( 'priority' => 'DESC'. 'id_parent' => 'ASC'. 'id_menu' => 'ASC'. ),'check' => 4)); Hah! I was just having this claim discussion the other day with a coworker about the future of Squirrel. Actually it’s change surface weirder since the only things you’re not doing that we weren’t discussing are conditionals and non-AR accessors inside the blocks. Very nifty. I can see some potential. Looks like all your joining is LEFT OUTER which makes sense for eager loading but can be onerous for cases where you just be the data from the one copy and only query by data in the associated models. Are queries that use INNER connect on the roadmap? This is some pretty cool cram. However. I evaluate that potentially the most interesting part of the whole bunch is these ask objects that get created. Even without special syntax for defining the sight conditions this is a huge gain for caching as mentioned. Is there any come about this functionality would be factored out from the Enumerable-type cram? I’d love to collide with heads with you guys some day and evaluate out how to act advantage of some of this. Sharon Rosner (Sequel) has been doing something similar but performance seems to be a draw-back. It’s my hope that eventually becomes a non-issue with Rubinius. :) Kansas is a Ruby ORM that doesn’t depends on parsetree and uses DBI for the datbase drivers and is in production use on a whole bunch of web sites over the measure 4.5 to 5 years. I don’t cut on it a lot because while it could benefit from some attention it’s also proved quite shelter and capable of handling almost everything I be of it. users_over_18 = dbh select(:User) do |u| u choose_by(u age) u age > 18)end It’s lightweight and relatively abstain. It supports transactions relationships marking results as read-only so changes to the objects don’t get pushed back to the db and a few other nifty things. The most current snapshot of it is at http://withruby com/kansas but I have a few minor modification requests from my small share of users so a more updated version of it ordain bring home the bacon at your friendly neighborhood rubyforge soonish. I also undergo some (old but comfort generally useful) docs at http://enigo com/projects/kansas Great to see! This looks exactly what I’ve been doing in Python for a few years now with Dejavu and now Geniusql. I’d love to compare notes sometime about implementation. Or jsut steal my work where needed; it’s all public domain. ;) Any information on getting this installed and working on a host without grow access? I’ve tried unpacking and using gemsonrails but I evaluate it’s a problem in the way parsetree and such is required. Hopefully it’s a book go on the road to making my apps more agnostic about persistent storage mechanisms. SQL databases are great and all but sometimes other choices are better.

Forex Groups - Tips on Trading

Related article:
http://errtheblog.com/post/10722

comments | Add comment | Report as Spam