Sciweavers

734 search results - page 21 / 147
» Efficient join processing over uncertain data
Sort
View
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 4 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo
PVLDB
2008
182views more  PVLDB 2008»
14 years 9 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
PVLDB
2010
84views more  PVLDB 2010»
14 years 8 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
180
Voted
ICDE
2009
IEEE
151views Database» more  ICDE 2009»
15 years 11 months ago
Decision Trees for Uncertain Data
Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information, which originates from...
Smith Tsang, Ben Kao, Kevin Y. Yip, Wai-Shing Ho, ...
TKDE
1998
122views more  TKDE 1998»
14 years 9 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar