We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
When we derive multi-scale databases from a source spatial database, the geometries and topological relations, which are a kind of constraints defined explicitly or implicitly in ...
Spatio-temporal databases have been the focus of considerable research activity over a significant period. However, there are as of yet very few prototypes of complete systems, f...
Norman W. Paton, Alvaro A. A. Fernandes, Tony Grif...
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
Stratos Idreos, Martin L. Kersten, Stefan Manegold