1160 search results - page 30 / 232 » Query Processing and Optimization for Pictorial Query Trees |
DBISP2P
2004
Springer
14 years 4 months ago
2004
Springer
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
APWEB
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
ADBIS
1998
Springer
14 years 3 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
ADBIS
2000
Springer
14 years 2 months ago
2000
Springer
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
SIGMOD
2011
ACM
13 years 1 months ago
2011
ACM
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...