Sciweavers

2514 search results - page 49 / 503
» On the Computation of Approximations of Database Queries
Sort
View
VLDB
2000
ACM
151views Database» more  VLDB 2000»
15 years 9 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 11 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
SIGMOD
2012
ACM
275views Database» more  SIGMOD 2012»
13 years 8 months ago
Computational reproducibility: state-of-the-art, challenges, and database research opportunities
Computational experiments have become an integral part of the scientific method, but reproducing, archiving, and querying them is still a challenge. The first barrier to a wider...
Juliana Freire, Philippe Bonnet, Dennis Shasha
DBISP2P
2003
Springer
70views Database» more  DBISP2P 2003»
15 years 11 months ago
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
SAC
2004
ACM
15 years 11 months ago
Optimizing subset queries: a step towards SQL-based inductive databases for itemsets
ËØÓÖ Ò × Ø× Ò ÕÙ ÖÝ Ò Ø Ñ ´ º º¸ ×Ù × Ø ÕÙ Ö × Ø Ø ÔÖÓÚ ÐÐ ×ÙÔ Ö× Ø× Ó Ú Ò × Øµ × ÒÓÛÒ ØÓ Æ ÙÐØ Û Ø Ò Ö Ð Ø ÓÒ ...
Cyrille Masson, Céline Robardet, Jean-Fran&...