Semantic search
Debug output SQLStore
ASK Query
[[Category:CSIReports]]
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, t4.o_hash
FROM
`smw_object_ids` AS t0
INNER JOIN
`smw_fpt_inst` AS t1 ON t0.smw_id=t1.s_id
INNER JOIN
`smw_di_blob` AS t4 ON t0.smw_id=t4.s_id
WHERE
(t1.o_id=1816)
AND (t4.p_id=1948)
AND t0.smw_iw!=':smw'
AND t0.smw_iw!=':smw-delete'
AND t0.smw_iw!=':smw-redi'
ORDER BY
t4.o_hash DESC
LIMIT
25
OFFSET
40
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, t4.o_hash
FROM
`smw_object_ids` AS t0
INNER JOIN
`smw_fpt_inst` AS t1 ON t0.smw_id=t1.s_id
INNER JOIN
`smw_di_blob` AS t4 ON t0.smw_id=t4.s_id
WHERE
(t1.o_id=1816)
AND (t4.p_id=1948)
AND t0.smw_iw!=':smw'
AND t0.smw_iw!=':smw-delete'
AND t0.smw_iw!=':smw-redi'
ORDER BY
t4.o_hash DESC
LIMIT
25
OFFSET
40
SQL Explain
ID | select_type | table | type | possible_keys | key | key_len | ref | rows | filtered | Extra |
---|---|---|---|---|---|---|---|---|---|---|
1 | SIMPLE | t1 | ref | s_id, o_id, s_id_2, o_id_2 | o_id_2 | 5 | const | 256 | Using index; Using temporary; Using filesort | |
1 | SIMPLE | t0 | eq_ref | PRIMARY, smw_id, smw_iw, smw_iw_2 | PRIMARY | 4 | www_public.t1.s_id | 1 | Using where | |
1 | SIMPLE | t4 | ref | s_id, s_id_2, p_id | s_id | 8 | www_public.t1.s_id, const | 1 |
Auxilliary Tables
No auxilliary tables used.Query Metrics
Query-Size:1Query-Depth:0
Errors and Warnings
NoneTitle | Authors | Year | |
---|---|---|---|
tourneur.18.seminar | Implementation of Invisible and Transparent Transitions in Spot | Vincent Tourneur | 2018 |
gillard.18.seminar | Two-automaton accepting run search in Spot | Clément Gillard | 2018 |
valais.18.seminar | SUBTYPEP: An Implementation of Baker's Algorithm | Leo Valais | 2018 |
remaud.18.seminar | Creation of an antichain library | Arthur Remaud | 2018 |
khoudli.18.seminar | Automatic Heart Segmentation | Younes Khoudli | 2018 |
gbaguidiaisse.18.seminar | Deciding Persistence or Recurrence Membership in Spot | Alexandre Gbaguidi Aïsse | 2018 |
hirtz.18.seminar | Optimization of an image processing library | Virgile Hirtz | 2018 |
xu.18.seminar | Efficient Translation of Fairness LTL Formulae into Deterministic Automata | Laurent XU | 2018 |
kirszenberg.18.seminar | go2pins: A model checking toolset for the Go programming language | Alexandre Kirszenberg | 2018 |
dangla.18.seminar | Integration of histograms in the NL-Mean algorithm for image denoising. | Aliona Dangla | 2018 |
houang.17.seminar | Binary Partition Tree for Image Processing | Fabien Houang | 2017 |
michaud.17.seminar | LTL Synthesis with Spot | Thibaud Michaud | 2017 |
tourneur.17.seminar | Partial order reduction in SPOT | Vincent Tourneur | 2017 |
xu.17.seminar | Improvements of Simulation-based Reduction | Laurent Xu | 2017 |
piat.17.seminar | K shortest-paths in Vcsn | Sébastien Piat | 2017 |
remaud.17.seminar | Integration of TChecker in Spot | Arthur Remaud | 2017 |
collette.17.seminar | Morse-Smale Complex computation with Watershed Cut | Victor Collette | 2017 |
iovene.17.seminar | Time Delay Neural Networks-Based Universal Background Model for Speaker Recognition | Valentin Iovene | 2017 |
dangla.17.seminar | Evaluation method of text detection algorithm rating | Aliona Dangla | 2017 |
berthet.17.seminar | Automatic detection of text zones on identity documents. | Anne-Claire Berthet | 2017 |