5 results about "Boolean expression" patented technology

Techniques are disclosed relating to implementing multiple index scans. A computer system may store a database table comprising fields and indexes corresponding to those fields. The computer system may receive a request to access records based on a Boolean expression that affects a selection of records from the database table and that comprises clauses, at least two of which are joined by an AND operation. The computer system may access the requested records. The accessing may include, for a given one of the at least two clauses, performing an index scan on an index that corresponds to the given clause to identify records that satisfy that clause. The computer system may update a hash table based on the identified records and then identify the requested records based on the hash table. The Boolean expression may include clauses joined by an OR operation that are processed using multiple index scans.

The application provides a filtering condition rewriting method, device, equipment, medium and product, comprising: obtaining a filtering condition; when the filtering condition meets an optimization condition, splitting the filtering condition into a condition unit; when the condition unit is a Boolean expression containing a column name and a constant, determining a current partition table in which a target column corresponding to the column name is located and a current partition column of the current partition table, determining an optimization mark of the condition unit by comparing the current partition column with the target column; if the optimization mark of the condition unit is first mark information and a partition base table of the current partition table of the condition unit is a range partition table, obtaining the constant and a comparison operator in the condition unit, selecting a current lower-level partition table from lower-level partition tables of the partition base table, and determining optimization indication information of the condition unit according to the constant, the comparison operator and partition information of the current lower-level partition table; and rewriting based on the optimization indication information to obtain a rewritten filtering condition. The method improves the query efficiency of the filtering condition.

Disclosed herein are systems and methods of a prototyping system for circuit design testing. The prototyping system employs hardware (“Debug FPGA”) that performs a series of Boolean evaluations according to testbench configurations loaded at runtime. FPGAs performing the DUT operate synchronously, in which each component must start, stop, and step through the DUT's operations according to the Boolean operations of the Debug FPGA. The hardware and software functions disclosed simultaneously stop the clocks of the FPGAs according to user-defined trigger conditions in the DUT output, allowing the designer to stop the prototyping system to analyze or debug the DUT. Based on the data outputs from the FPGAs performing the DUT, the Boolean expressions of the Debug FPGA detect state transitions or trigger events occurring within the DUT. When the Debug FPGA detects a trigger event, the Debug FPGA transmits a clock-stopping signal to each of the FPGAs.

This application provides a data search method, apparatus, device, and medium. The method includes: selecting multiple target historical filtering conditions from a historical query dataset based on vector data of attribute data that satisfy various historical filtering conditions and the memory budget limit corresponding to the attribute vector dataset, with the goal of minimizing query cost; constructing sub-indexes corresponding to each target historical filtering condition based on the vector data of attribute data that satisfy each target historical filtering condition, and constructing a full index based on the multiple vector data; constructing an index dependency graph based on the sub-indexes and the full index; and, in response to a query request, selecting target vector data that semantically matches the query vector data and satisfies the query filtering conditions according to the query vector data and query filtering conditions carried in the query request, based on the index dependency graph. This allows for query filtering conditions based on arbitrary Boolean expressions, and features low index construction overhead, high efficiency, and controllable memory consumption.

A non-transitory computer-readable medium that includes computer-executable instructions for carrying out a method (of expanding a set of standard cells which comprise a library) including: identifying ad hoc groups of elementary standard cells which are recurrent (in a population of one or more layout diagrams) and each of which, as a whole, having a first number of transistors and a second number of logic gates; and selecting one of the ad hoc groups to provide a selected logical function which is representable as a Boolean expression; generating one or more macro standard cells each of which, as a whole, having a third number of components (representing transistors or logic gates in a context of the first or second numbers) which is smaller than the first number or the second number; and adding the one or more macro standard cells to, and thereby expanding, the set of standard cells.