Recherche sémantique
SQLStore debug output
ASK Query
[[Catégorie:Ressources]] [[Statut evaluation::publiée]]
SQL Query
SELECT DISTINCT
t0.smw_id AS id,
t0.smw_title AS t,
t0.smw_namespace AS ns,
t0.smw_iw AS iw,
t0.smw_subobject AS so,
t0.smw_sortkey AS sortkey, t0.smw_sort
FROM
`smw_object_ids` AS t0
INNER JOIN
(`smw_fpt_inst` AS t2
INNER JOIN
`smw_di_blob` AS t4 ON t2.s_id=t4.s_id) ON t0.smw_id=t2.s_id
WHERE
(t2.o_id='2443'
AND (
(t4.o_hash='publiée') AND t4.p_id='2312')
)
AND t0.smw_iw!=':smw'
AND t0.smw_iw!=':smw-delete'
AND t0.smw_iw!=':smw-redi'
ORDER BY
t0.smw_sort ASC
LIMIT
25
OFFSET
70
t0.smw_id AS id,
t0.smw_title AS t,
t0.smw_namespace AS ns,
t0.smw_iw AS iw,
t0.smw_subobject AS so,
t0.smw_sortkey AS sortkey, t0.smw_sort
FROM
`smw_object_ids` AS t0
INNER JOIN
(`smw_fpt_inst` AS t2
INNER JOIN
`smw_di_blob` AS t4 ON t2.s_id=t4.s_id) ON t0.smw_id=t2.s_id
WHERE
(t2.o_id='2443'
AND (
(t4.o_hash='publiée') AND t4.p_id='2312')
)
AND t0.smw_iw!=':smw'
AND t0.smw_iw!=':smw-delete'
AND t0.smw_iw!=':smw-redi'
ORDER BY
t0.smw_sort ASC
LIMIT
25
OFFSET
70
SQL Explain
ID | select_type | table | type | possible_keys | key | key_len | ref | rows | Extra |
---|---|---|---|---|---|---|---|---|---|
1 | SIMPLE | t2 | ref | s_id,o_id,s_id_2,o_id_2 | o_id_2 | 5 | const | 715 | Using index; Using temporary; Using filesort |
1 | SIMPLE | t4 | ref | s_id,p_id,s_id_2,o_hash | s_id_2 | 262 | wiki_sciencinfolycee.t2.s_id,const | 1 | Using index condition; Using where |
1 | SIMPLE | t0 | eq_ref | PRIMARY,smw_id,smw_iw,smw_iw_2 | PRIMARY | 4 | wiki_sciencinfolycee.t2.s_id | 1 | Using where |
Auxilliary Tables
No auxilliary tables used.Query Metrics
Query-Size:3Query-Depth:1
Errors and Warnings
None- Autour des graphes et du routage
- Autour des pages « Web » dynamiques
- Avis de recherche
- BOOK : La révolution technologique (sous-titrage en français)
- Baccalauréat général série scientifique, grille de compétences et grille d’évaluation de l’épreuve de spécialité ISN
- Le "backtracking" par les exemples (en allemand)
- Banque de données Académie de Montpellier
- Bases de la programmation et algorithmique
- Binet ACM : algorithmes
- Bioloid
- Bonnes pratiques de l'ANSSI
- Breadth First Search (recherche en largeur)
- Bruits et nombres aléatoires cohérents
- Brückenbauen - algorithme de Dijkstra
- Bubble-sort with Hungarian ("Csángó") folk dance
- bzip2
- C'est quoi les DPI ? les PPP ?
- CSS3.info
- Cafés des Sciences Nancy 2010 - Sciences de demain : Internet rend-il moins bête ?
- Calcul de Pi au compte-goutte