Sciweavers

12637 search results - page 2486 / 2528
» Security for Extensible Systems
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
13 years 11 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
POS
1994
Springer
13 years 11 months ago
Expressing Object Residency Optimizations Using Pointer Type Annotations
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
J. Eliot B. Moss, Antony L. Hosking
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
13 years 11 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
SIGGRAPH
1992
ACM
13 years 11 months ago
Interactive inspection of solids: cross-sections and interferences
To reduce the cost of correcting design errors, assemblies of mechanical parts are modeled using CAD systems and verified electronically before the designs are sent to manufacturi...
Jarek Rossignac, Abe Megahed, Bengt-Olaf Schneider
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
13 years 11 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
« Prev « First page 2486 / 2528 Last » Next »