#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1987

1996

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yatin P. Saraiya
- PODS
- 1989

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)

- Yatin P. Saraiya
- PODS
- 1990

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)

- Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder
- IEEE Data Eng. Bull.
- 1987

- Yehoshua Sagiv, Yatin P. Saraiya
- Discrete Applied Mathematics
- 1992

- Yatin P. Saraiya
- SIGMOD Conference
- 1990

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)

- Yatin P. Saraiya
- J. Comput. Syst. Sci.
- 1995

- Tomás Feder, Yatin P. Saraiya
- ICDT
- 1992

In this paper, we present our first hand experiences from an actual re-engineering project. Business Reengineering is a process affecting not only the software system involved, but the underlying business model as well. Indeed, i t is the changed business model along with the new technologies that determine the design of the new system. This paper is a walk… (More)

- Teodor C. Przymusinski, Tomasz Imielinski, +9 authors Tiko Kameda
- 1989

The features of logic programming that seem unconventional from the viewpoint of classical logic can be explained in terms of constructivistic logic. We motivate and propose a constructivistic proof theory of non-Horn logic programming. Then, we apply this formalization for establishing results of practical interest. First, we show that 'stratification can… (More)

- Yatin P. Saraiya
- CIKM
- 1993

Yatin Saraiya

- ‹
- 1
- ›