Repost: Oracle Trivia Quiz

All the answers to the quiz are in the November 2014 issue of the NoCOUG Journal . I am the editor of the NoCOUG Journal. What’s NoCOUG, you ask? Only the oldest and most active Oracle users group in the world. If you have not attended a NoCOUG conference in the last 28 years—yes that’s how long NoCOUG has been around—you can attend the winter conference on January 27 for free subject to availability of free (more...)

OT: Career Advice for Oracle Database Professionals

A strong advocate for women in technology, Kellyn Pot’Vin is an OakTable Network Member and was an Oracle ACE Director until joining a group of Enterprise Manager specialists at Oracle Corporation. She specializes in environment optimization tuning, automation, and creating robust, enterprise-level systems. Kellyn works almost exclusively on multi-TB-sized databases, including Exadata and solid-state disk solutions, and is known for her extensive work with Enterprise Manager 12c and its command-line interface. She is the co-author (more...)

OT: Career Advice for Oracle Database Beginners

Tom Kyte is a Senior Technical Architect in Oracle’s Server Technology Division. Before starting at Oracle, Tom worked as a systems integrator building large-scale heterogeneous databases and applications, mostly for military and government customers. Tom spends a great deal of time working with the Oracle database and, more specifically, working with people who are working with the Oracle database. In addition, he is the Tom behind the “AskTom” column in Oracle Magazine, answering people's questions (more...)

OT: Trip Report: Managing the Largest OLTP Database in the World

At the NoCOUG fall conference at the eBay town hall in San Jose, we got a first-hand look at the workings of the most complex database environments in the world.(read more)

OT: Toad University at NoCOUG fall conference

The NoCOUG fall conference featuring Toad University will be held at the eBay Town Hall in San Jose, CA on Wednesday, November 19. If you have never attended a NoCOUG conference in the 28-year history of NoCOUG—yes, that’s how long NoCOUG has been around—you’re invited to attend the upcoming conference for free. Simply send your name, title, and company to contact_nocoug@nocoug.org.

Toad Overview and Roadmap for DBAs, Developers, and Data Analysts—Daniel Norwood & (more...)

NoCOUG watchers protest despicable tactics being used by NoCOUG management

FOR IMMEDIATE RELEASE NoCOUG watchers protest despicable tactics being used by NoCOUG management SILICON VALLEY (NOVEMBER 13, 2014) – Veteran NoCOUG watchers all over Northern California have been protesting the despicable tactics being used by NoCOUG management to lure Oracle Database professionals to the NoCOUG conference at the beautiful eBay Town Hall next week. Instead […]

OT: Oracle Trivia Quiz

All the answers to the quiz are in the November 2014 issue of the NoCOUG Journal . I am the editor of the NoCOUG Journal. What’s NoCOUG, you ask? Only the oldest and most active Oracle users group in the world. If you live in the San Francisco bay area and have never ever attended a NoCOUG conference in the last 28 years (that’s how long NoCOUG has been around), please contact me for a free (more...)

Oracle Trivia Quiz

All the answers can be found in the November 2014 issue of the NoCOUG Journal. Which executive vice-president of product development at Oracle began as the PL/SQL product manager? (page 23) Which senior vice-president of server technologies at Oracle wrote the B-Tree indexing code back in the day? (page 23) What is the evil twin […]

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 26: Answers to the Final Exam! (Part IV)

The answers to the third problem in Part 22 of this series “We Don’t Use Databases; We Don’t Use Indexes.”(read more)

Results of the NoCOUG SQL Mini-Challenge

As published in the November 2014 issue of the NoCOUG Journal The inventor of the relational model, Dr. Edgar Codd, was of the opinion that “[r]equesting data by its properties is far more natural than devising a particular algorithm or sequence of operations for its retrieval. Thus, a calculus-oriented language provides a good target language […]

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 25: Answers to the Final Exam! (Part III)

The answers to the third problem in Part 21 of this series.(read more)

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 24: Answers to the Final Exam! (Part II)

The answers to the second problem in Part 21 of this series.(read more)

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 23: Answers to the Final Exam! (Part I)

The answers to the first problem in Part 21 of this series.(read more)

The Hitchhiker’s Guide to the EXPLAIN PLAN: The story so far (Part 11–22)

Before continuing with this series, please take a minute to read any installments that you may have missed.(read more)

The Hitchhiker’s Guide to the EXPLAIN PLAN: The story so far (Part 11–23)

On the Toad World site, I’m writing a series of blog posts and Wiki articles on the subject of EXPLAIN PLAN. I’m using EXPLAIN PLAN as a motif to teach not just SQL tuning but also relational theory, logical database design, and physical database design. In a year’s time, I hope to have enough material for […]

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 22: The Final Exam! (Part III We Don’t Use Databases; We Don’t Use Indexes)

If you were the owner of a book store and you received a shipment of books, how would you go about putting the books on the shelves? Would you stand at the door of your store and fling each book onto any shelf where you saw some space? No! Then why do all of us store data that way? The default organization of data in table is “heap” which means that incoming records are stored (more...)

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 20: The Final Exam! (Part I)

According to Ralph Kimball, there is only one basic evaluation approach—along with a “bail out” option—in a star schema: evaluate the constraints on the dimension tables, prepare a list of composite keys of the fact table, and use a composite index on the fact table to fetch the data from the fact table. When you notice that the list of composite candidate keys is too long, you bail out to a full-table scan in which (more...)

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 21: The Final Exam! (Part II)

In addition to the basic evaluation approach of Kimball and the bail-out option, Oracle Database offers a lightning-fast option which uses “bitmap” indexes. A bitmap index is composed of multiple “bitmaps” instead of primary key and ROWID pairs like conventional indexes. Each bitmap in a bitmap index is an array of bits (0s and 1s) and tracks exactly one of the values that occurs in the indexed column. The 1s in a bitmap indicate that (more...)

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 19: Practice Exam IV

Instead of evaluating all join possibilities by brute force, the optimizer adopts reasonable strategies in the hope that they will lead to reasonably efficient query plans. The oldest strategy in the book is to pick a “driving” table and then keep picking another table with which to join until all tables have been joined. However, this depends on the ability to perform “view merging” if the query contains views and “subquery unnesting” if the query (more...)

The Hitchhiker’s Guide to the EXPLAIN PLAN Part 18: Practice Exam III

Every time the optimizer chooses to join two data sets using the hash-join method, it has to decide which of the two data sets will be the in-memory lookup table. The smaller of the two data sets is the logical choice. The lookup table is always placed on the left hand side of the join node. This can result in zig-zag trees.(read more)