skip to main content
Ngôn ngữ:
Giới hạn tìm kiếm: Giới hạn tìm kiếm: Dạng tài nguyên Hiển thị kết quả với: Hiển thị kết quả với: Chỉ mục

Faster Main Memory Scans in Unsorted Dictionary-Encoded Vectors

Steinemann Peter ; Legler Thomas

Toàn văn sẵn có

Trích dẫn Trích dẫn bởi
  • Nhan đề:
    Faster Main Memory Scans in Unsorted Dictionary-Encoded Vectors
  • Tác giả: Steinemann Peter ; Legler Thomas
  • Chủ đề: Physics ; Computing ; Calculating ; Counting ; Electric Digital Data Processing ; Medicine ; Sciences ; Chemistry ; Physics
  • Mô tả: A ValueID corresponding to a value to be searched for in a database column can be determined by finding a match in a dictionary for the database column. A row of an index vector for the database column at which to begin a scan for the ValueID can be identified by reading a ValueID lookup table that maps each unique ValueID to a starting position in the index vector for the database column. The ValueID can not occur in the index vector prior to the starting position. The index vector can be scanned beginning at the starting position to find at least one occurrence of the ValueID corresponding to the value being searched, and a result that includes one or more row locations in the database column corresponding to the at least one occurrence in the index vector of the ValueID corresponding to the value being searched can be returned.
  • Năm xuất bản: 18 May 2017
  • Ngôn ngữ: English

Đang tìm Cơ sở dữ liệu bên ngoài...