66 search results - page 10 / 14 » Dynamic indexability and lower bounds for dynamic one-dimens... |
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
EUROPAR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
WAIM
2007
Springer
14 years 1 months ago
2007
Springer
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...