205 search results - page 6 / 41 » Optimizing Multiple Top-K Queries over Joins |
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
The exponential growth of the web and the extended use of database management systems in widely distributed information systems has brought to the fore the need for seamless interc...
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
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...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...