#### Filter Results:

#### Publication Year

1987

1996

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The replacement of nonlinear recursions with equivalent linear recursions is a potentially useful query optimization strategy, since it permits the use of efficient algorithms for the evaluation of linear logic programs. We show that a member of a certain class of bilinear recursions is linearizable in a strong sense if and only if a specific partial proof… (More)

A number of optimizations have been proposed for Datalog programs involving a single intensional predicate (“single-IDB programs”). Examples include the detection of <italic>commutativity</italic> and <italic>separability</italic> ([Naug88],[RSUV89], [Ioan89a]) in linear logic programs, and the detection of <italic>ZYT-linearizability</italic>… (More)

We investigate the complexity of various optimization techniques for logic databases. In particular, we provide polynomial-time algorithms for restricted versions of common program transformations, and show that a minor relaxation of these restrictions leads to <italic>NP</italic>-hardness. To this end, we define the <italic>k</italic>-containment problem… (More)

Yatin Saraiya Bellcore yatin~bellcore.com Several recently-proposed query languages have extended relational languages to a data model that involves nested records and sets, as ameansof combining the declarative and object-oriented paradigms. These proposals have been converging, indicating a core set of operations that seem essential to any such language.… (More)

- ‹
- 1
- ›