Sciweavers

9 search results - page 1 / 2
» A Disk-Based Join With Probabilistic Guarantees
Sort
View
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 4 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
CIKM
2006
Springer
13 years 8 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
GIS
2007
ACM
14 years 5 months ago
An interactive framework for raster data spatial joins
Many Geographic Information System (GIS) applications must handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries i...
Wan D. Bae, Petr Vojtechovský, Shayma Alkob...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 4 months ago
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. Th...
Sharmila Sankar, V. Sankaranarayanan
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
14 years 6 months ago
Confidence-Aware Join Algorithms
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
Parag Agrawal, Jennifer Widom