| http://dbpedia.org/ontology/abstract
|
検索引数可能 (英: sargable)とは、関係データベースにおいて、DBMSエンジンがインデックスを利用してクエリの実行を高速化できる述語や条件のこと。日本語の文脈でもSARGableのように記載されることがある。この用語は、 Search ARGumentABLEの短縮形に由来する。検索引数可能でないクエリは、non-sargableクエリと呼ばれ、インデックスが効かない。
, In relational databases, a condition (or p … In relational databases, a condition (or predicate) in a query is said to be sargable if the DBMS engine can take advantage of an index to speed up the execution of the query. The term is derived from a contraction of Search ARGument ABLE. It was first used by IBM researchers as a contraction of Search ARGument, and has come to mean simply "can be looked up by an index." A query failing to be sargable is known as a non-sargable query and typically has a negative effect on query time, so one of the steps in query optimization is to convert them to be sargable. The effect is similar to searching for a specific term in a book that has no index, beginning at page one each time, instead of jumping to a list of specific pages identified in an index. The typical situation that will make a SQL query non-sargable is to include in the WHERE clause a function operating on a column value. The WHERE clause is not the only clause where sargability can matter; it can also have an effect on ORDER BY, GROUP BY and HAVING clauses. The SELECT clause, on the other hand, can contain non-sargable expressions without adversely affecting the performance. Some database management systems, for instance PostgreSQL, support functional indices. Conceptually, an index is simply a mapping between a value and one or more locations. With a functional index, the value stored in the index is the output of the function specified when the index is created. This capability expands what is sargable beyond base column expressions.
* Sargable operators: <span class="o">=</span><span class="p">,</span> <span class="o">></span><span class="p">,</span> <span class="o"><</span><span class="p">,</span> <span class="o">>=</span><span class="p">,</span> <span class="o"><=</span><span class="p">,</span> <span class="k">BETWEEN</span><span class="p">,</span> <span class="k">LIKE</span><span class="p">,</span> <span class="k">IS</span> <span class="p">[</span><span class="k">NOT</span><span class="p">]</span> <span class="k">NULL</span>
* Sargable operators that rarely improve performance: <span class="o"><></span><span class="p">,</span> <span class="k">IN</span><span class="p">,</span> <span class="k">OR</span><span class="p">,</span> <span class="k">NOT</span> <span class="k">IN</span><span class="p">,</span> <span class="k">NOT</span> <span class="k">LIKE</span>t; <span class="k">LIKE</span>
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://dba.stackexchange.com/questions/162263/what-does-the-word-sargable-really-mean +
, http://www.informit.com/articles/article.aspx%3Fp=30247 +
, https://www.sqlshack.com/how-to-use-sargable-expressions-in-t-sql-queries-performance-advantages-and-examples/ +
, https://www.postgresql.org/docs/current/indexes-expressional.html +
|
| http://dbpedia.org/ontology/wikiPageID
|
5949018
|
| http://dbpedia.org/ontology/wikiPageLength
|
4883
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1112654352
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/DBMS +
, http://dbpedia.org/resource/Category:Relational_model +
, http://dbpedia.org/resource/Query_optimization +
, http://dbpedia.org/resource/Block_Range_Index +
, http://dbpedia.org/resource/Relational_databases +
, http://dbpedia.org/resource/Category:Database_management_systems +
, http://dbpedia.org/resource/SQL_query +
, http://dbpedia.org/resource/Index_%28database%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Multiple_issues +
, http://dbpedia.org/resource/Template:Onesource +
, http://dbpedia.org/resource/Template:Code +
, http://dbpedia.org/resource/Template:Ref +
, http://dbpedia.org/resource/Template:Note +
, http://dbpedia.org/resource/Template:ISBN +
, http://dbpedia.org/resource/Template:Cleanup +
, http://dbpedia.org/resource/Template:Original_research +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Relational_model +
, http://dbpedia.org/resource/Category:Database_management_systems +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Sargable?oldid=1112654352&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Sargable +
|
| owl:sameAs |
https://global.dbpedia.org/id/FUGix +
, http://rdf.freebase.com/ns/m.0fg4my +
, http://ja.dbpedia.org/resource/%E6%A4%9C%E7%B4%A2%E5%BC%95%E6%95%B0%E5%8F%AF%E8%83%BD +
, http://yago-knowledge.org/resource/Sargable +
, http://www.wikidata.org/entity/Q104840822 +
, http://dbpedia.org/resource/Sargable +
|
| rdf:type |
http://dbpedia.org/class/yago/WrittenCommunication106349220 +
, http://dbpedia.org/class/yago/Software106566077 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Code106355894 +
, http://dbpedia.org/class/yago/DatabaseManagementSystem106588785 +
, http://dbpedia.org/class/yago/Writing106359877 +
, http://dbpedia.org/class/yago/Communication100033020 +
, http://dbpedia.org/class/yago/WikicatDatabaseManagementSystems +
, http://dbpedia.org/class/yago/CodingSystem106353757 +
|
| rdfs:comment |
In relational databases, a condition (or p … In relational databases, a condition (or predicate) in a query is said to be sargable if the DBMS engine can take advantage of an index to speed up the execution of the query. The term is derived from a contraction of Search ARGument ABLE. It was first used by IBM researchers as a contraction of Search ARGument, and has come to mean simply "can be looked up by an index."ean simply "can be looked up by an index."
, 検索引数可能 (英: sargable)とは、関係データベースにおいて、DBMSエンジンがインデックスを利用してクエリの実行を高速化できる述語や条件のこと。日本語の文脈でもSARGableのように記載されることがある。この用語は、 Search ARGumentABLEの短縮形に由来する。検索引数可能でないクエリは、non-sargableクエリと呼ばれ、インデックスが効かない。
|
| rdfs:label |
Sargable
, 検索引数可能
|
