353 search results - page 34 / 71 » Processing Top-k Join Queries |
166
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
163
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
175
click to vote
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
170
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
196
click to vote
MMDB
2003
ACM
15 years 11 months ago
2003
ACM
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...