Property:Query depth

"Query depth" is a predefined property that informs about the depth of a query and is provided by Semantic MediaWiki. It is a numerical value computed on the basis of subquery nesting, property chains, and available description elements with the execution of a query being restricted by the $smwgQMaxDepth configuration parameter. This property is pre-deployed (also known as special property) and comes with additional administrative privileges but can be used just like any other user-defined property.

Usage21808

previous 20 20 50 100 250 500 next 20

Filter<p>The <a target="_blank" rel="nofollow noreferrer noopener" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Property_page/Filter">search filter</a> allows the inclusion of <a target="_blank" rel="nofollow noreferrer noopener" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Query_expressions">query expressions</a> such as <code>~</code> or <code>!</code>. The selected <a target="_blank" rel="nofollow noreferrer noopener" class="external text" href="https://www.semantic-mediawiki.org/wiki/Query_engine">query engine</a> might also support case insensitive matching or other short expressions like:</p><ul><li><code>in:</code> result should include the term, e.g. '<code>in:Foo</code>'</li></ul><ul><li><code>not:</code> result should to not include the term, e.g. '<code>not:Bar</code>'</li></ul>

Showing 20 pages using this property.

H

Histoire pitoyable du prince Erastus, fils de Diocletian empereur de Rome. Paris: Pierre Anguerrand, 1639 +

1 +

Histoire pitoyable du prince Erastus, fils de Diocletian empereur de Rome. Paris: Pierre Anguerrand, 1639 +

1 +

Histoire pitoyable du prince Erastus, fils de Diocletien Empereur de Romme. [...] Lyon, Benoist Rigaud, 1585 +

1 +

Histoire pitoyable du prince Erastus, fils de Diocletien Empereur de Romme. [...] Lyon, Benoist Rigaud, 1585 +

1 +

Histoire pitoyable du prince Erastus, fils de Diocletien Empereur de Romme. [...] Lyon, Benoist Rigaud, 1585 +

1 +