1160 search results - page 78 / 232 » Query Processing and Optimization for Pictorial Query Trees |
173
click to vote
VLDB
2008
ACM
15 years 10 months ago
2008
ACM
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
183
Voted
SIGIR
2011
ACM
14 years 1 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
154
click to vote
GIS
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of express...
172
click to vote
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
We present our prototype system, OMCAT, which optimizes the reevaluation of a set of pending continuous spatio-temporal queries on trajectory data, when some of the trajectories a...
168
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...