1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664
|
module Groonga
module Sharding
class LogicalRangeFilterCommand < Command
register("logical_range_filter",
[
"logical_table",
"shard_key",
"min",
"min_border",
"max",
"max_border",
"order",
"filter",
"offset",
"limit",
"output_columns",
"use_range_index",
"post_filter",
"sort_keys",
])
def run_body(input)
output_columns = input[:output_columns] || "_key, *"
is_stream_output = stream_output?(input)
context = ExecuteContext.new(input)
begin
limit = context.limit
if limit < 0 and limit != -1
message =
"[logical_range_filter] negative limit must be -1: #{limit}"
raise InvalidArgument, message
end
n_elements = 0
is_first = true
begin
executor = Executor.new(context)
executor.execute do |result_set|
n_elements += result_set.size
if is_first
writer.open_result_set_metadata(result_set, output_columns, -1, 1)
writer.open_table_records(-1)
is_first = false
end
options = {}
options[:limit] = limit
options[:auto_flush] = true if is_stream_output
writer.write_table_records_content(result_set,
output_columns,
options)
writer.flush if is_stream_output
if limit != -1
limit -= result_set.size
break if limit <= 0
end
end
query_logger.log(:size, ":", "output(#{n_elements})")
ensure
unless is_first
writer.close_table_records
writer.close_result_set
end
end
ensure
context.close
end
end
private
def stream_output?(input)
context.command_version >= 3
end
def cache_key(input)
return nil if stream_output?(input)
key = "logical_range_filter\0"
key << "#{input[:logical_table]}\0"
key << "#{input[:shard_key]}\0"
key << "#{input[:min]}\0"
key << "#{input[:min_border]}\0"
key << "#{input[:max]}\0"
key << "#{input[:max_border]}\0"
key << "#{input[:order]}\0"
key << "#{input[:filter]}\0"
key << "#{input[:offset]}\0"
key << "#{input[:limit]}\0"
key << "#{input[:output_columns]}\0"
key << "#{input[:use_range_index]}\0"
key << "#{input[:post_filter]}\0"
key << "#{input[:sort_keys]}\0"
key << "#{context.command_version}\0"
key << "#{context.output_type}\0"
dynamic_columns = DynamicColumns.parse("[logical_range_filter]",
input)
key << dynamic_columns.cache_key
key
end
class ExecuteContext < StreamExecuteContext
include KeysParsable
attr_reader :use_range_index
attr_reader :offset
attr_reader :limit
attr_reader :sort_keys
attr_accessor :current_offset
attr_accessor :current_limit
attr_reader :threshold
attr_reader :large_shard_threshold
attr_reader :result_sets
def initialize(input)
super("logical_range_filter", input)
@use_range_index = parse_use_range_index(@input[:use_range_index])
@offset = (@input[:offset] || 0).to_i
@limit = (@input[:limit] || 10).to_i
@sort_keys = parse_keys(@input[:sort_keys])
@current_offset = @offset
@current_limit = @limit
@result_sets = []
@threshold = compute_threshold
@large_shard_threshold = compute_large_shard_threshold
end
def close
super
@result_sets.clear
end
def consume_result_sets
while (result_set = @result_sets.shift)
yield(result_set)
end
end
private
def parse_use_range_index(use_range_index)
case use_range_index
when "yes"
true
when "no"
false
else
nil
end
end
def compute_threshold
threshold_env = ENV["GRN_LOGICAL_RANGE_FILTER_THRESHOLD"]
default_threshold = 0.3
(threshold_env || default_threshold).to_f
end
def compute_large_shard_threshold
threshold_env = ENV["GRN_LOGICAL_RANGE_FILTER_LARGE_SHARD_THRESHOLD"]
default_threshold = "10_000"
(threshold_env || default_threshold).to_i(10)
end
end
class Executor < StreamExecutor
def initialize(context)
super(context, ShardExecutor)
end
def execute
have_shard = false
have_result_set = false
each_shard_executor do |shard_executor|
have_shard = true
shard_executor.execute
@context.consume_result_sets do |result_set|
have_result_set = true
yield(result_set)
end
break if @context.current_limit.zero?
end
unless have_shard
enumerator = @context.enumerator
message =
"[logical_range_filter] no shard exists: " +
"logical_table: <#{enumerator.logical_table}>: " +
"shard_key: <#{enumerator.shard_key_name}>"
raise InvalidArgument, message
end
return if have_result_set
each_shard_executor do |shard_executor|
shard = shard_executor.shard
result_set = HashTable.create(:flags => ObjectFlags::WITH_SUBREC,
:key_type => shard.table)
@context.push
@context.temporary_tables << result_set
targets = [[result_set]]
@context.dynamic_columns.apply_initial(targets)
@context.dynamic_columns.apply_filtered(targets)
yield(result_set)
@context.shift
break
end
end
end
class ShardExecutor < StreamShardExecutor
include QueryLoggable
def initialize(context, shard, shard_range)
super("logical_range_filter", context, shard, shard_range)
@result_sets = context.result_sets
end
def execute
ensure_filtered
return if @filtered_result_sets.empty?
each_result_set do |result_set|
sort_result_set(result_set)
return if @context.current_limit.zero?
end
end
def compute_limit(n_source_records)
current_limit = @context.current_limit
if current_limit < 0
n_source_records
else
current_limit
end
end
def find_range_index
use_range_index_parameter_message =
"force by use_range_index parameter"
case @context.use_range_index
when true
return find_range_index_raw(use_range_index_parameter_message,
__LINE__, __method__)
when false
log_use_range_index(false,
use_range_index_parameter_message,
__LINE__, __method__)
return nil
end
range_index_logical_parameter_message =
"force by range_index logical parameter"
case Parameters.range_index
when :always
return find_range_index_raw(range_index_logical_parameter_message,
__LINE__, __method__)
when :never
log_use_range_index(false,
range_index_logical_parameter_message,
__LINE__, __method__)
return nil
end
unless @context.dynamic_columns.empty?
reason = "dynamic columns are used"
log_use_range_index(false, reason, __LINE__, __method__)
return nil
end
unless @context.post_filter.nil?
reason = "post_filter is used"
log_use_range_index(false, reason, __LINE__, __method__)
return nil
end
unless @context.sort_keys.empty?
reason = "sort_keys is used"
log_use_range_index(false, reason, __LINE__, __method__)
return nil
end
current_limit = @context.current_limit
if current_limit < 0
reason = "limit is negative: <#{current_limit}>"
log_use_range_index(false, reason, __LINE__, __method__)
return nil
end
required_n_records = @context.current_offset + current_limit
max_n_records = @shard.table.size
is_large_shard = (max_n_records > @context.large_shard_threshold)
if is_large_shard and max_n_records <= required_n_records
reason = "the number of required records (#{required_n_records}) "
reason << ">= "
reason << "the number of records in shard (#{max_n_records})"
log_use_range_index(false, reason,__LINE__, __method__)
return nil
end
threshold = @context.threshold
if threshold <= 0.0
reason = "threshold is negative: <#{threshold}>"
return find_range_index_raw(reason, __LINE__, __method__)
end
if threshold >= 1.0
reason = "threshold (#{threshold}) >= 1.0"
log_use_range_index(false, reason, __LINE__, __method__)
return nil
end
table = @shard.table
estimated_n_records = 0
case @cover_type
when :all
if @filter
create_expression(table) do |expression|
@expression_builder.build_all(expression)
unless range_index_available_expression?(expression,
__LINE__, __method__)
return nil
end
estimated_n_records = expression.estimate_size(table)
end
else
estimated_n_records = max_n_records
end
when :partial_min
create_expression(table) do |expression|
@expression_builder.build_partial_min(expression)
unless range_index_available_expression?(expression,
__LINE__, __method__)
return nil
end
estimated_n_records = expression.estimate_size(table)
end
when :partial_max
create_expression(table) do |expression|
@expression_builder.build_partial_max(expression)
unless range_index_available_expression?(expression,
__LINE__, __method__)
return nil
end
estimated_n_records = expression.estimate_size(table)
end
when :partial_min_and_max
create_expression(table) do |expression|
@expression_builder.build_partial_min_and_max(expression)
unless range_index_available_expression?(expression,
__LINE__, __method__)
return nil
end
estimated_n_records = expression.estimate_size(table)
end
end
if is_large_shard and estimated_n_records <= required_n_records
reason = "the number of required records (#{required_n_records}) "
reason << ">= "
reason << "the number of estimated records (#{estimated_n_records})"
log_use_range_index(false, reason, __LINE__, __method__)
return nil
end
max_n_unmatched_records =
compute_max_n_unmatched_records(max_n_records,
required_n_records)
if estimated_n_records >= max_n_unmatched_records
reason = "the max number of unmatched records (#{max_n_unmatched_records}) "
reason << "<= "
reason << "the number of estimated records (#{estimated_n_records})"
return find_range_index_raw(reason, __LINE__, __method__)
end
hit_ratio = estimated_n_records / max_n_records.to_f
use_range_index_by_hit_ratio = (hit_ratio >= threshold)
if use_range_index_by_hit_ratio
relation = ">="
else
relation = "<"
end
reason = "hit ratio "
reason << "(#{hit_ratio}=#{estimated_n_records}/#{max_n_records}) "
reason << "#{relation} threshold (#{threshold})"
if use_range_index_by_hit_ratio
find_range_index_raw(reason, __LINE__, __method__)
else
log_use_range_index(false, reason, __LINE__, __method__)
nil
end
end
def range_index_available_expression?(expression, line, method_name)
nested_reference_vector_column_accessor =
find_nested_reference_vector_column_accessor(expression)
if nested_reference_vector_column_accessor
reason = "nested reference vector column accessor can't be used: "
reason << "<#{nested_reference_vector_column_accessor.name}>"
log_use_range_index(false, reason, line, method_name)
return false
end
selector_only_procedure = find_selector_only_procedure(expression)
if selector_only_procedure
reason = "selector only procedure can't be used: "
reason << "<#{selector_only_procedure.name}>"
log_use_range_index(false, reason, line, method_name)
return false
end
true
end
def find_nested_reference_vector_column_accessor(expression)
expression.codes.each do |code|
value = code.value
next unless value.is_a?(Accessor)
sub_accessor = value
while sub_accessor.have_next?
object = sub_accessor.object
return value if object.is_a?(Column) and object.vector?
sub_accessor = sub_accessor.next
end
end
nil
end
def find_selector_only_procedure(expression)
expression.codes.each do |code|
value = code.value
return value if value.is_a?(Procedure) and value.selector_only?
end
nil
end
def execute_filter(range_index)
case @cover_type
when :all
filter_shard_all(range_index)
when :partial_min
if range_index
filter_by_range(range_index,
@target_range.min, @target_range.min_border,
nil, nil)
else
filter_table do |expression|
@expression_builder.build_partial_min(expression)
end
end
when :partial_max
if range_index
filter_by_range(range_index,
nil, nil,
@target_range.max, @target_range.max_border)
else
filter_table do |expression|
@expression_builder.build_partial_max(expression)
end
end
when :partial_min_and_max
if range_index
filter_by_range(range_index,
@target_range.min, @target_range.min_border,
@target_range.max, @target_range.max_border)
else
filter_table do |expression|
@expression_builder.build_partial_min_and_max(expression)
end
end
end
end
def filter_shard_all(range_index)
table = @target_table
if @filter.nil?
if @post_filter.nil? and table.size <= @context.current_offset
@context.current_offset -= table.size
return
end
if range_index
filter_by_range(range_index,
nil, nil,
nil, nil)
else
add_filtered_result_set(table)
end
else
if range_index
filter_by_range(range_index,
nil, nil,
nil, nil)
else
filter_table do |expression|
@expression_builder.build_all(expression)
end
end
end
end
def filter_by_range(range_index, min, min_border, max, max_border)
lexicon = range_index.domain
@context.referred_objects << lexicon
data_table = range_index.range
@context.referred_objects << data_table
flags = build_range_search_flags(min_border, max_border)
result_set = HashTable.create(:flags => ObjectFlags::WITH_SUBREC,
:key_type => data_table)
@temporary_tables << result_set
n_matched_records = 0
TableCursor.open(lexicon,
:min => min,
:max => max,
:flags => flags) do |table_cursor|
options = {
:offset => @context.current_offset,
:limit => compute_limit(data_table.size),
}
max_n_unmatched_records =
compute_max_n_unmatched_records(data_table.size,
options[:limit])
options[:max_n_unmatched_records] = max_n_unmatched_records
if @filter
create_expression(data_table) do |expression|
expression.parse(@filter)
options[:expression] = expression
IndexCursor.open(table_cursor, range_index) do |index_cursor|
n_matched_records = index_cursor.select(result_set, options)
end
end
# TODO: Add range information
query_logger.log(:size, ":",
"filter(#{n_matched_records})" +
"[#{@shard.table_name}]: #{@filter}")
else
IndexCursor.open(table_cursor, range_index) do |index_cursor|
n_matched_records = index_cursor.select(result_set, options)
end
# TODO: Add range information
query_logger.log(:size, ":",
"filter(#{n_matched_records})" +
"[#{@shard.table_name}]")
end
if n_matched_records == -1
fallback_message =
"fallback because there are too much unmatched records: "
fallback_message << "<#{max_n_unmatched_records}>"
log_use_range_index(false,
fallback_message,
__LINE__, __method__)
execute_filter(nil)
return
end
end
if n_matched_records <= @context.current_offset
@context.current_offset -= n_matched_records
return
end
if @context.current_offset > 0
@context.current_offset = 0
end
if @context.current_limit > 0
@context.current_limit -= result_set.size
end
@result_sets << result_set
end
def build_range_search_flags(min_border, max_border)
flags = TableCursorFlags::BY_KEY
case @context.order
when :ascending
flags |= TableCursorFlags::ASCENDING
when :descending
flags |= TableCursorFlags::DESCENDING
end
case min_border
when :include
flags |= TableCursorFlags::GE
when :exclude
flags |= TableCursorFlags::GT
end
case max_border
when :include
flags |= TableCursorFlags::LE
when :exclude
flags |= TableCursorFlags::LT
end
flags
end
def compute_max_n_unmatched_records(max_n_records, limit)
return limit if max_n_records.zero?
scale = Math.log(max_n_records) ** 2
max_n_unmatched_records = limit * 2 * scale
max_n_sample_records = max_n_records
if max_n_sample_records > 10000
max_n_sample_records = max_n_sample_records / scale
end
if max_n_unmatched_records > max_n_sample_records
max_n_unmatched_records = max_n_sample_records
end
max_n_unmatched_records.ceil
end
def sort_result_set(result_set)
if result_set.size <= @context.current_offset
@context.current_offset -= result_set.size
return
end
if @context.sort_keys.empty?
sort_keys = [
{
:key => @context.enumerator.shard_key_name,
:order => @context.order,
},
]
else
sort_keys = @context.sort_keys.collect do |sort_key|
if sort_key.start_with?("-")
key = sort_key[1..-1]
order = :descending
else
key = sort_key
order = :ascending
end
{:key => key, :order => order}
end
end
if @context.current_limit > 0
limit = @context.current_limit
else
limit = result_set.size
end
sorted_result_set = result_set.sort(sort_keys,
:offset => @context.current_offset,
:limit => limit)
@temporary_tables << sorted_result_set
@result_sets << sorted_result_set
if @context.current_offset > 0
@context.current_offset = 0
end
if @context.current_limit > 0
@context.current_limit -= sorted_result_set.size
end
unparsed_sort_keys = sort_keys.collect do |sort_key|
key = sort_key[:key]
key = "-#{key}" if sort_key[:order] == :descending
key
end
query_logger.log(:size,
":",
"sort(#{sorted_result_set.size})" +
"[#{@shard.table_name}]: " +
unparsed_sort_keys.join(","))
end
end
end
end
end
|