1007 search results - page 2 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
The performance of multiuser detection (MUD) algorithms for codedivision multiple-access (CDMA) systems depends on the accuracy of channel estimates. Such estimates are typically ...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...