Results 11 - 20 of 4,229

Multi-Step Processing of Spatial Joins

by Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger
"... Spatial joins are one of the most importaot operations for combining spatial objects of several relations. IO this paper, spatial join processing is studied in detail for extended spatial objects in two-dimensional data space. We present an approach for spatial join processing that is based on three ..."
Abstract - Cited by 139 (14 self) - Add to MetaCart
on three steps. First, a spatial join is performed on the minimum bounding rectangles of the objects returning a set of candidates. Various approaches for accelerating this step of join processing have been examined at the last year’s conference [BKS 93a]. In this paper, we focus on the problem how

Similarity and induction

by Daniel N. Osherson, Ormond Wilkie, Edward E. Smith, Alejandro Lopez, Eldar Shafir - Review of Philosophy and Psychology , 2010
"... An argument is categorical if its premises and conclusion are of the form All members ofC have property F, where C is a natural category like FALCON or BIRD, and P remains the same across premises and conclusion. An example is Grizzly bears love onions. Therefore, all bears love onions. Such an argu ..."
Abstract - Cited by 258 (10 self) - Add to MetaCart
of several experiments. The Problem of Argument Strength Fundamental to human thought is the confirmation relation, joining sentences P,... Pn to another sentence C just in case belief in the former leads to belief in the latter. Theories of confirmation may be cast in the terminology of argument strength,

A Java Fork/Join Framework

by Doug Lea , 2000
"... This paper describes the design, implementation, and performance of a Java framework for supporting a style of parallel programming in which problems are solved by (recursively) splitting them into subtasks that are solved in parallel, waiting for them to complete, and then composing results. The ge ..."
Abstract - Cited by 117 (0 self) - Add to MetaCart
improvements. 1. INTRODUCTION Fork/Join parallelism is among the simplest and most effective design techniques for obtaining good parallel performance. Fork/join algorithms are parallel versions of familiar divideand -conquer algorithms, taking the typical form: Result solve(Problem problem) { if (problem

XJoin: A Reactively-Scheduled Pipelined Join Operator

by Tolga Urhan, Michael J. Franklin - IEEE DATA ENGINEERING BULLETIN , 2000
"... Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imbalances, and temporary outages. Pipelined query execution is a promising approach to coping with unpredictability in such ..."
Abstract - Cited by 138 (8 self) - Add to MetaCart
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imbalances, and temporary outages. Pipelined query execution is a promising approach to coping with unpredictability

Heuristic and Randomized Optimization for the Join Ordering Problem

by Michael Steinbrunn, Guido Moerkotte, Alfons Kemper - VLDB Journal , 1997
"... Recent developments in database technology, such as deductive database systems, have given rise to the demand for new, cost-effective optimization techniques for join expressions. In this paper many different algorithms that compute approximate solutions for optimizing join orders are studied since ..."
Abstract - Cited by 83 (2 self) - Add to MetaCart
Recent developments in database technology, such as deductive database systems, have given rise to the demand for new, cost-effective optimization techniques for join expressions. In this paper many different algorithms that compute approximate solutions for optimizing join orders are studied since

Scalable sweeping-based spatial join

by Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter - IN PROC. 24TH INT. CONF. VERY LARGE DATA BASES, VLDB , 1998
"... In this paper, we consider the filter step of the spatial join problem, for the case where neither of the inputs are indexed. We present a new algorithm, Scalable Sweeping-Based Spatial Join (SSSJ), that achieves both efficiency on real-life data and robustness against highly skewed and worst-case d ..."
Abstract - Cited by 68 (7 self) - Add to MetaCart
In this paper, we consider the filter step of the spatial join problem, for the case where neither of the inputs are indexed. We present a new algorithm, Scalable Sweeping-Based Spatial Join (SSSJ), that achieves both efficiency on real-life data and robustness against highly skewed and worst

Approximate Join Processing Over Data Streams

by Abhinandan Das, Johannes Gehrke, Mirek Riedewald , 2003
"... We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource constraints by shedding load in the form of dropping tuples from the data streams. We first discuss alternate architectural m ..."
Abstract - Cited by 122 (3 self) - Add to MetaCart
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource constraints by shedding load in the form of dropping tuples from the data streams. We first discuss alternate architectural

On the complexity of join predicates

by Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton - In Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems , 2001
"... We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins combinatorially, by the length of their optimal pebbling strategies and computationally, by the complexity of discovering th ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins combinatorially, by the length of their optimal pebbling strategies and computationally, by the complexity of discovering

ELM-ART: An intelligent tutoring system on World Wide web

by Peter Brusilovsky, Elmar Schwarz, Gerhard Weber , 1996
"... Abstract: Making ITS available on the World Wide Web (WWW) is a way to integrate the flexibility and intelligence of ITS with world-wide availability of WWW applications. This paper discusses the problems of developing WWW-available ITS and, in particular, the problem of porting existing ITS to a WW ..."
Abstract - Cited by 217 (22 self) - Add to MetaCart
Abstract: Making ITS available on the World Wide Web (WWW) is a way to integrate the flexibility and intelligence of ITS with world-wide availability of WWW applications. This paper discusses the problems of developing WWW-available ITS and, in particular, the problem of porting existing ITS to a

Optimizing joins in a mapreduce environment

by Foto N. Afrati, Jeffrey D. Ullman - In EDBT , 2010
"... Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our new approach begins by identifying the “map-key, ” the set of attributes that identify the Reduce process to which a Map ..."
Abstract - Cited by 91 (4 self) - Add to MetaCart
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our new approach begins by identifying the “map-key, ” the set of attributes that identify the Reduce process to which a Map
Results 11 - 20 of 4,229