1007 search results - page 84 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
139
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
147
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
A parallel structure to do spectrum sensing in Cognitive Radio (CR) at sub-Nyquist rate is proposed. The structure is based on Compressed Sensing (CS) that exploits the sparsity o...
132
click to vote
DATESO
2010
15 years 1 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
218
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
140
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...