8953 search results - page 289 / 1791 » Parallel Query Processing |
135
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
107
Voted
HCW
1998
IEEE
15 years 7 months ago
1998
IEEE
The heterogeneous parallel processing community has long been struggling to bring its approach to computation into the mainstream. One major impediment is that no popular programm...
116
click to vote
ICDCSW
2005
IEEE
15 years 9 months ago
2005
IEEE
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
140
Voted
ITCC
2005
IEEE
15 years 9 months ago
2005
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
123
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...