1160 search results - page 121 / 232 » Query Processing and Optimization for Pictorial Query Trees |
140
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
ICDT
2005
ACM
15 years 7 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
131
click to vote
CVDB
2005
ACM
15 years 3 months ago
2005
ACM
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
123
click to vote
CLOUD
2010
ACM
15 years 6 months ago
2010
ACM
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
119
click to vote
DAGSTUHL
2004
15 years 2 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...