298 search results - page 38 / 60 » Applying Theory Revision to the Design of Distributed Databa... |
ER
2004
Springer
14 years 28 days ago
2004
Springer
Updates over virtual XML views that wrap the relational data have not been well supported by current XML data management systems. This paper studies the problem of the existence of...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we introduce a new type of pattern – a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at diffe...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...