Home
Search results “Oracle range index scan”
Indexes in Oracle :Index Scan Methods :Part 2
 
30:18
The Video Explains when should you create indexes. The difference between Simple and composite Index, Relevance of order in composite indexes and Index Scan Methods in detail. 1.Index Unique scan 2.Index Range Scan 3. Index Skip Scan 4. Fast full Index Scan 5. Full Index Scan If you have any questions just drop in a comment
Views: 10920 Tech Coach
Index Range Scan
 
03:18
Index Range Scan
Views: 151 TUTOR SC
A Story of Indexes and Full Table Scans: Finding All the Red Sweets Part 1
 
08:43
"Why isn't Oracle using my index?!" is a common question people have when tuning SQL queries. In this episode Chris compares two methods for finding all the red candies from party bags he's prepared. He shows how these are like a full table scan and an index range scan. He goes on to compare the performance of these two approaches. He shows when a full table scan becomes more efficient than an index range scan and vice versa. ============================ The Magic of SQL with Chris Saxon Copyright © 2015 Oracle and/or its affiliates. Oracle is a registered trademark of Oracle and/or its affiliates. All rights reserved. Other names may be registered trademarks of their respective owners. Oracle disclaims any warranties or representations as to the accuracy or completeness of this recording, demonstration, and/or written materials (the “Materials”). The Materials are provided “as is” without any warranty of any kind, either express or implied, including without limitation warranties or merchantability, fitness for a particular purpose, and non-infringement.
Views: 9216 The Magic of SQL
06 06 Index Full Scan Operations
 
03:27
ORACLE
Views: 1006 oracle ocm
07 06 Index Skip Scan Operations
 
03:14
ORACLE
Views: 1021 oracle ocm
FTS vs Index Scan   Part 1
 
02:19
what is "full table scan in oracle" and "oracle index scan" Small Excerpt from "Oracle performance Tuning Session". http://www.dbvidya.com/oracle-performance-tuning-videos/ [email protected] +91 991 2323 000 Oracle Performance Tuning Online Training : http://www.dbvidya.com/course/performance-tuning-for-dba/ Oracle SQL Performance Tuning Training Online : http://www.dbvidya.com/course/sql-tuning-advanced/ Oracle Performance Tuning Videos Tutorial for DBA and Developers : http://www.dbvidya.com/oracle-performance-tuning-videos/ Oracle AWR Tutorial: http://www.dbvidya.com/course/oracle-awr/ Erwin Tool Online Training : http://www.dbvidya.com/course/erwin-tool/ ER Data Modeling Course : http://www.dbvidya.com/course/er-modeling/ Dimensional Modeling Training Online : http://www.dbvidya.com/course/dimensional-modeling/ Oracle Database Blogs : http://www.dbvidya.com/blog/
Views: 402 DbVidya
What is BLOCK RANGE INDEX? What does BLOCK RANGE INDEX mean? BLOCK RANGE INDEX meaning
 
08:12
What is BLOCK RANGE INDEX? What does BLOCK RANGE INDEX mean? BLOCK RANGE INDEX meaning - BLOCK RANGE INDEX definition - BLOCK RANGE INDEX explanation. Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license. SUBSCRIBE to our Google Earth flights channel - https://www.youtube.com/channel/UC6UuCPh7GrXznZi0Hz2YQnQ A Block Range Index or BRIN is a database indexing technique. They are intended to improve performance with extremely large tables. BRIN indexes provide similar benefits to horizontal partitioning or sharding but without needing to explicitly declare partitions. A BRIN is applicable to an index on a table that is large and where the index key value is easily sorted and evaluated with a MinMax function. BRIN were originally proposed by Alvaro Herrera of 2ndQuadrant in 2013 as 'Minmax indexes'. Implementations thus far are tightly coupled to internal implementation and storage techniques for the database tables. This makes them efficient, but limits them to particular vendors. So far PostgreSQL is the only vendor to have announced a live product with this specific feature, in PostgreSQL 9.5. Other vendors have described some similar features, including Oracle, Netezza 'zone maps', Infobright 'data packs', MonetDB and Apache Hive with ORC/Parquet. BRIN operate by "summarising" large blocks of data into a compact form, which can be efficiently tested to exclude many of them from a database query, early on. These tests exclude a large block of data for each comparison. By reducing the data volume so early on, both by representing large blocks as small tuples, and by eliminating many blocks, BRIN substantially reduce the amount of detailed data that must be examined by the database node on a row-by-row basis. Data storage in large databases is layered and chunked, with the table storage arranged into 'blocks'. Each block contains perhaps 1MB in each chunk and they are retrieved by requesting specific blocks from a disk-based storage layer. BRIN are a lightweight in-memory summary layer above this: each tuple in the index summarises one block as to the range of the data contained therein: its minimum and maximum values, and if the block contains any non-null data for the column(s) of interest. Unlike a traditional index which locates the regions of the table containing values of interest, BRIN act as "negative indexes", showing the blocks that are definitely not of interest and thus do not need to be processed further. Some simple benchmarks suggest a five-fold improvement in search performance with an index scan, compared to the unindexed table. Compared to B-trees, they avoid their maintenance overhead. As BRIN are so lightweight, they may be held entirely in memory, thus avoiding disk overhead during the scan. The same may not be true of B-tree: B-tree requires a tree node for every approximately N rows in the table, where N is the capacity of a single node, thus the index size is large. As BRIN only requires a tuple for each block (of many rows), the index becomes sufficiently small to make the difference between disk and memory. For a 'narrow' table the B-tree index volume approaches that of the table itself; the BRIN may be only 5-15% of it. A large database index would typically use B-tree algorithms. BRIN is not always a substitute for B-tree, it is an improvement on sequential scanning of an index, with particular (and potentially large) advantages when the index meets particular conditions for being ordered and for the search target to be a narrow set of these values. In the general case, with random data, B-tree may still be superior. A particular advantage of the BRIN technique, shared with Oracle Exadata's Smart Scanning, is in the use of this type of index with Big Data or data warehousing applications, where it is known that almost all of the table is irrelevant to the range of interest. BRIN allows the table to be queried in such cases by only retrieving blocks that may contain data of interest and excluding those which are clearly outside the range, or contain no data for this column. A regular problem with the processing of large tables is that retrieval requires the use of an index, but maintaining this index slows down the addition of new records. Typical practices have been to group additions together and add them as a single bulk transaction, or to drop the index, add the batch of new records and then recreate the index. Both of these are disruptive to simultaneous read / write operations and may not be possible in some continuously-operating businesses. With BRIN, the slowdown from maintaining the index is much reduced compared to B-tree. Wong reports that B-tree slowed down additions to an unindexed 10GB table by 85%, but a comparable BRIN only had an overhead of 11%. BRIN may be created for extremely large data where B-tree would require horizontal partitioning.....
Views: 314 The Audiopedia
BitMap Indexes & Examples
 
11:59
BitMap Indexes & Examples watch more videos at https://www.tutorialspoint.com/videotutorials/index.htm Lecture By: Mr. Parth Panjab, Tutorials Point India Private Limited
Table Scan Vs Index Scan Vs Index Seek in sql server | by SQL Training Sessions
 
16:52
This session will help you understand following : 1. Table Scan vs Index Scan vs Index Seek 2. How these concepts affects the sql query performance. 3. Explain Actual Execution Plan 4. How to include actual execution plan in sql query 5. How to analyse sql query Thanks for watching! By sql Training Sessions By SQL Enjoy learning :)
07 03 Bitmap Indexes
 
06:43
ORACLE
Views: 11186 oracle ocm
Choosing between FULL and INDEX scan
 
01:48
Choosing between FULL and INDEX scan
Views: 16 TUTOR SC
Reverse Key Index :Types of Btree Index in Oracle
 
15:44
Please subscribe to my new channel. https://www.youtube.com/c/AnIndianAbroadd The Videos explains how Reverse Btree Index works and in what condition they shall be used. Reverse Btree index are used to solve index block contention. You can't perform range scans in reverse btree Index.
Views: 3360 Tech Coach
oracle interview question index related questions
 
06:57
Oracle Interview Question - oracle index related questions Description: Oracle Interview Question - oracle index related questions 1. What is Index? How to create index? 2. What are the types of index? 3. How to find the list of indexes for a given table? 4. Explain B-tree index 5. Explain Bitmap index 6. Explain "Function based" index 7. Explain "Reverse Key" index 8. When to choose what type of index? 9. How to know index is being used? 10. How to monitor index usage? 11. What are the advantages/drawbacks of indexes? Click here to subscribe to my youtube channel http://www.youtube.com/channel/UCBt6VrxAIb5jLh9HLDcdwtQ?sub_confirmation=1 Oracle Interview questions and Answers at https://www.youtube.com/playlist?list=PLb1qVSx1k1Vr0v4wVyvT3GEuA0J0M4xBm Oracle 18C New features at https://www.youtube.com/playlist?list=PLb1qVSx1k1Vqe06V1tIBcvnslMPWX69bW Oracle 12C New features at https://www.youtube.com/playlist?list=PLb1qVSx1k1VqM1u2IHWzZIgziqejl6wx- Oracle PLSQL records and collections at https://www.youtube.com/playlist?list=PLb1qVSx1k1VpAFTXopXvAh_D3PLcTntdm
Views: 1684 Siva Academy
Oracle Exadata Smart Scan - Limitations and Best Practices
 
03:21
Smart Scan is a wonderful capability, but you don't always get it. It's impossible for many execution plans, and this is a major restriction. If you think about what a Smart Scan actually does, it delivers individual columns, individual rows back to the instance. Now, a buffer cache can accept only blocks. Therefore, Smart Scan cannot possibly put those columns of rows into the buffer cache. It's simply not formatted appropriately. So, a Smart Scan has to return values directly into the session's PGA or, to put it another way, the only access method that can use Smart Scan is direct read. Well, what access methods can use direct read? There are only two, which are table full scan and index fast full scan. Any other access method, typically index range scan, table access by row ID, cannot use a Smart Scan. The second major issue, there are strict limitations of the type of objects that can be accessed through Smart Scan. It really is only heap tables. You can't use indexes. You can't use clusters. You can't use IOTs. Heap tables only. Perhaps hardest to track down and giving sometimes very erratic results is that Smart Scan can be interrupted by various conditions. You've met all the requirements for Smart Scan, directory and so on, got the right execution plan. The Smart Scan starts and then hits something that causes a problem. Issues that we know cause problems are, for instance, read consistency, also delayed block cleanout, change rows. Any of those issues and a few others mean that the storage tier will have to interrupt its Smart Scan, deliver complete blocks into that buffer cache, let your session then do what is necessary to the block, and only then can the Smart Scan proceed. Now, in order to maximize the use of Smart Scan, there may be quite a lot of work. Very often, you'll have to adjust your index structures. Making them invisible is a nice technique there. There are many, many, many parameters that can influence the likelihood of achieving a Smart Scan, and almost inevitably you're going to be rewriting a lot of hint SQL and putting hints in it to get the correct execution plans that can enable a Smart Scan to occur. This is all because of one fundamental problem; the optimizer is not in any way aware of the Exadata. The optimizer develops an execution plan in exactly the way it would without the Exadata storage. The use of Smart Scan, the awareness of Exadata comes at the next level down. The optimizer develops the plan through a normal pass and then passes it through to the SQL execution engine, and it's the SQL execution engine that determines, on a case-by-case basis, whether to use the Smart Scan. This means that you might develop a plan and execute the statement 50 times. Forty-nine times, you get a Smart Scan. The 50th time, for whatever reason, the SQL execution engine decides not to. This can result in somewhat erratic performance.
Views: 1746 SkillBuilders
Index Unique Scan
 
03:04
Index Unique Scan SQL
Views: 87 TUTOR SC
SQL Server Index Internals – Clustered Index Seek (Range Scan) (by Amit Bansal)
 
10:52
In this video, you will understand what really Clustered Index Seek means and why it can be misleading, sometimes. Learn about Amit Bansal’s ultimate video course on SQL Server Performance Tuning: http://bit.ly/abvideocourse Stay Connected with Amit Bansal and subscribe to the exclusive list of his session attendees (conference and pre-cons), class participants & video viewers. You will get just one email in two weeks with good links to continue your learning. http://bit.ly/connectwithab Also, you can join ‘SQLMaestros Champs’ Telegram group and participate in SQL Server discussions. It’s a forum for SQL Server lovers - https://t.me/joinchat/AnAGwxBU1KXORoUR9jD_dw If you work on other technologies in MS Data + AI Stack, join this group: http://www.dataplatformgeeks.com/dpg-mobile/ Video resources including presentation, demo files, code snippets and more learning material is available on http://www.dataplatformgeeks.com/ (Join for free and access all the resources) Connect With The Speaker (Amit Bansal) -Follow on Twitter: https://twitter.com/A_Bansal -Follow on FaceBook at http://www.facebook.com/amit.r.bansal -Follow on LinkedIN: http://www.linkedin.com/in/amitbansal2010 -Facebook Page: https://www.facebook.com/AmitRSBansal/ Connect with SQLMaestros: http://sqlmaestros.com/ - http://www.twitter.com/SQLMaestros - https://www.facebook.com/SQLMaestros - Email us: [email protected] Data Platform Summit Asia's largest learning event on AI, Data & Advanced Analytics. https://www.dps10.com/ SQLMaestros Video Courses Amit Bansal’s popular SQL Performance Tuning course is now going live in video format. http://sqlmaestros.com/sql-server-videos-courses/ SQLMaestros Hands-On-Labs Want to practice SQL, Azure & BI concepts, step-by-step with exercises, screenshots, instructions & explanations? Get access to 100+ labs covering the entire Microsoft Data Platform stack. Try SQLMaestros Hands-On-Labs – the new way of practical, self-paced learning. Anytime. Anywhere. http://hols.SQLMaestros.com Email [email protected] SQLMaestros Learning Kits The kit comprises of PowerPoint presentations, lab manuals, workbook & instructor demos & notes. The kit is based on Amit Bansal’s Performance Tuning Master Class. https://sqlmaestros.com/sql-server-courseware/ SQL Server Health Check If your SQL Server deployments are not performing good or if you have seen early signs of performance degradation, SQLMaestros can help you with a thorough health check. https://sqlmaestros.com/sql-server-health-check/ Have technical questions? Join the largest SQL group on FB www.facebook.com/groups/theSQLGeeks Our LinkedIn group https://www.linkedin.com/groups/6753546 Our Telegram group on mobile http://www.dataplatformgeeks.com/dpg-mobile/ DataPlatformGeeks (DPG) Community Join the fastest growing community of data & analytics professionals Why Join DPG? http://www.dataplatformgeeks.com/ -Attend all events hosted by DPG, including SQLMaestros Special Events -Get access to free videos, labs, magazines and host of learning resources -Download all events & conference material -Learn new skills. Sharpen existing skills -Be part of Asia’s Largest Data/Analytics Community -Opportunity to be a regional mentor & speaker at our events -Immense technical & professional development If you wish to speak at DataPlatformGeeks events, fill out this form: http://www.dataplatformgeeks.com/call-speakers-dpg-events/ If you wish to become a Regional Mentor with DataPlatformGeeks, fill out this form: http://www.dataplatformgeeks.com/become-regional-mentor/ Watch all recorded DPG webinars here: www.youtube.com/SQLServerGeeks
Views: 770 SQLMaestros
SQL Server Indexes - Basics by Satya Ramesh (Recorded Webinar)
 
01:07:44
Please note that this is a recorded webinar. It was recorded during live presentation. In this session, we are going to cover the basics of Clustered Indexes & Non-Clustered Indexes. 1. How to create them and some best practices to follow. 2. What is a covering index and how is it useful. 3. What is fragmentation and how to defrag indexes 4. What is fill factor and how is is useful. This is going to be a level 100 session targeted towards Developers & DBAs beginning their careers with SQL Server. Webinar resources including presentation, demo files, code snippets and more learning material is available on http://www.dataplatformgeeks.com/ (Join for free and access all the resources) As a DPG member, you have free access to all our learning resources like videos, Hands-On-Labs & past event resources. Suggest us topics that you wish to learn through our webinars: http://www.dataplatformgeeks.com/dpg-... Connect with DataPlatformGeeks: http://www.dataplatformgeeks.com/ http://www.twitter.com/SQLServerGeeks https://www.facebook.com/SQLServerGeeks Email us: [email protected] Have technical questions? Join the largest SQL/Data group on FaceBook – https://www.facebook.com/groups/thesq... LinkedIn Group: https://www.linkedin.com/groups/6753546 DataPlatformGeeks (DPG) Community Join the fastest growing community of data & analytics professionals Why Join DPG? http://www.dataplatformgeeks.com/ -Attend all events hosted by DPG, including SQLMaestros Special Events -Get access to free videos, labs, magazines and host of learning resources -Download all events & conference material -Learn new skills. Sharpen existing skills -Be part of Asia’s Largest Data/Analytics Community -Opportunity to be a regional mentor & speaker at our events -Immense technical & professional development -http://www.dataplatformgeeks.com/ Do you know about Data Platform Summit (DPS)? Learn about the largest Data/Analytics Learning Event in Asia. http://www.DPS10.com | [email protected] A word from our sponsors SQLMaestros Hands-On-Labs Want to practice SQL, Azure & BI concepts, step-by-step with exercises, screenshots, instructions & explanations? Get access to 100+ labs covering the entire Microsoft Data Platform stack. Try SQLMaestros Hands-On-Labs – the new way of practical, self-paced learning. Anytime. Anywhere. http://hols.SQLMaestros.com Email [email protected] SQLMaestros Video Courses http://sqlmaestros.com/sql-server-vid... SQLMaestros Master Classes & Accelerators http://sqlmaestros.com/ SQL Health Check http://sqlmaestros.com/ Advanced SQL Training (On-site) Want your team to experience Amit Bansal's Advanced SQL Training? http://www.SQLMaestros.com Email [email protected] Corporate Training Looking for any other high-end technology training for your team? http://www.PeoplewareIndia.com Email [email protected] Connect with the founder of DataPlatformGeeks/SQLServerGeeks Follow on Twitter: https://twitter.com/A_Bansal Follow on FaceBook at http://www.facebook.com/amit.r.bansal Follow on LinkedIN: http://www.linkedin.com/in/amitbansal... Facebook Page: https://www.facebook.com/AmitRSBansal/
Why Isn't My Query Using an Index?
 
47:01
“Why isn’t my query using an index?” is a common question people have when tuning SQL. This session explores the factors that influence the optimizer’s decision to answer this question. It does so by comparing fetching rows from a database table to finding all the red M&Ms a packet, and contrasts using an index range scan and a full table scan. It also introduces the concepts of blocks and the clustering factor. The session offers a discussion of how these affect the optimizer's calculations, and includes a demo of how these concepts work in practice using real SQL queries. This session is intended for developers who want to learn the basics of how the optimizer chooses between an index range or full table scan. Speaker: Chris Saxon
Views: 323 Oracle Developers
What is REVERSE INDEX? What does REVERSE INDEX mean? REVERSE INDEX meaning & explanation
 
04:05
What is REVERSE INDEX? What does REVERSE INDEX mean? REVERSE INDEX meaning - REVERSE INDEX definition - REVERSE INDEX explanation. Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license. SUBSCRIBE to our Google Earth flights channel - https://www.youtube.com/channel/UC6UuCPh7GrXznZi0Hz2YQnQ Database management systems provide multiple types of indexes to improve performance and data integrity across diverse applications. Index types include b-trees, bitmaps, and r-trees. In database management systems, a reverse key index strategy reverses the key value before entering it in the index. E.g., the value 24538 becomes 83542 in the index. Reversing the key value is particularly useful for indexing data such as sequence numbers, where each new key value is greater than the prior value, i.e., values monotonically increase. Reverse key indexes have become particularly important in high volume transaction processing systems because they reduce contention for index blocks. Reversed key indexes use b-tree structures, but preprocess key values before inserting them. Simplifying, b-trees place similar values on a single index block, e.g., storing 24538 on the same block as 24539. This makes them efficient both for looking up a specific value and for finding values within a range. However if the application inserts values in sequence, each insert must have access to the newest block in the index in order to add the new value. If many users attempt to insert at the same time, they all must write to that block and have to get in line, slowing down the application. This is particularly a problem in clustered databases, which may require the block to be copied from one computer's memory to another's to allow the next user to perform their insert. Reversing the key spreads similar new values across the entire index instead of concentrating them in any one leaf block. This means that 24538 appears on the same block as 14538 while 24539 goes to a different block, eliminating this cause of contention. (Since 14538 would have been created long before 24538, their inserts don't interfere with each other.) Reverse indexes are just as efficient as unreversed indexes for finding specific values, although they aren't helpful for range queries. Range queries are uncommon for artificial values such as sequence numbers. When searching the index, the query processor simply reverses the search target before looking it up. Typically, applications delete data that is older on average before deleting newer data. Thus, data with lower sequence numbers generally go before those with higher values. As time passes, in standard b-trees, index blocks for lower values end up containing few values, with a commensurate increase in unused space, referred to as "rot". Rot not only wastes space, but slows query speeds, because a smaller fraction of a rotten index's blocks fit in memory at any one time. In a b-tree, if 14538 gets deleted, its index space remains empty. In a reverse index, if 14538 goes before 24538 arrives, 24538 can reuse 14538's space.
Views: 1078 The Audiopedia
How Does the Phyiscal Location of Rows Affect Indexes?: Finding All the Red Sweets Part 2
 
09:25
In part one of the red candy series, Chris compared the efficiency of using a index range scan and full table scan to access data. He found that a full table scan was more efficient when fetching more rows than there are table blocks. This analysis made a big assumption however. It worked on the presumption that there was no correlation between the order of candies in the document and which the bags they were in. In this episode tests this assumption. Chris looks at how the physical order of rows in a table can affect the efficiency of indexes on it. He discusses how Oracle tracks this via the clustering factor. ============================ The Magic of SQL with Chris Saxon Copyright © 2015 Oracle and/or its affiliates. Oracle is a registered trademark of Oracle and/or its affiliates. All rights reserved. Other names may be registered trademarks of their respective owners. Oracle disclaims any warranties or representations as to the accuracy or completeness of this recording, demonstration, and/or written materials (the “Materials”). The Materials are provided “as is” without any warranty of any kind, either express or implied, including without limitation warranties or merchantability, fitness for a particular purpose, and non-infringement.
Views: 3604 The Magic of SQL
SQL Server Performance Tuning Video Course - Master Series (By Amit Bansal)
 
34:44
Learn about Amit Bansal’s ultimate video course on SQL Server Performance Tuning: http://bit.ly/abvideocourse Stay Connected with Amit Bansal and subscribe to the exclusive list of his session attendees (conference and pre-cons), class participants & video viewers. You will get just one email in two weeks with good links to continue your learning. http://bit.ly/connectwithab Also, you can join ‘SQLMaestros Champs’ Telegram group and participate in SQL Server discussions. It’s a forum for SQL Server lovers - https://t.me/joinchat/AnAGwxBU1KXORoUR9jD_dw If you work on other technologies in MS Data + AI Stack, join this group: http://www.dataplatformgeeks.com/dpg-mobile/ Video resources including presentation, demo files, code snippets and more learning material is available on http://www.dataplatformgeeks.com/ (Join for free and access all the resources) Connect With The Speaker (Amit Bansal) -Follow on Twitter: https://twitter.com/A_Bansal -Follow on FaceBook at http://www.facebook.com/amit.r.bansal -Follow on LinkedIN: http://www.linkedin.com/in/amitbansal2010 -Facebook Page: https://www.facebook.com/AmitRSBansal/ Connect with SQLMaestros: http://sqlmaestros.com/ - http://www.twitter.com/SQLMaestros - https://www.facebook.com/SQLMaestros - Email us: [email protected] Data Platform Summit Asia's largest learning event on AI, Data & Advanced Analytics. https://www.dps10.com/ SQLMaestros Video Courses Amit Bansal’s popular SQL Performance Tuning course is now going live in video format. http://sqlmaestros.com/sql-server-videos-courses/ SQLMaestros Hands-On-Labs Want to practice SQL, Azure & BI concepts, step-by-step with exercises, screenshots, instructions & explanations? Get access to 100+ labs covering the entire Microsoft Data Platform stack. Try SQLMaestros Hands-On-Labs – the new way of practical, self-paced learning. Anytime. Anywhere. http://hols.SQLMaestros.com Email [email protected] SQLMaestros Learning Kits The kit comprises of PowerPoint presentations, lab manuals, workbook & instructor demos & notes. The kit is based on Amit Bansal’s Performance Tuning Master Class. https://sqlmaestros.com/sql-server-courseware/ SQL Server Health Check If your SQL Server deployments are not performing good or if you have seen early signs of performance degradation, SQLMaestros can help you with a thorough health check. https://sqlmaestros.com/sql-server-health-check/ Have technical questions? Join the largest SQL group on FB www.facebook.com/groups/theSQLGeeks Our LinkedIn group https://www.linkedin.com/groups/6753546 Our Telegram group on mobile http://www.dataplatformgeeks.com/dpg-mobile/ DataPlatformGeeks (DPG) Community Join the fastest growing community of data & analytics professionals Why Join DPG? http://www.dataplatformgeeks.com/ -Attend all events hosted by DPG, including SQLMaestros Special Events -Get access to free videos, labs, magazines and host of learning resources -Download all events & conference material -Learn new skills. Sharpen existing skills -Be part of Asia’s Largest Data/Analytics Community -Opportunity to be a regional mentor & speaker at our events -Immense technical & professional development If you wish to speak at DataPlatformGeeks events, fill out this form: http://www.dataplatformgeeks.com/call-speakers-dpg-events/ If you wish to become a Regional Mentor with DataPlatformGeeks, fill out this form: http://www.dataplatformgeeks.com/become-regional-mentor/ Watch all recorded DPG webinars here: www.youtube.com/SQLServerGeeks
Views: 862 SQLMaestros
Range Partitioning in Oracle
 
15:00
In this video I have explained what is range partitioning along with it's 2 real project use cases. I have also explained interval Partitioning as an extension of Range partitioning If you have not watched my Initial Videos on partitioning I will recommended watching them before watching this video Apologies for the 10 second video glitch between 6 and 7 minutes :(
Views: 6943 Tech Coach
Partitioning in Oracle - Performance Basics
 
28:35
This is the 2nd video from " Partitioning in Oracle " series, It explains how oracle stores and manages data. What is single Block IO and Multi Block IO ? Why full table scan is better than index access in few cases. The video is very elaborate, I have tried my level best to keep it as simple as possible
Views: 14442 Tech Coach
B-Tree Indexes
 
04:33
In this video, I'd like to take a look at B-tree indexes and show how knowing them can help design better database tables and queries.
Reference partitioning in Oracle 11g
 
09:50
The video explains Reference partitioning and its advantages in Oracle with real project example. It builds on the limitations of reference partitioning in oracle 11g (Interval partitioning) and scenarios where you should implement reference partitioning
Views: 2824 Tech Coach
sub partitioning in oracle  or composite partitioning in Oracle RANGE-LIST, RANGE-HASH
 
07:24
sub partitioning in oracle or composite partitioning in Oracle SQL Tutorial SQL Tutorial for beginners PLSQL Tutorial PLSQL Tutorial for beginners PL/SQL Tutorial PL SQL Tutorial PL SQL Tutorial for beginners PL/SQL Tutorial for beginners Oracle SQL Tutorial
Views: 1024 TechLake
Nested Loop Join on SQL
 
05:03
Nested Loop Join on SQl
Views: 389 TUTOR SC
What is RANGE-LIST SUBPARTITIONS in Oracle via OEM ?
 
14:04
Hi friends today in my videos I'm going to explain with you What is RANGE-LIST SUB-PARTITIONS in Oracle via OEM Oracle database Unbeatable,Unbreakable Platform.. # RANGE-LISTSUBPARTITIONS #OEM
Views: 1481 Oracle World
Which Order Should Columns Go in an Index?: Finding All the Red Sweets Part 4
 
06:19
When you create an index on multiple columns there's an important question you need to answer: In which order should you list the columns? This video looks at some of the factors you should consider to help answer this question. ============================ The Magic of SQL with Chris Saxon Copyright © 2015 Oracle and/or its affiliates. Oracle is a registered trademark of Oracle and/or its affiliates. All rights reserved. Other names may be registered trademarks of their respective owners. Oracle disclaims any warranties or representations as to the accuracy or completeness of this recording, demonstration, and/or written materials (the “Materials”). The Materials are provided “as is” without any warranty of any kind, either express or implied, including without limitation warranties or merchantability, fitness for a particular purpose, and non-infringement.
Views: 4815 The Magic of SQL
Partitioning Enhancements in oracle 12c
 
08:33
Oracle has made 4 significant enhancements in 12c. 1.Mixing Interval and Reference partitioning 2.DDL operations on multiple partitions 3.Global Index maintenance 4.Cascade Operations from parent to child, Truncate and drop This video explains the enhancements in detail with practical examples
Views: 2569 Tech Coach
When to use Oracle Database Bitmap Indexes Lesson 1
 
00:49
This tutorial will identify some use cases for Oracle bitmap indexes, including some of the more advanced capabilities. See all lessons, free, at http://www.skillbuilders.com/when-to-use-oracle-bitmap-indexes. Indexing your Oracle Database for best performance? There are cases, depending on data structures and queries, where b-tree indexes are not useful (e.g. scan access paths perform inadequately). In these cases, bitmap indexes may be a better solution. Bitmap indexes are a powerful tool, but they need to be used with care. Inappropriate use may cause problems worse than those they solve. The tutorial covers somewhat more advanced cases such as using bitmap join indexes to denormalize a snowflake schema, and to enable star transformations in queries that join fact tables to several dimension tables. This training will benefit any Oracle DBA administering a Data Warehouse or VLDB and "power" developers working in same. Instructor: Oracle Certified Master DBA John Watson, SkillBuilders
Views: 744 SkillBuilders
SQL Server Scans Vs Seeks
 
02:24
Why syntax is so important to queries
Views: 706 Tips For IT Pros
Scanning Full Scan method
 
02:34
Views: 50 Ann Mc
Oracle Hints - FIRST_ROWS - Example
 
02:17
Excerpt from "Oracle sql tuning-advanced" video tutorial training. www.dbvidya.com/course/sql-tuning-advanced/ [email protected] +91 991 2323 000 Oracle Performance Tuning Online Training : http://www.dbvidya.com/course/performance-tuning-for-dba/ Oracle SQL Performance Tuning Training Online : http://www.dbvidya.com/course/sql-tuning-advanced/ Oracle Performance Tuning Videos Tutorial for DBA and Developers : http://www.dbvidya.com/oracle-performance-tuning-videos/ Oracle AWR Tutorial: http://www.dbvidya.com/course/oracle-awr/ Erwin Tool Online Training : http://www.dbvidya.com/course/erwin-tool/ ER Data Modeling Course : http://www.dbvidya.com/course/er-modeling/ Dimensional Modeling Training Online : http://www.dbvidya.com/course/dimensional-modeling/ Oracle Database Blogs : http://www.dbvidya.com/blog/
Views: 409 DbVidya
DOAG@Talk: Oracle Partitioning: Hilfreiche Funktionen für DBAs und Entwickler
 
07:25
Oracle Partitioning ist wohl eine der am meisten benutzten Optionen der Datenbank. Wie und von welchen Funktionen können Datenbankadministratoren und Entwickler besonders profitieren? Hermann Baer, Director Product Management Data Warehousing bei Oracle, steht im Interview mit Matthias Mann, stellvertretender DOAG-Themenverantwortlicher Datenbankadministration, Rede und Antwort und stellt dabei einige der Funktionen vor.
Views: 99 doagtv
#Kscope16 Interview: Chris Saxon, Oracle Corporation
 
04:16
http://kscope16.com http://kscope17.com To view Chris 's presentations go to http://odtug.com Finding All the Red M&Ms: A Story of Indexes and Full Table Scans Topic: Database - Subtopic: SQL “Why isn’t my query using an index?” is a common question people have when tuning SQL. This talk explores the factors that influence the optimizer’s decision behind this question. It does so by comparing fetching rows from a database table to finding all the red M&Ms from their bags. It contrasts using an index range scan and a full table scan to do this. It introduces the concepts of blocks and the clustering factor. It discusses how these affect the optimizer's calculations. It goes on to demonstrate how these concepts work in practice using real SQL queries. This session is intended for developers and DBAs who want to learn the basics of how the optimizer chooses between an index range or full table scan. SQL for Date Ranges and History Using Temporal Validity and Flashback Data Archive Topic: Database - Subtopic: SQL Keeping a full history of changes to a table is a common business requirement. Auditors and analysts often need to view data as it existed at some point in the past. This is to ensure regulation compliance or understand how the business is performing. This session discusses the challenges with writing the SQL to implement these requirements. It then introduces temporal validity and flashback data archive. It shows how you can use these features to simplify working with date ranges and history tables. This talk is for developers and/or DBAs who write SQL or build applications that use date ranges and/or capture past data.
Views: 23 ODTUG
Index Seek and Index Scan in SQL Server
 
08:13
This video is about to describe Index Seek and Index Scan in SQL Server.
Views: 2540 mehtab alam
01 Overview of table Partition in oracle
 
07:26
Partitioning enhances the performance, manageability, and availability of a wide variety of applications and helps reduce the total cost of ownership for storing large amounts of data. Partitioning allows tables, indexes, and index-organized tables to be subdivided into smaller pieces, enabling these database objects to be managed and accessed at a finer level of granularity. Oracle provides a rich variety of partitioning strategies and extensions to address every business requirement. Moreover, since it is entirely transparent, partitioning can be applied to almost any application without the need for potentially expensive and time consuming application changes. Partitioning allows a table, index, or index-organized table to be subdivided into smaller pieces, where each piece of such a database object is called a partition. Each partition has its own name, and may optionally have its own storage characteristics. From the perspective of a database administrator, a partitioned object has multiple pieces that can be managed either collectively or individually. This gives the administrator considerable flexibility in managing partitioned objects. However, from the perspective of the application, a partitioned table is identical to a non-partitioned table; no modifications are necessary when accessing a partitioned table using SQL queries and DML statements. Partitioning Key ======================== Each row in a partitioned table is unambiguously assigned to a single partition. The partitioning key is comprised of one or more columns that determine the partition where each row will be stored. Oracle automatically directs insert, update, and delete operations to the appropriate partition through the use of the partitioning key. When to Partition a Table ========================== Here are some suggestions for when to partition a table: Tables greater than 2 GB should always be considered as candidates for partitioning. Tables containing historical data, in which new data is added into the newest partition. A typical example is a historical table where only the current month's data is updatable and the other 11 months are read only. When the contents of a table need to be distributed across different types of storage devices. When to Partition an Index ============================= Here are some suggestions for when to consider partitioning an index: Avoid rebuilding the entire index when data is removed. Perform maintenance on parts of the data without invalidating the entire index. Reduce the impact of index skew caused by an index on a column with a monotonically increasing value. Partitioned Index-Organized Tables =================================== Partitioned index-organized tables are very useful for providing improved performance, manageability, and availability for index-organized tables. For partitioning an index-organized table: ============================================ Partition columns must be a subset of the primary key columns Secondary indexes can be partitioned (both locally and globally) OVERFLOW data segments are always equi-partitioned with the table partitions See Also: Oracle Database Concepts for more information about index-organized tables System Partitioning System partitioning enables application-controlled partitioning without having the database controlling the data placement. The database simply provides the ability to break down a table into partitions without knowing what the individual partitions are going to be used for. All aspects of partitioning have to be controlled by the application. For example, an insertion into a system partitioned table without the explicit specification of a partition will fail. System partitioning provides the well-known benefits of partitioning (scalability, availability, and manageability), but the partitioning and actual data placement are controlled by the application. See Also: Oracle Database Data Cartridge Developer's Guide for more information about system partitioning Partitioning for Information Lifecycle Management Information Lifecycle Management (ILM) is concerned with managing data during its lifetime. Partitioning plays a key role in ILM because it enables groups of data (that is, partitions) to be distributed across different types of storage devices and managed individually.
Views: 7654 Md Arshad
Nested Loop Join in SQL Server (by Satya Ramesh)
 
19:39
In this video, you will learn about basics around Nested Loop join and how Nested Loop Join algorithm works. You will also learn about different scenarios where SQL Server decides to use Nested Loop Join operator and how it affects performance. Video resources including presentation, demo files, code snippets and more learning material is available on http://www.dataplatformgeeks.com/ (Join for free and access all the resources) Connect with The Speaker (Satya Ramesh) -Follow on Twitter: https://twitter.com/satyaramesh230 -Follow on FaceBook at https://www.facebook.com/satyaramesh230 -Follow on LinkedIN: https://www.linkedin.com/in/ramesh-sa... Connect with SQLMaestros: http://sqlmaestros.com/ -http://www.twitter.com/SQLMaestros -https://www.facebook.com/SQLMaestros -Email us: [email protected] Have technical questions? Join the largest SQL group on FB www.facebook.com/groups/theSQLGeeks Our LinkedIn group https://www.linkedin.com/groups/6753546 DataPlatformGeeks (DPG) Community Join the fastest growing community of data & analytics professionals Why Join DPG? http://www.dataplatformgeeks.com/ -Attend all events hosted by DPG, including SQLMaestros Special Events -Get access to free videos, labs, magazines and host of learning resources -Download all events & conference material -Learn new skills. Sharpen existing skills -Be part of Asia’s Largest Data/Analytics Community -Opportunity to be a regional mentor & speaker at our events -Immense technical & professional development Do you know about Data Platform Summit? http://www.DPS10.com
Views: 2548 SQLMaestros
SQL tutorial 62: Indexes In Oracle Database By Manish Sharma RebellionRider
 
04:03
Watch and learn concepts of SQL Index In Oracle Database. In this tutorial you will learn about B-Tree Index and Function based Index. ------------------------------------------------------------------------ ►►►LINKS◄◄◄ Blog : Previous Tutorial ► ------------------------------------------------------------------------- ►►►Help Me In Getting A Job◄◄◄ ►Help Me In Getting A Good Job By Connecting With Me on My LinkedIn and Endorsing My Skills. All My Contact Info is Down Below. You Can Also Refer Me To Your Company Thanks ------------------------------------------------------------------------- Copy Cloud referral link || Use this link to join copy cloud and get 20GB of free storage https://copy.com?r=kb4rc1 -------------------------------------------------------------------------- ►Make sure you SUBSCRIBE and be the 1st one to see my videos! -------------------------------------------------------------------------- Amazon Wishlist: http://bit.ly/wishlist-amazon ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ►►►Find me on Social Media◄◄◄ Follow What I am up to as it happens on https://twitter.com/rebellionrider https://www.facebook.com/imthebhardwaj http://instagram.com/rebellionrider https://plus.google.com/+Rebellionrider http://in.linkedin.com/in/mannbhardwaj/ http://rebellionrider.tumblr.com/ http://www.pinterest.com/rebellionrider/ You can also Email me at for E-mail address please check About section Please please LIKE and SHARE my videos it makes me happy. Thanks for liking, commenting, sharing and watching more of our videos This is Manish from RebellionRider.com ♥ I LOVE ALL MY VIEWERS AND SUBSCRIBERS
Views: 44332 Manish Sharma
Sort Merge Join on SQL
 
03:36
Sort Merge Join on SQL
Views: 342 TUTOR SC
Query Tuning 101: Access vs. Filter Predicates In Execution Plans
 
02:08
Have you ever wondered what the difference is between the "filter predicates" or "access predicates" steps listed in execution plans - or even what a predicate is? If so, watch this video to find out! Copyright © 2015 Oracle and/or its affiliates. Oracle is a registered trademark of Oracle and/or its affiliates. All rights reserved. Other names may be registered trademarks of their respective owners. Oracle disclaims any warranties or representations as to the accuracy or completeness of this recording, demonstration, and/or written materials (the “Materials”). The Materials are provided “as is” without any warranty of any kind, either express or implied, including without limitation warranties or merchantability, fitness for a particular purpose, and non-infringement.
Views: 5503 The Magic of SQL
Chris Saxon - More SQL Magic!
 
44:26
In this session Chris will use the power of Oracle SQL to do some amazing feats with the database. But unlike real magicians, he’ll show you how the tricks are done so you can do your own SQL magic!
Views: 331 Riga Dev Days
What is BITMAP INDEX? What does BITMAP INDEX mean? BITMAP INDEX meaning & explanation
 
04:35
What is BITMAP INDEX? What does BITMAP INDEX mean? BITMAP INDEX meaning - BITMAP INDEX definition - BITMAP INDEX explanation. Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license. SUBSCRIBE to our Google Earth flights channel - https://www.youtube.com/channel/UC6UuCPh7GrXznZi0Hz2YQnQ A bitmap index is a special kind of database index that uses bitmaps. Bitmap indexes have traditionally been considered to work well for low-cardinality columns, which have a modest number of distinct values, either absolutely, or relative to the number of records that contain the data. The extreme case of low cardinality is Boolean data (e.g., does a resident in a city have internet access?), which has two values, True and False. Bitmap indexes use bit arrays (commonly called bitmaps) and answer queries by performing bitwise logical operations on these bitmaps. Bitmap indexes have a significant space and performance advantage over other structures for query of such data. Their drawback is they are less efficient than the traditional B-tree indexes for columns whose data is frequently updated: consequently, they are more often employed in read-only systems that are specialized for fast query - e.g., data warehouses, and generally unsuitable for online transaction processing applications. Some researchers argue that bitmap indexes are also useful for moderate or even high-cardinality data (e.g., unique-valued data) which is accessed in a read-only manner, and queries access multiple bitmap-indexed columns using the AND, OR or XOR operators extensively. Bitmap indexes are also useful in data warehousing applications for joining a large fact table to smaller dimension tables such as those arranged in a star schema. Bitmap based representation can also be used for representing a data structure which is labeled and directed attributed multigraph, used for queries in graph databases.Efficient graph management based on bitmap indices article shows how bitmap index representation can be used to manage large dataset(billions of data points) and answer queries related to graph efficiently. Basic bitmap indexes use one bitmap for each distinct value. It is possible to reduce the number of bitmaps used by using a different encoding method. For example, it is possible to encode C distinct values using log(C) bitmaps with binary encoding. This reduces the number of bitmaps, further saving space, but to answer any query, most of the bitmaps have to be accessed. This makes it potentially not as effective as scanning a vertical projection of the base data, also known as a materialized view or projection index. Finding the optimal encoding method that balances (arbitrary) query performance, index size and index maintenance remains a challenge. Without considering compression, Chan and Ioannidis analyzed a class of multi-component encoding methods and came to the conclusion that two-component encoding sits at the kink of the performance vs. index size curve and therefore represents the best trade-off between index size and query performance. For high-cardinality columns, it is useful to bin the values, where each bin covers multiple values and build the bitmaps to represent the values in each bin. This approach reduces the number of bitmaps used regardless of encoding method. However, binned indexes can only answer some queries without examining the base data. For example, if a bin covers the range from 0.1 to 0.2, then when the user asks for all values less than 0.15, all rows that fall in the bin are possible hits and have to be checked to verify whether they are actually less than 0.15. The process of checking the base data is known as the candidate check. In most cases, the time used by the candidate check is significantly longer than the time needed to work with the bitmap index. Therefore, binned indexes exhibit irregular performance. They can be very fast for some queries, but much slower if the query does not exactly match a bin.
Views: 3720 The Audiopedia
Stanislawski Extinction Release Aid: ATA 2019
 
03:25
Stanislawski shows off its new wrist-strap release aid – the Extinction. This is the first wrist-strap design we’ve ever seen from Stan.
Views: 5839 ArcheryTalk
When Should I Use An Index Hint?
 
03:06
Index hints are useful tools that are easily abused. In today's video, learn when it's appropriate to use an index hint and when they should be avoided. Blog post with demo code: https://bertwagner.com/2018/07/31/should-you-use-index-hints/ Music by Joakim Karud http://youtube.com/joakimkarud Follow me on Twitter: https://twitter.com/bertwagner
Views: 428 Bert Wagner
Compress and Decompress in SQL Server | SQL data compress | data decompress in sql
 
14:00
This video talks about Compress and Decompress in SQL Server SQL data compress sql tutorials learn sql 2016 data decompress in sql sql compress sql decompress sql interview questions sql 2016 new functions sql decompress examples sql compress examples data compress examples in sql data decompress examples in sql data compression in sql sql server data compression Data Compression in SQL Pros and Cons how to compress data in sql server For Some more interview questions and answers.. https://www.youtube.com/watch?v=vbp2yPyUf9o https://www.youtube.com/watch?v=yUoDrqSRt6A https://www.youtube.com/watch?v=QOHxfeJ8VWE https://www.youtube.com/watch?v=x5iVbr94FqE https://www.youtube.com/watch?v=92OSTvW0Ge8 https://www.youtube.com/watch?v=DBCCk8Yn7SM https://www.youtube.com/watch?v=NmqTJSHN8Ic https://www.youtube.com/watch?v=D8uiujYQTxw https://www.youtube.com/watch?v=upZsqwxZX2M https://www.youtube.com/watch?v=4EvEeN0pUBo https://www.youtube.com/watch?v=vwdeItscq7o https://www.youtube.com/watch?v=ZTSw89A1ZUg https://www.youtube.com/watch?v=sqX62jK0Vc8 https://www.youtube.com/watch?v=DLn01pA1qcA
Views: 254 Training2SQL MSBI
File Operations - 03 Storage of Indexes and Partitions
 
22:07
Connect with me or follow me at https://www.linkedin.com/in/durga0gadiraju https://www.facebook.com/itversity https://github.com/dgadiraju https://www.youtube.com/c/TechnologyMentor https://twitter.com/itversity
Views: 1299 itversity
DynamoDB Series - Do NOT design it as a Relational database
 
09:31
This video is about showing you examples how you can avoid falling in the trap doing relational DB design in your DynamoDB.