asterix-app/src/test/resources/optimizerts/queries/multi-indexes/two-2nd-btree-intersect.aql

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
/*
 * Description    : Tests two secondary Btree indexes should trigger intersection rule
 * Success        : Yes
 */

drop dataverse test if exists;
create dataverse test;
use dataverse test;

create type tTweet as closed {
  id: int32,
  location: point,
  message: string,
  create_at: datetime,
  misc: string
}

create dataset dsTweet(tTweet) primary key id;

create index time_index on dsTweet(create_at) type btree;
create index misc_index on dsTweet(misc) type btree;

write output to nc1:"rttest/two-2nd-btree-intersect.adm";

let $ts_start := datetime("2015-11-11T00:00:00Z")
let $ts_end := datetime("2015-12-18T23:59:59Z")
let $keyword := "hello"
for $t in dataset dsTweet
where $t.create_at >= $ts_start and $t.create_at < $ts_end
  and $t.misc > $keyword
return $t