# On implicate discovery and query optimization

@article{Vorwerk2002OnID, title={On implicate discovery and query optimization}, author={Kristofer Vorwerk and G. Paulley}, journal={Proceedings International Database Engineering and Applications Symposium}, year={2002}, pages={2-11} }

Boolean expression simplification is a well-known problem in the history of computer science. The problem of determining prime implicates from an arbitrary Boolean expression has been mostly studied in the contexts of hardware design and automated reasoning. While many of the same principles can be applied to the simplification of search conditions in ANSI SQL queries, the richness of its language and SQL's three-valued logic present a number of challenges. We propose a modified version of a… Expand

#### 6 Citations

Application of Definability to Query Answering over Knowledge Bases

- Mathematics
- 2014

Answering object queries (i.e. instance retrieval) is a central task in ontology based data access (OBDA). Performing this task involves reasoning with respect to a knowledge base K (i.e. ontology)… Expand

10381 Summary and Abstracts Collection - Robust Query Processing

- Computer Science
- Robust Query Processing
- 2010

These proceedings first review the seminar topics, goals, and results, then present abstracts or notes of some of the seminar break-out sessions, as well as summaries of a few of those papers that were contributed by some participants. Expand

The logic transformations for reducing the complexity of the discernibility function-based attribute reduction problem

- Mathematics, Computer Science
- Knowledge and Information Systems
- 2015

This study shows that the main shortcoming of the discernibility function (DF)-based approach to attribute reduction is its excessively high space complexity. Expand

Database Self-Management: Taming the Monster

- Computer Science
- IEEE Data Eng. Bull.
- 2011

It is illustrated how SQL Anywhere’s embeddability features work in concert to provide a robust data management solution in zero-administration environments. Expand

Alternative data storage solution for mobile messaging services

- Computer Science
- Mob. Inf. Syst.
- 2007

This paper presents an evaluation of SMS and MMS platforms using different database management systems - DBMS and recommends the best data management strategies for these platforms. Expand

Simulation Model Composition for the Large-Scale Analysis of Smart Grid Control Mechanisms

- Engineering
- 2013

For the intelligent future power system (Smart Grid) new control schemes have to be developed that analyze the status of all actors and schedule required actions among these to keep the power system… Expand

#### References

SHOWING 1-10 OF 37 REFERENCES

A formal model of trade-off between optimization and execution costs in semantic query optimization

- Computer Science
- Data Knowl. Eng.
- 1992

This paper discusses the trade-off between the two costs in the context of semantic query optimization with regard to a set of integrity constraints, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. Expand

A New Algorithm for Generating Prime Implicants

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1970

It is proved that the algorithm will find all the prime implicants of a Boolean function, and the algorithm is implemented by a computer program in the LISP language. Expand

CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

- Mathematics, Computer Science
- Journal of Automated Reasoning
- 2004

The PI algorithm alone is sufficient in a computational sense, however, it can be combined with path dissolution, and it is shown empirically that this is often an advantage. Expand

Algorithms for Selective Enumeration of Prime Implicants

- Computer Science, Mathematics
- Artif. Intell.
- 1999

This work presents a new approach for selective enumeration of prime implicants of CNF formulae, using a 0–1 programming schema, and presents two algorithms, one which has wider applicability but is less efficient than the other. Expand

Computing Prime Implicates Incrementally

- Mathematics, Computer Science
- CADE
- 1992

PIGLET outperforms IPIA, in that it generates a smaller search space and takes less CPU time and its superiority is evident both when updating a randomly-generated theory by a random clause and when the authors generalize the two programs for the task of updating by more than one clause. Expand

Generalization of Consensus Theory and Application to the Minimization of Boolean Functions

- Computer Science
- IEEE Trans. Electron. Comput.
- 1967

The consensus is extended from two to any number of terms, and it is shown that any prime implicant of a Boolean function is a generalized consensus; therefore the algorithm for the determination of the consensus relations can be used for finding theprime implicants. Expand

Optimizing queries using materialized views: a practical, scalable solution

- Computer Science
- SIGMOD '01
- 2001

A fast and scalable algorithm for determining whether part or all of a query can be computed from materialized views and how it can be incorporated in transformation-based optimizers is presented. Expand

Computing prime implicates

- Computer Science
- CSC '92
- 1992

This paper surveys three methods for computing the prime implicates of a set of propositions and performs a comparison between them and suggests that methods based on resolution can be as efficient as methodsbased on matrices and semantic trees. Expand

An Incremental Method for Generating Prime Implicants/Impicates

- Computer Science, Mathematics
- J. Symb. Comput.
- 1990

The correctness proof and complexity analysis of the incremental method and the role of prime implicants in the CMS is mentioned and the intricacy of subsumptions in the incremental process is examined. Expand

Implicit and incremental computation of primes and essential primes of Boolean functions

- Computer Science
- [1992] Proceedings 29th ACM/IEEE Design Automation Conference
- 1992

The authors show that implicit set manipulation techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essential prime implicants of incompletely specified Boolean functions. Expand