806 search results - page 142 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
JPDC
2007
13 years 7 months ago
2007
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
DAIS
2006
13 years 9 months ago
2006
This paper shows how to build a scalable, robust and efficient distributed Internet-scale RDF repository, that we name PAGE (Put And Get Everywhere). 1 Motivation In the recent yea...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
ATMOS
2008
13 years 9 months ago
2008
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...
SPAA
2003
ACM
14 years 26 days ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...