Explore >> Select a destination
|
You are here 
|
alexzeng.wordpress.com | ||
| | | | |
oracle-randolf.blogspot.com
|
|
| | | | | When attempting to display only the first n rows of a result set that is ordered the Oracle optimizer offers special optimizations for these... | |
| | | | |
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... | |
| | | | |
alwayssql.wordpress.com
|
|
| | | | | Many times it happens that your backup (or restore) activity has been started by another Database Administrator or by a job, and you cannot use the GUI anything else to check the progress of that Backup / Restore. By combining multiple commands, I have generated below script which can give us a summary of current... | |
| | | | |
jonathanlewis.wordpress.com
|
|
| | | Here's a simple detail about bind peeking (during optimisation) that makes a big difference to "fetch first/next" queries. The optimizer knows about your bind types, and can peek at the bind values - but that doesn't mean it will do something sensible with them. Here's a little model to demonstrate the problem - starting with... | ||
