Explore >> Select a destination
|
You are here 
|
jonathanlewis.wordpress.com | ||
| | | | |
hourim.wordpress.com
|
|
| | | | | The last Jonathan Lewis post on RAC Planswhich finished by the following phrases: "If you're going to hard-code hints into a query then take a look at the outline it generates when it does the right thing, and that will tell you about the 15 or so hints you've missed out. (Better still, consider generating... | |
| | | | |
tonyhasler.wordpress.com
|
|
| | | | | When a table is accessed by multiple members of a parallel query server set, the execution plan may show the use of block range granules (PX BLOCK ITERATOR) or partition granules (PX PARTITION [RANGE|LIST|HASH] ITERATOR or PX PARTITION [RANGE|LIST|HASH] ALL). The basic ideas surrounding these concepts are discussed in numerous blogs and books, including my... | |
| | | | |
www.dbaglobe.com
|
|
| | | | | A blog about on new technologie. Hands-on note about Hadoop, Cloudera, Hortonworks, NoSQL, Cassandra, Neo4j, MongoDB, Oracle, SQL Server, Linux, etc. | |
| | | | |
sookocheff.com
|
|
| | | Title and Author of Paper Access Path Selection in a Relational Database Management System. P. G. Selinger et al. Summary This paper describes methods of the SQL query optimizer for determining the cost of satisfying a query. It also describes methods for choosing among several competing methods. What are the motivations for this work? SQL is a high-level language where requests for data are stated non-procedurally. The user is not expected to need any knowledge of how the data is stored in the database or how it is retrieved. Thus, it is up to the DBMS to choose an appropriate access path for data retrieval on the users behalf. By designing the database in this fashion, we preserve data independence, where a users view of the data is independent of the data... | ||
