317 search results - page 6 / 64 » Computing and Updating the Process Number in Trees |
VRCAI
2006
ACM
14 years 1 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
EDBTW
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we aim to develop a framework for continuous query processing in spatio-temporal databases. The proposed framework distinguishes itself from other query processors b...
DASFAA
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...