В c/c++ - менее 0.1 сек. Необходимо реализовать структуру таким образом, чтобы все запросы выполнялсь со скоростью с.
При этому line иногда плавает.
поэтому проще будет найти файлы и все попереносить.
var_dump(unpack('J', "\xCC\xD0\x44\xA1\x2F\xDB\x3E\x13")[1]);
All MySQL collations are of type PAD SPACE. This means that all CHAR, VARCHAR, and TEXT values are compared without regard to any trailing spaces. “Comparison” in this context does not include the LIKE pattern-matching operator, for which trailing spaces are significant.
create index on tablename using btree(((features ->> 'capacity'::text)::integer));
Т.е. индекс используется, хотя в данном случае index срабатывает на price столбце? Тогда почему запрос отрабатывает быстро?
select day, data
from generate_series('2017-12-10', '2017-12-12', interval '1 day') as day,
lateral (
select data from tablename
where "timestamp" between day and day + interval '1 day'
order by "timestamp" desc limit 1
) ljd;
with recursive t as (
(select "timestamp"::date as day, data from tablename order by "timestamp" desc limit 1)
union all
select bpt.* from t, lateral (
select "timestamp"::date as day, data from tablename where "timestamp" < t.day order by "timestamp" desc limit 1
) as bpt
)
select * from t;
date_label >= '1994-01-01' and date_label < '1995-01-01'
ModelName::find()->where(['between', 'date_label', '1994-01-01', '1995-01-01' ]);
php7.1-mysql_7.1.12-2+ubuntu17.10.1+deb.sury.org+2_amd64.deb
php7.1-mysql_7.1.12-1+ubuntu17.10.1+deb.sury.org+1_amd64.deb
disabled и date_added - в таблице announcements
SELECT `announcements`.* FROM `announcements`
WHERE `disabled` = 0
ORDER BY `date_added` DESC
LIMIT 15
with
data (new_user_id, new_name) as (values(%(user_id)s, %(name)s)),
wr as (
INSERT INTO users(user_id, name)
select new_user_id, new_name from data
ON CONFLICT (user_id) DO NOTHING returning user_id
), upd as (
update users set name = new_name from data where users.user_id = data.new_user_id and data.new_user_id not in (
select user_id from wr
)
)
select count(*) from wr;