Sciweavers

353 search results - page 6 / 71
» Processing Top-k Join Queries
Sort
View
CIKM
2006
Springer
13 years 11 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...
SSD
1999
Springer
97views Database» more  SSD 1999»
14 years 2 days ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 8 months ago
Authenticated join processing in outsourced databases
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
Yin Yang, Dimitris Papadias, Stavros Papadopoulos,...
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
14 years 4 days ago
Integration of Spatial Join Algorithms for Processing Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
Nikos Mamoulis, Dimitris Papadias
VLDB
1999
ACM
127views Database» more  VLDB 1999»
14 years 2 days ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano