Sciweavers

736 search results - page 29 / 148
» Confidence-Aware Join Algorithms
Sort
View
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
15 years 9 days ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
PDIS
1993
IEEE
14 years 3 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
SIGMOD
2010
ACM
277views Database» more  SIGMOD 2010»
14 years 3 months ago
A comparison of join algorithms for log processing in MaPreduce
The MapReduce framework is increasingly being used to analyze large volumes of data. One important type of data analysis done with MapReduce is log processing, in which a click-st...
Spyros Blanas, Jignesh M. Patel, Vuk Ercegovac, Ju...
SIGMOD
2004
ACM
143views Database» more  SIGMOD 2004»
14 years 11 months ago
Joining Interval Data in Relational Databases
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
Jost Enderle, Matthias Hampel, Thomas Seidl
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
14 years 2 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim