2539 search results - page 61 / 508 » Updates for Structure Indexes |
ICN
2007
Springer
15 years 6 months ago
2007
Springer
We propose a data structure–dynamic tree bitmap–for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tr...
100
click to vote
ICDE
2006
IEEE
15 years 6 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
SIGMOD
2010
ACM
15 years 2 days ago
2010
ACM
In this paper we investigate techniques that allow for on-line updates to columnar databases, leaving intact their high read-only performance. Rather than keeping differential str...
CCCG
2010
15 years 1 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
LPAR
2001
Springer
15 years 4 months ago
2001
Springer
A simple model of dynamic databases is studied from a modal logic perspecitve. A state α of a database is an atomic update of a state β if at most one atomic statement is evaluat...