Sciweavers

418 search results - page 15 / 84
» Optimizing Large Join Queries in Mediation Systems
Sort
View
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
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
DMSN
2008
ACM
13 years 9 months ago
A substrate for in-network sensor data integration
With the ultimate goal of extending the data integration paradigm and query processing capabilities to ad hoc wireless networks, sensors, and stream systems, we consider how to su...
Svilen R. Mihaylov, Marie Jacob, Zachary G. Ives, ...
DBVIS
1993
101views Database» more  DBVIS 1993»
13 years 11 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...