scispace - formally typeset
Patent

Identification of vacuous predicates in computer programs

TLDR
In this article, a computer system identifies a predicate in a computer language containing constant expressions as vacuous and represents the predicate by a set of bounding rectangles in a space having a number of dimensions equal to the number of variables.
Abstract
A computer system identifies a predicate in a computer language containing constant expressions as vacuous. The system identifies distinct variables contained in the predicate and represents the predicate by a set of bounding rectangles. The bounding rectangles are represented in a space having a number of dimensions equal to the number of variables. There are finite limits on dimensions of a bounding rectangle which represent the relationship between the variables in the predicate and the constant expressions in the predicate. The predicate is identified as vacuously FALSE where the set of bounding rectangles is empty.

read more

Citations
More filters
Patent

Maximizing expected generalization for learning complex query concepts

TL;DR: In this article, a method of learning a user query concept is provided which includes a sample selection stage and a feature reduction stage, during which the selected sample objects include feature sets that are no more than a prescribed amount different from a corresponding feature set defined by the k-CNF.
Patent

SQL injection protection by variable normalization

TL;DR: In this paper, a method for determining allowability of a structured query language (SQL) statement is presented, the method comprising the steps of normalizing the SQL statement, and comparing the normalized SQL statement with a predetermined set of allowable statements.
Patent

System, method and program product to optimize code during run time

TL;DR: In this article, a determination is made whether a computer program calls a method which includes a conditional evaluation of a variable which is fixed and the evaluation of the fixed variable does not result in anything productive being accomplished except to return to execution of the computer program.
Patent

Platform for processing semi-structured self-describing data with controlled side effects

TL;DR: Extensible Markup Language (XML) Application Server as mentioned in this paper is an XML application server for storing, processing, communicating, and displaying dynamic semi-structured information, which includes a declarative specification language, a transactional indexed XML data store, and an application server engine.
Patent

Boolean term conversion for null-tolerant disjunctive predicates

TL;DR: In this paper, the received query including a first predicate specifying a comparison operator and a second predicate specifying an IS NULL operator was modified by replacing the comparison operator of the first predicate with an extended comparison operator, and removing the IS NULL operation from the query.
References
More filters
Proceedings ArticleDOI

A predicate matching algorithm for database rule systems

TL;DR: This work introduces an algorithm for finding the matching predicates that is more efficient than the standard algorithm when the number of predicates is large, and focuses on equality and inequality predicates on totally ordered domains.
Patent

Reordering of complex SQL queries involving groupbys, joins, outer joins and full outer joins

TL;DR: In this paper, a method, apparatus, and article of manufacture for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations is presented.
Journal ArticleDOI

The geometry of semaphore programs

TL;DR: A model of concurrent semaphore programs based on multidimensional, solid geometry based on two-process mutual exclusion problems is presented and is shown to be exact for systems composed of an arbitrary, yet fixed number of concurrent processes.
Proceedings ArticleDOI

A predicate transformer approach to semantics of parallel programs

TL;DR: An extensional semantics for parallel programs based on predicate transformers is presented and it is shown that the fixpoint characterization of wlt completely captures the notion of progress under weak fairness, with programs modelled as infinite directed computation trees.
Proceedings ArticleDOI

Detection of exclusive OR global predicates

TL;DR: An exclusive OR global predicates is introduced to describe exclusive usages of shared resources in distributed programs and the exclusive OR condition is easily detectable by sequentializing all true events in a given run.
Related Papers (5)