✦ LIBER ✦

An Algorithm for Handling Many Relational Calculus Queries Efficiently

✍ Scribed by Dan E. Willard

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 390 KB
Volume: 65
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.2002.1848

No coin nor oath required. For personal study only.

✦ Synopsis

This article classifies a group of complicated relational calculus queries whose search algorithms run in time OðI Log d I þ UÞ and space OðIÞ, where I and U are the sizes of the input and output, and d is a constant depending on the query (which is usually, but not always, equal to zero or one). Our algorithm will not entail any preprocessing of the data. # 2002 Elsevier Science (USA)

📜 SIMILAR VOLUMES

An Efficient Algorithm for Hydrodynamica

An Efficient Algorithm for Hydrodynamical Interaction of Many Deformable Drops

✍ Alexander Z. Zinchenko; Robert H. Davis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 545 KB

An efficient and accurate 3D algorithm for dynamical simulations of many deformable drops with strong hydrodynamical interactions at zero Reynolds numbers is developed. The drop-to-medium viscosity ratio, λ, and the Bond number are arbitrary, and the drops are subject to gravity with stationary trip

An Efficient Membership-Query Algorithm

An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution

✍ Jeffrey C Jackson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 566 KB

We present a membership-query algorithm for efficiently learning DNF with respect to the uniform distribution. In fact, the algorithm properly learns with respect to uniform the class TOP of Boolean functions expressed as a majority vote over parity functions. We also describe extensions of this alg

An Efficient Approximation Algorithm for

An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines

✍ Chandra Chekuri; Michael Bender 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

We give a new and efficient approximation algorithm for scheduling precedenceconstrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j /s i units of time