#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1974

2012

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis
- J. ACM
- 1983

A class of database schemes, called acychc, was recently introduced. It is shown that this class has a number of desirable properties. In particular, several desirable properties that have been studied by other researchers m very different terms are all shown to be eqmvalent to acydicity. In addition, several equivalent charactenzauons of the class m terms… (More)

- Catriel Beeri, Raghu Ramakrishnan
- J. Log. Program.
- 1987

This paper considers the efficient evaluation of recursive queries expressed using Horn Clauses. We define <italic>sideways information passing</italic> formally and show how a query evaluation algorithm may be defined in terms of sideways information passing and control. We then consider a class of information passing strategies which suffices to describe… (More)

- Catriel Beeri, Moshe Y. Vardi
- J. ACM
- 1984

A class of dependencies, tuple and equality generating dependencies, is defined, and the chase process is generalized to deal with these dependenetes. For total dependencies the chase is an exponential ttme decision procedure for the implication problem, and in some restricted cases it can be modified to run m polynomial Ume. For nontotal dependencies the… (More)

- Catriel Beeri, Philip A. Bernstein
- ACM Trans. Database Syst.
- 1979

Problems related to functional dependencies and the algorithmic design of relational schemas are examined. Specifically, the following results are presented: (1) a tree model of derivations of functional dependencies from other functional dependencies; (2) a linear-time algorithm to test if a functional dependency is in the closure of a set of functional… (More)

- Catriel Beeri, Ronald Fagin, John H. Howard
- SIGMOD Conference
- 1977

We investigate the inference rules that can be applied to functional and multivalued dependencies that exist in a database relation. Three types of rules are discussed. First, we list the well known rules for functional dependencies. Then we investigate the rules for multivalued dependencies. It is shown that for each rule for functional dependencies the… (More)

- Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman
- J. ACM
- 1984

An Armstrong relation for a set of functional dependencies (FDs) is a relation that satisfies each FD implied by the set but no FD that is not implied by it. The structure and size (number of tuples) of Armstrong relatsons are investigated. Upper and lower bounds on the size of minimal-sized Armstrong relations are derived, and upper and lower bounds on the… (More)

- Serge Abiteboul, Catriel Beeri
- The VLDB Journal
- 1995

Various models and languages for describing and manipulating hierarchically structured data have been proposed. Algebraic, calculus-based, and logic-programming oriented languages have all been considered. This article presents a general model for complex values (i.e., values with hierarchical structures), and languages for it based on the three paradigms.… (More)

- Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman
- 18th Annual Symposium on Foundations of Computer…
- 1977

Answering queries in a relational database often requires that the natural join of two or more relations be computed. However, the result of a join may not be what one expects. In this paper we give efficient algorithms to determine whether the join of several relations has the intuitively expected value (is <italic>lossless</italic>) and to determine… (More)

- Catriel Beeri, Anat Eyal, Simon Kamenkovich, Tova Milo
- VLDB
- 2006

We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (Business Process Execution Language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are… (More)

- Catriel Beeri
- ACM Trans. Database Syst.
- 1980

The problem of whether a given dependency in a database relation can be derived from a given set of dependencies is investigated. We show that the problem can be decided in polynomial time when the given set consists of either multivalued dependencies only or of both functional and multivalued dependencies and the given dependency is also either a… (More)