1248 search results - page 142 / 250 » Querying and Updating the File |
206
click to vote
FAST
2009
15 years 4 months ago
2009
The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. In this paper, we argue that named graphs alone can...
180
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
288
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
173
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
163
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...