Skip to main content

Fifty top PL/SQL players heading to the Dev Gym Championship!


2017 is no more. Which means that there are no more quizzes to be taken in 2017. Which means that we can now compute the rankings for the weekly PL/SQL tournament at the Dev Gym - and get ready for the 2017 championship event!

The top fifty-ranked players from 2017 will be invited to participate in the PL/SQL Challenge Championship for 2017, which will take place in March 2018 (date still to be finalized).

The number in parentheses after their names are the number of championships in which they have already participated. As you can see, many of these players are incredibly dedicated to their craft as Oracle Database Developers generally and to their standing on the Dev Gym in particular.

Congratulations to all listed below on their accomplishment and best of luck in the upcoming competition!

By the way, if you are not yet taking our weekly tournament quizzes at the Dev Gym, give it a try. You do not have to play competitively; you can opt-out of rankings.  Heck, you can even play incognito by changing your gym name. The main thing is:

Expertise Through Exercise!


Name Rank Qualification Country
Stelios Vlasopoulos (14) 1 Top 50 No Country Set
mentzel.iudith (17) 2 Top 50 Israel
NielsHecker (18) 3 Top 50 Germany
James Su (12) 4 Top 50 Canada
siimkask (17) 5 Top 50 Estonia
Andrey Zaytsev (6) 6 Top 50 Russia
Chad Lee (14) 7 Top 50 United States
Tony Winn (6) 8 Top 50 Australia
Karel_Prech (7) 9 Top 50 No Country Set
Jan Šerák (3) 10 Top 50 Czech Republic
li_bao (5) 11 Top 50 Russia
Ludovic Szewczyk (2) 12 Top 50 No Country Set
JustinCave (14) 13 Top 50 United States
_tiki_4_ (10) 14 Top 50 Germany
HSteijntjes (0) 15 Top 50 Netherlands
patch72 (4) 16 Top 50 Netherlands
Vyacheslav Stepanov (16) 17 Top 50 No Country Set
tonyC (3) 18 Top 50 United Kingdom
seanm95 (4) 19 Top 50 United States
Mike Tessier (1) 20 Top 50 Canada
Henry_A (4) 21 Top 50 Czech Republic
Alexey Ponomarenko (2) 22 Top 50 No Country Set
Michal P. (1) 23 Top 50 Poland
Chase Mei (3) 24 Top 50 Canada
swesley_perth (3) 25 Top 50 Australia
mcelaya (2) 26 Top 50 Spain
Sandra99 (1) 27 Top 50 Italy
Sartograph (0) 28 Top 50 Germany
Maxim Borunov (4) 29 Top 50 Russia
JasonC (2) 30 Top 50 United Kingdom
coba (2) 31 Top 50 No Country Set
msonkoly (2) 32 Top 50 Hungary
berkeso (1) 33 Top 50 Hungary
Rakesh Dadhich (9) 34 Top 50 India
Talebian (4) 35 Top 50 Netherlands
USER35250 (0) 36 Top 50 No Country Set
Rytis Budreika (5) 37 Top 50 Lithuania
pablomatico (0) 38 Top 50 No Country Set
Hertha Rettinger (0) 39 Top 50 Germany
Kias (0) 40 Top 50 No Country Set
Otto Palenicek (1) 41 Top 50 Germany
Rimantas Adomauskas (4) 42 Top 50 Lithuania
USER59562 (0) 43 Top 50 No Country Set
PZOL (3) 44 Top 50 Hungary
Enrico Rebecchi (1) 45 Top 50 Italy
ivan_blanarik (11) 46 Top 50 Slovakia
whab@tele2.at (0) 47 Top 50 Austria
VictorD (4) 48 Top 50 Russia
NickL (2) 49 Top 50 United Kingdom
Joaquin_Gonzalez (11) 50 Top 50 Spain

Comments

Post a Comment

Popular posts from this blog

Running out of PGA memory with MULTISET ops? Watch out for DISTINCT!

A PL/SQL team inside Oracle made excellent use of nested tables and MULTISET operators in SQL, blending data in tables with procedurally-generated datasets (nested tables).  All was going well when they hit the dreaded: ORA-04030: out of process memory when trying to allocate 2032 bytes  They asked for my help.  The error occurred on this SELECT: SELECT  *    FROM header_tab trx    WHERE (generated_ntab1 SUBMULTISET OF trx.column_ntab)       AND ((trx.column_ntab MULTISET             EXCEPT DISTINCT generated_ntab2) IS EMPTY) The problem is clearly related to the use of those nested tables. Now, there was clearly sufficient PGA for the nested tables themselves. So the problem was in executing the MULTISET-related functionality. We talked for a bit about dropping the use of nested tables and instead doing everything in SQL, to avoid the PGA error. That would, however require lots of work, revamping algorithms, ensuring correctness, you know the score. Then my eyes snagge
4 comments
Read more

How to Pick the Limit for BULK COLLECT

This question rolled into my In Box today: In the case of using the LIMIT clause of BULK COLLECT, how do we decide what value to use for the limit? First I give the quick answer, then I provide support for that answer Quick Answer Start with 100. That's the default (and only) setting for cursor FOR loop optimizations. It offers a sweet spot of improved performance over row-by-row and not-too-much PGA memory consumption. Test to see if that's fast enough (likely will be for many cases). If not, try higher values until you reach the performance level you need - and you are not consuming too much PGA memory.  Don't hard-code the limit value: make it a parameter to your subprogram or a constant in a package specification. Don't put anything in the collection you don't need. [from Giulio Dottorini] Remember: each session that runs this code will use that amount of memory. Background When you use BULK COLLECT, you retrieve more than row with each fetch,
4 comments
Read more

Quick Guide to User-Defined Types in Oracle PL/SQL

A Twitter follower recently asked for more information on user-defined types in the PL/SQL language, and I figured the best way to answer is to offer up this blog post. PL/SQL is a strongly-typed language . Before you can work with a variable or constant, it must be declared with a type (yes, PL/SQL also supports lots of implicit conversions from one type to another, but still, everything must be declared with a type). PL/SQL offers a wide array of pre-defined data types , both in the language natively (such as VARCHAR2, PLS_INTEGER, BOOLEAN, etc.) and in a variety of supplied packages (e.g., the NUMBER_TABLE collection type in the DBMS_SQL package). Data types in PL/SQL can be scalars, such as strings and numbers, or composite (consisting of one or more scalars), such as record types, collection types and object types. You can't really declare your own "user-defined" scalars, though you can define subtypes  from those scalars, which can be very helpful from the p
24 comments
Read more